Data Structure and Algorithm Analysis
Questions 221 to 230
221.
|
In
linked list, a node contains atleast
|
||||||||||
Which
of the following is the correct big-O expression for 1 + 2 + 3 + ... + n?
|
|||||||||||
A
B-tree of order n is also called
|
|||||||||||
The
minimum number of keys contained in each non root node of a B-tree of order 11
are
|
|||||||||||
Row-major
order in two dimensional array refers to
|
|||||||||||
Null
pointer is used to define
I. End of linked list.
II. Empty pointer field of a structure.
III. The linked list is empty.
|
|||||||||||
Direct
or random access of element is not
possible in
|
|||||||||||
“Get a
node, store new element and insert the new node at the top” refers to insert
operation in non empty
|
|||||||||||
A
technique which collects all deleted spaces onto free storage list is called
|
|||||||||||
datatype *s;
datatype *p;
datatype *i;
p = malloc(100);
t=p; s=p+ (100/size of (datatype))-sizeof (datatype);
Func(datatype j )
{ if (p > s)
{printf (“overflow/n”); return:}
*p= j; p++;}
is
referring to
|
Answers
221.
|
Answer : (c)
Reason : next
address field, information field.
|
Answer : (d)
Reason : O(n²)
|
|
Answer : (c)
Reason : (n-1)-n
tree
|
|
Answer : (b)
Reason : 5
|
|
Answer : (a)
Reason : all
elements of a row are stored in memory in sequence followed by next row in
sequence and so on.
|
|
Answer : (e)
Reason : (I),
(II), (III) are correct
|
|
Answer : (c)
Reason : string
|
|
Answer : (a)
Reason : stack
|
|
Answer : (b)
Reason : Garbage
collection
|
|
Answer : (a)
Reason : push
operation of stack
|
what is the answer of question 227?
ReplyDeleteGreat post, great help for my exam preparation. thank you.
ReplyDeletehappy wheels