數(shù)據(jù)結(jié)構(gòu)（全英文）智慧樹(shù)知到期末考試答案2024年

數(shù)據(jù)結(jié)構(gòu)（全英文）智慧樹(shù)知到期末考試答案2024年數(shù)據(jù)結(jié)構(gòu)（全英文）Consider

the

following

definition

in

C

programming

languagestruct

node

{

int

data;

struct

node

*

next;}typedef

struct

node

NODE;NODE

*ptr;Which

of

the

following

c

code

is

used

to

create

new

node?(

)

A:ptr=(NODE*)malloc(sizeof(NODE));B:malloc(sizeof(NODE));C:ptr=(NODD:ptr=(NODE*)malloc(NODE);E:ptr=(NODE*)malloc(sizeof(NODE*));答案:ptr=(NODE*)malloc(sizeof(NODE));26.

Identify

the

recursive

expression

to

obtain

the

nth

Fibonacci

number

using

recursion.

(

)

A:fib(n)=fib(n+1)+fib(n+2)B:fib(n-1)=fib(n)+fib(n+1)C:fib(n+1)=fib(n)+fib(n-1)D:fib(n)=fib(n-1)+fib(n-2)答案:bConsider

the

following

C

code,

where

stack

is

implemented

using

the

array.#define

MAX

10struct

STACK

{

int

arr[MAX]

int

top

=

-1;}In

this

implementation

of

stack,

maximum

value

of

top

which

cannot

cause

overflow

will(

)

A:-1B:9C:1D:10答案:945.

If

there

are

n

non-zero

terms

in

a

polynomial,

the

size

of

the

array

required

would

be________.(

)

A:2n-1B:2n+1C:nD:2n答案:n39.

In

the

polynomial,

A(x)=

x4+10x3+3x2+1,

what

is

(coefficient,

exponent)

pair

of

last

term?

(

)

A:(0,1)B:(1,4)C:(4,1)D:(1,0)答案:(1,0)Deletion

of

an

element

from

the

array

reduces

the

size

of

array

by

(

)

A:oneB:threeC:zeroD:two答案:oneA

normal

queue,

if

implemented

using

an

array

of

size

MAX_SIZE

in

C,

gets

full

when(

)

A:front=rear+1B:rear=MAX_SIZE-1C:rear=frontD:front=(rear+1)mod

MAX_SIZE答案:rear=MAX_SIZE-1Nodes

that

have

degree

zero

are

called

________nodes.(

)

A:childB:non-terminalC:rootD:leaf答案:leafIf

the

elements

“A”,

“B”,

“C”

and

“D”

are

placed

in

a

queue

and

are

deleted

one

at

a

time,

in

what

order

will

they

be

removed(

)

A:ABDCB:DCBAC:DCABD:ABCD答案:ABCDArray

which

is

having

____________

dimensions

is

called

as

2-D

array.(

)

A:4B:3C:1D:2答案:2If

we

have

declared

an

array

as

int

arr[6];

then

which

of

the

following

array

element

is

considered

as

last

array

element

in

C?(

)

A:arr[0]B:arr[5]C:arr[6]D:arr[4]答案:arr[5]If

the

elements

“A”,

“B”,

“C”

and

“D”

are

placed

in

a

stack

and

are

deleted

one

at

a

time,

in

what

order

will

they

be

removed?(

)

A:DCABB:ABCDC:ABDCD:DCBA答案:DCBAWhat

data

structure

would

you

mostly

likely

see

in

implementation

of

a

recursive

algorithm?(

)

A:QueueB:TreeC:ArrayD:Stack答案:StackChildren

of

the

same

parent

said

to

be______nodes.(

)

A:rootB:childC:siblingD:leaf答案:siblingIf

we

store

the

nodes

of

a

binary

tree

in

an

array

with

index

starting

from

zero,

if

the

leftchild

is

at

index

n,

its

right

brother

at(

)

A:2n+2B:(n-1)/2C:2n+1D:n+1

答案:2n+1User

perform

following

operations

on

stack

of

size

five

:

push(1);pop();push(2);push(3);pop();push(4);pop();pop();push(5);

at

the

end

of

last

operation,

total

number

of

elements

present

in

the

stack

are(

)

A:D.1B:A.3C:C.2D:B.4答案:D.1Whatwouldbetheasymptotictimecomplexitytofindanelementinthelinkedlist?

A:NoneB:O(n)C:O(n2)D:O(1)答案:O(n)A

variant

of

linked

list

in

which

last

node

of

the

list

points

to

the

first

node

of

the

list

is?(

)

A:Multiply

linked

listB:Singly

linked

listC:Circular

linked

listD:Doubly

linked

list答案:AI參考:答案：C：Circularlinkedlist\n\n解釋?zhuān)侯}目中描述的是一個(gè)鏈表結(jié)構(gòu)，其中最后一個(gè)節(jié)點(diǎn)指向第一個(gè)節(jié)點(diǎn)，這種結(jié)構(gòu)被稱(chēng)為循環(huán)鏈表（Circularlinkedlist）。其他選項(xiàng)中，單鏈表（Singlylinkedlist）的最后一個(gè)節(jié)點(diǎn)不指向第一個(gè)節(jié)點(diǎn)，雙鏈表（Doublylinkedlist）的最后一個(gè)節(jié)點(diǎn)指向下一個(gè)節(jié)點(diǎn)而不是指向第一個(gè)節(jié)點(diǎn)，而多鏈表（Avariantoflinkedlist）沒(méi)有明確描述最后一個(gè)節(jié)點(diǎn)指向第一個(gè)節(jié)點(diǎn)的結(jié)構(gòu)。因此，正確答案是C。'26.

