Data Structures and Algorithm Analysis
Questions 131 to 140
131.

The
inorder traversal of some binary tree produced the sequence HFIEJGZ, and the
postorder traversal of the same tree produced the sequence HIFJZGE. What
will be the total number of nodes in the left sub tree of the given tree?


Which
of the following shows the difference between a queue and a stack?


Which
of the following is generated by Folding method?


From
the following choose the one which belongs to the algorithm paradigm other
than to which others from the following belongs to.


Which
of the following data structures is used by breadth first search as an
auxiliary structure to hold nodes for future processing?


Pick
the correct statement(s) from the
following set of statements.
I. In the Kruskal’s algorithm, for the
construction of minimal spanning tree for a graph, the selected edges always
form a forest.
II. In Prim’s algorithm, for the construction
of minimal spanning tree for a graph, the selected edges always form an
orchard.
III. DFS, BFS algorithms always make use of a
queue, and stack respectively.


Which
of the following methods of collision processing has some of their addresses
may remain unchecked?


Consider
a tree ‘t’ has two subtrees t_{1} and t_{2}. Identify the
tree where the subtree t_{1} has minimum height and the subtree t_{2}
has maximum height.


Which
of the following is used to select the first entry which has the free block
equal to or more than required one in memory allocation?


What
is the total number of nodes at every level (L) of a complete binary tree?

Answers
131.

Answer
: (c)
Reason: The inorder traversal of some binary tree
produced the sequence HFIEJGZ, and the postorder traversal of the same tree
produced the sequence HIFJZGE. Then
the total number of nodes in the left sub tree of the given tree is 3.

Answer
: (e)
Reason: Queues use two ends of the structure; stacks
use only one show the difference between them.


Answer
: (a)
Reason: a hashing function is generated by Folding
method.


Answer
: (b)
Reason: Knapsack
problem is the one which belongs
to the algorithm paradigm other than to which others from the following
belongs to


Answer
: (a)
Reason: Queue is the data structure used by breadth
first search as an auxiliary structure to hold nodes for future processing.


Answer
: (a)
Reason: In the Kruskal’s algorithm, for the
construction of minimal spanning tree for a graph, the selected edges always
form a forest.


Answer
: (b)
Reason: Quadratic
collision processing has some of their addresses may remain unchecked.


Answer
: (a)
Reason: Consider a tree‘t’ has two sub trees t_{1}
and t_{2}. Fibonacci is the
tree where the sub tree t_{1} has minimum height and the sub tree t_{2}
has maximum height.


Answer
: (e)
Reason: First fit method is used to select the first
entry which has the free block equal to or more than required one in memory
allocation.


Answer
: (e)
Reason: The total number of nodes at every level ( L
) of a complete binary tree is 2^{L}.

No comments :
Post a Comment