Q34 the number of different directed trees with 3

Q.34 The number of different directed trees with 3 nodes are
(A) 2 (B)
(C) 4 (D)
Ans: B
3
5

DC08 DATA STRUCTURES
Q.35 One can convert a binary tree into its mirror image by traversing it in
6
Q.36 The total number of companions required to merge 4 sorted files containing 15, 3, 9 and 8
records into a single sorted file is
39
3
Q.37 In a linked list with n nodes, the time taken to insert an element after an element pointed by
some pointer is Q.38
The data structure required to evaluate a postfix expression is
(A) queue (B) stack
(C) array (D) linked-list
Ans:B
Q.39 The data structure required to check whether an expression contains balanced parenthesis is
Q.40 The complexity of searching an element from a set of n elements using Binary search
algorithm is Q.41 The number of leaf nodes in a complete binary tree of depth d is
Q.42 What data structure would you mostly likely see in a nonrecursive implementation of a
recursive algorithm?
(A) Stack (B) Linked list
(C) Queue (D) Trees

DC08 DATA STRUCTURES
Ans:A
7
Q.43 Which of the following sorting methods would be most suitable for sorting a list which is
almost sorted
Q.44
A B-tree of minimum degree t can maximum _____ pointers in a node.
t
Q.45 The process of accessing data stored in a serial access memory is similar to manipulating data
on a
Q.46 A graph with n vertices will definitely have a parallel edge or self loop if the total number of
edges are
(A) greater than n–1 (B) less than n(n–1)
(C) greater than n(n–1)/2 (D) less than n
2
/2
Ans:A