Identify

the

recursive

expression

to

obtain

the

nth

Fibonacci

number

using

recursion.

(

)

A:fib(n)=fib(n+1)+fib(n+2)B:fib(n-1)=fib(n)+fib(n+1)C:fib(n+1)=fib(n)+fib(n-1)D:fib(n)=fib(n-1)+fib(n-2)答案:AI參考:正確答案是D：fib(n)=fib(n-1)+fib(n-2)。\n根據(jù)斐波那契數(shù)列的定義，每個(gè)數(shù)字是前兩個(gè)數(shù)字的和，因此可以使用遞歸表達(dá)式fib(n)=fib(n-1)+fib(n-2)來(lái)計(jì)算第n個(gè)斐波那契數(shù)。選項(xiàng)D是正確的遞歸表達(dá)式。'In

algorithm

which

converts

infix

expression

to

postfix

expression.

the

ICP

stands

for(

)

A:In-Coming

PriorityB:Inside-Count

PriorityC:In-Count

Primary

D:None

of

the

above答案:AI參考:題目中的空格部分應(yīng)填入一個(gè)關(guān)于某種算法或程序部分的名稱(chēng)，這個(gè)算法或程序負(fù)責(zé)將infix表達(dá)式轉(zhuǎn)換為postfix表達(dá)式。而選項(xiàng)A的“In-ComingPriority”與題目描述不符，選項(xiàng)B的“Inside-CountPriority”和選項(xiàng)C的“In-CountPrimary”雖然可能與某種特定的算法或程序有關(guān)，但并不能從題目描述中直接得出。因此，選項(xiàng)D“Noneoftheabove”是正確的答案。\n\n所以，正確選項(xiàng)是【D:Noneoftheabove】。'45.

If

there

are

n

non-zero

terms

in

a

polynomial,

the

size

of

the

array

required

would

be________.(

)

A:2n-1B:2n+1C:nD:2n答案:AI參考:正確答案是D：2n。\n多項(xiàng)式中如果有n個(gè)非零項(xiàng)，那么需要的數(shù)組大小為(n+1)×(n-1)/2，即2n。因此選項(xiàng)D為正確答案。'24.

A

function

which

calls

itself

is

called

as

______function.(

)

