Data Structures and Algorithm Analysis
Questions 141 to 150
141.
|
Which
of the following statements is true
related to a B-tree?
|
||||||||||
A
simple graph has no loops. Which of the following forms another property of a
simple graph?
|
|||||||||||
Which
of the following information is not
saved in the activation record, when ever a function call is executed?
|
|||||||||||
Use
the following code and the linked list pictured below to answer the questions
24 - 26.
First
Then,
First ànextànextàdata
is
|
|||||||||||
Pick
the right option from the following:
I. Firstànext
== Temp1.
II. Temp1ànextàdata
== 60.
III. Temp2ànext ànext
== NULL.
|
|||||||||||
Decide
whether the syntax of each of the following statements is valid or invalid.
I. Firstànext = Temp1ànext;
II. First ànext = *( Temp2ànext);
III. * First = Temp2;
|
|||||||||||
Which
of the following is not possible
as a balance factor of any node of an AVL tree?
I. -2.
II. ±1.
III. 0.
IV. 2.
|
|||||||||||
Which
of the following statement(s) is/are TRUE in view of a multi-way search tree?
If a node has
I. 4 sub trees it contains 3 keys.
II. 5 keys, it has 7 sub trees.
III. 6 sub trees, it contains 6 keys.
IV. 10 keys if it contains 11 children.
|
|||||||||||
Identify
the name of the sorting in which time is not proportional to n2.
|
|||||||||||
How
many fields are required by a node to represent the polynomials in computer
memory using linked list?
|
Answers
141.
|
Answer
: (c)
Reason: All the leaf nodes appear at same level is true related to a B-tree.
|
Answer
: (d)
Reason: A simple graph has no loops. Other property
is to have no multiple edges.
|
|
Answer
: (b)
Reason: Current depth of recursion is not saved in the activation record, when
ever a function call is executed.
|
|
Answer
: (e)
Reason: the following code and the linked list
pictured
Then,
First ànextànextàdata
= 45
|
|
Answer
: (b)
Reason: Firstànext == Temp1 and Temp2ànext ànext
== NULL are true.
|
|
Answer
: (a)
Reason: The syntax of Firstànext
= Temp1ànext
is valid.
|
|
Answer
: (e)
Reason: -2 and 2 is not possible as a balance factor
of any node of an AVL tree.
|
|
Answer
: (e)
Reason: If a node has 4 sub trees it contains 3 keys
and 10 keys if it contains 11 children. is TRUE in view of a multi-way search
tree.
|
|
Answer
: (d)
Reason: Merge Sort is a sort in which time is not proportional to n2.
|
|
Answer
: (e)
Reason: Three fields are required by a not to
represent the polynomials in computer memory using linked list.
|
No comments :
Post a Comment