Q.67 The constructed datatype of C is known as

(A) Pointers (B) String

(C) Structure (D) Array

Ans: C

Structure is a constructed datatype of C

Q.71 Inorder to get the information stored in a BST in the descending order, one should

traverse it in which of the following order?

(A) left, root, right (B) root, left, right

(C) right, root, left (D) right, left, root

Ans: (C)

Q.72 Every internal node in a B-tree of minimum degree 2 can have

(A) 2, 3 or 4 children (B) 1, 2 or 3 children

(C) 2, 4 or 6 children (D) 0, 2 or 4 children

Ans: (B)

Q.73 Which sorting algorithm is the best if the list is already in order?

(A) Quick sort (B) Merge sort

(C) Insertion sort (D) Heap sort

Ans: (C)

Q.74 In _________ the difference between the height of the left sub tree and height of right

sub tree, for each node, is not more than one

(A) BST (B) Complete Binary Tree

(C) AVL-tree (D) B-tree

Ans: (C)

Q.75 The number of comparisons required to sort 5 numbers in ascending order using bubble

sort is

(A) 7 (B) 6

(C) 10 (D) 5

Ans: (C)

Q.76 The complexity of adding two matrices of order m*n is

(A) m + n (B) mn

(C) max(m, n) (D) min(m, n)

Ans: (B)

Q.78 If the inorder and preorder traversal of a binary tree are D,B,F,E,G,H,A,C and

A,B,D,E,F,G,H,C respectively then the postorder traversal of that tree is

(A) D,F,G,A,B,C,H,E (B) F,H,D,G,E,B,C,A

(C) C,G,H ,F,E,D,B,A (D) D,F,H,G,E,B,C,A

Ans: (D)

Q.79 In a binary tree, the number of terminal or leaf nodes is 10. The number of nodes with

two children is

(A) 9 (B) 11

(C) 15 (D) 20

Ans: (A)

Q.80 Which amongst the following cannot be a balance factor of any node of an AVL tree?

(A) 1 (B) 0

(C) 2 (D) –1

Ans: (C)