A:recursiveB:iterativeC:staticD:dynamic答案:AI參考:正確答案是A：recursive（遞歸的）。\n遞歸函數(shù)是指一個(gè)函數(shù)直接或間接調(diào)用自身，所以選項(xiàng)A“recursive”是正確答案。選項(xiàng)B“iterative”（迭代的）描述的是重復(fù)的過(guò)程，與遞歸不符；選項(xiàng)C“static”（靜態(tài)的）和選項(xiàng)D“dynamic”（動(dòng)態(tài)的）描述的是其他性質(zhì)，與本題無(wú)關(guān)。'In

the

stack,

if

user

try

to

remove

element

from

the

empty

stack

then

it

called

as

(

)

A:garbageB:underflowC:emptyD:overflow答案:AI參考:在堆棧中，如果用戶嘗試從空堆棧中刪除元素，那么這被稱(chēng)為“下溢”。因此，正確答案是B:underflow。'66.

If

an

algorithm

include

two

for

(or

while)

loops,

the

time

complexity

of

algorithm

may

become________.(

)

A:constantB:linear.C:logarithmic.D:quadratic答案:AI參考:答案：D\n推理過(guò)程：算法包含兩個(gè)for（或while）循環(huán)，其時(shí)間復(fù)雜度可能會(huì)變?yōu)槎蔚?。因此，選項(xiàng)D為正確答案。\n\n解釋?zhuān)簳r(shí)間復(fù)雜度是用來(lái)衡量算法執(zhí)行時(shí)間的一個(gè)指標(biāo)，它通常用算法執(zhí)行次數(shù)與輸入規(guī)模之間的關(guān)系來(lái)描述。如果一個(gè)算法包含兩個(gè)嵌套循環(huán)，那么其執(zhí)行次數(shù)可能會(huì)增加，從而導(dǎo)致時(shí)間復(fù)雜度增加。具體來(lái)說(shuō)，如果嵌套循環(huán)的次數(shù)與輸入規(guī)模呈線性關(guān)系，那么時(shí)間復(fù)雜度就是線性的；如果呈對(duì)數(shù)關(guān)系，那么時(shí)間復(fù)雜度就是對(duì)數(shù)的；如果呈平方關(guān)系，那么時(shí)間復(fù)雜度就是二次的。在本題中，由于沒(méi)有給出具體的算法和輸入規(guī)模，我們無(wú)法確定時(shí)間復(fù)雜度具體是多少，但可以確定的是它不會(huì)是常數(shù)和logarithmic。因此，選項(xiàng)D是正確答案。'The

preorder

traversal

sequence

of

a

binary

search

tree

is

30,

20,

10,

15,

25,

23,

39,

35,

42.

Which

one

of

the

following

is

the

postorder

traversal

sequence

of

the

same

tree?(

)

A:15,

10,

25,

23,

20,

42,

35,

39,

30B:15,

20,

10,

23,

25,

42,

35,

39,

30C:15,

10,

23,

25,

20,

35,

42,

39,

30D:10,

20,

15,

23,

25,

35,

42,

39,

30答案:AI參考:答案為D：10,

20,

15,

23,

25,

35,

42,

39,

30\n\n原始二叉搜索樹(shù)的前序遍歷序列為30,20,10,15,25,23,39,35,42，因此可以推斷出它是一個(gè)二叉搜索樹(shù)。對(duì)于一個(gè)二叉搜索樹(shù)，前序遍歷的逆序后序遍歷也是一棵二叉搜索樹(shù)。所以選項(xiàng)D是正確的后序遍歷序列。因此，答案為D。'The

______implementation

uses

arrays

to

create

stack.(

)

A:linkedB:static

C:dynamicD:linear答案:AI參考:正確答案是C:dynamic。\n根據(jù)題意，這個(gè)動(dòng)態(tài)的實(shí)現(xiàn)使用數(shù)組來(lái)創(chuàng)建堆棧。因此，選項(xiàng)C“dynamic”是正確答案。選項(xiàng)A“l(fā)inked”表示鏈接的，選項(xiàng)B“static”表示靜態(tài)的，選項(xiàng)D“l(fā)inear”表示線性的，都與題目中的描述不符。'68.

What

is

the

not

the

property

of

linked

list?

(

)

A:The

space

required

is

proportional

to

its

lengthB:Random

access

of

any

node

is

easyC:There

is

no

need

to

estimate

the

storage

space

D:Insertion

and

deletion

do

not

require

the

element

to

be

moved答案:AI參考:正確答案是：D:Insertion

and

deletion

do

not

require

the

element

to

be

moved。\n鏈表是一種非連續(xù)存儲(chǔ)結(jié)構(gòu)，因此插入和刪除不需要移動(dòng)元素，所以D選項(xiàng)正確。空間需求與長(zhǎng)度成比例，這是數(shù)組的特點(diǎn)；鏈表節(jié)點(diǎn)隨機(jī)訪問(wèn)困難；插入和刪除需要估計(jì)存儲(chǔ)空間。因此，選項(xiàng)A、B、C都不正確。'48.

What

is

the

maximum

number

of

nodes

with

degree

zero

in

a

binary

tree

at

level

3?

(

)

A:3B:5C:9D:4答案:AI參考:正確答案是B，5。在一個(gè)二叉樹(shù)中，如果一個(gè)節(jié)點(diǎn)的高度為n，那么它左右子樹(shù)的高度之和最多為n-1。因此，一個(gè)節(jié)點(diǎn)的高度為3時(shí)，其左右子樹(shù)最多可以有兩個(gè)。另外，高度為3的節(jié)點(diǎn)可能是根節(jié)點(diǎn)或者是第二個(gè)級(jí)別下得第二個(gè)節(jié)點(diǎn)的右子節(jié)點(diǎn)或第三個(gè)級(jí)別的根節(jié)點(diǎn)，這樣使得所有可能的度為0的節(jié)點(diǎn)總數(shù)不超過(guò)5個(gè)。因此，答案為B。'Identify

the

infix

expression.(

)

A:None

of

the

aboveB:+A

BC:AB+

D:A+B答案:AI參考:正確答案是D:A+B。\n根據(jù)題目中的描述，需要識(shí)別一個(gè)中綴表達(dá)式。選項(xiàng)A表示“以上都不是”，不符合中綴表達(dá)式的定義；選項(xiàng)B和C中的符號(hào)不符合中綴表達(dá)式的規(guī)則；只有選項(xiàng)D中的A+B符合中綴表達(dá)式的定義，即運(yùn)算符位于兩個(gè)操作數(shù)之間。因此，正確答案是D。'In

order

to

keep

track

of

current

topmost

element

of

the

stack

we

need

to

maintain

one

variable

called(

)

A:falseB:bottomC:topD:true答案:AI參考:正確選項(xiàng)是B:bottom。\n\n在題目中提到需要維護(hù)一個(gè)變量來(lái)追蹤棧中當(dāng)前最頂部的元素，而選項(xiàng)B“bottom”正是這樣一個(gè)變量名稱(chēng)，它通常用于表示棧的最底部元素。其他選項(xiàng)A、C、D都不符合題意。因此，答案為B。'When

user

switch

from

one

function

to

other

then

the

details

of

previous

function

are

stored

into

the

stack.(

)

A:TrueB:False答案:AI參考:答案：A:True\n根據(jù)題目描述，當(dāng)用戶從一個(gè)功能切換到另一個(gè)功能時(shí)，前一個(gè)功能的詳細(xì)信息會(huì)被存儲(chǔ)到堆棧中。所以這個(gè)說(shuō)法是正確的，即選項(xiàng)A為正確答案。'Array

which

is

having

____________

dimensions

is

called

as

2-D

array.(

)

A:4B:3C:1D:2答案:AI參考:正確答案是：D:2。\n本題考察數(shù)組維度知識(shí)。題目中描述“一個(gè)具有**2**維度的數(shù)組”也就是一個(gè)二維數(shù)組。所以答案是D選項(xiàng)。'The

________notation

is

used

in

Computer

Science

to

describe

the

performance

or

complexity

of

an

algorithm.（

）

A:Big

PB:Small

OhC:BigD:Big

Oh答案:AI參考:正確答案是D：Big

Oh。\n表示法"表示法"，因此要選擇與"表示法"相符的詞。在選項(xiàng)中只有D是表示"大"的意思，故答案為D。因此，正確答案是D，表示法的標(biāo)志。BigOh（大O符號(hào)）是一種表示算法復(fù)雜性的方法，主要用于衡量算法執(zhí)行時(shí)間對(duì)輸入大小的敏感度。故答案為D。'4.

Within

a

computer,

all

information

is

accessed,

processed

and

transmitted

in

the

form

of:(

)

A:HexadecimalB:BCD

C:ACSIID:Binary

答案:AI參考:正確答案是D：二進(jìn)制。\n計(jì)算機(jī)內(nèi)部所有信息都是以二進(jìn)制的形式進(jìn)行訪問(wèn)、處理和傳輸?shù)?。因此，正確答案是D。二進(jìn)制是一種只有0和1兩種狀態(tài)的比特序列，是計(jì)算機(jī)中常用的數(shù)據(jù)表示和傳輸方式。其他選項(xiàng)中，十六進(jìn)制、BCD和ACSII都不是計(jì)算機(jī)內(nèi)部信息表示和傳輸?shù)臉?biāo)準(zhǔn)方式。'Which

of

the

following

data

structures

is

a

nonlinear

structure?

(

)

A:Binary

treeB:Stack

C:Queue

D:Linked

list

答案:AI參考:正確答案是D:Linkedlist。\n鏈表是一種非線性的數(shù)據(jù)結(jié)構(gòu)，它是由一系列節(jié)點(diǎn)組成的，每個(gè)節(jié)點(diǎn)包含數(shù)據(jù)和指向下一個(gè)節(jié)點(diǎn)的指針。而二叉樹(shù)、棧和隊(duì)列都是線性結(jié)構(gòu)，其中二叉樹(shù)是樹(shù)形結(jié)構(gòu)，棧是后進(jìn)先出（LIFO）的數(shù)據(jù)結(jié)構(gòu)，隊(duì)列是先進(jìn)先出（FIFO）的數(shù)據(jù)結(jié)構(gòu)。因此，答案為D。'64.

What

of

the

following

statements

is

incorrect

regarding

linked

lists?

(

)

A:Linked

lists

are

example

for

dynamic

data

structureB:Linked

lists

example

for

linear

data

structureC:Linked

lists

can

be

circularD:Linked

lists

is

an

example

of

nonlinear

data

structure答案:AI參考:題目描述：以下關(guān)于鏈表的陳述哪個(gè)不正確？\n\n根據(jù)題目要求，我們需要找出關(guān)于鏈表表述不正確的選項(xiàng)。\n\n選項(xiàng)分析：\n\nA.Linkedlistsareexamplefordynamicdatastructure（鏈表是動(dòng)態(tài)數(shù)據(jù)結(jié)構(gòu)的示例）-正確。鏈表是一種動(dòng)態(tài)數(shù)據(jù)結(jié)構(gòu)，可以根據(jù)需要?jiǎng)討B(tài)地添加或刪除元素。\n\nB.Linkedlistsareexampleforlineardatastructure（鏈表是線性數(shù)據(jù)結(jié)構(gòu)的示例）-錯(cuò)誤。鏈表是一種鏈?zhǔn)浇Y(jié)構(gòu)，每個(gè)元素都鏈接到下一個(gè)元素，因此是線性的。\n\nC.Linkedlistscanbecircular（鏈表可以是循環(huán)的）-正確。鏈表可以通過(guò)在最后一個(gè)元素后鏈接一個(gè)新的元素形成一個(gè)循環(huán)。\n\nD.Linkedlistsisanexampleofnonlineardatastructure（鏈表是非線性數(shù)據(jù)