181. The
worst case complexity of binary search matches with ...............

(A) interpolation search

(B) linear search

(C) merge sort

(D) none of the above

Answer: B

182. A
binary tree in which if all its levels except possibly the last, have the
maximum number of nodes and all the nodes at the last level appear as far left
as possible, is known as

(A) full binary tree

(B) AVL tree

(C) threaded tree

(D) complete binary tree

Answer: A

183. A
linear list of elements in which deletion can be done from one end (front) and
insertion

can take place only at the other end (rear)
is known as a .................

(A) Queue

(B) Stack

(C) Tree

(D) Linked list

Answer: A

184. What
is the postfix form of the following prefix expression -A/B*C$DE ?

(A) ABCDE$*/-

(B) A-BCDE$*/-

(C) ABC$ED*/-

(D) A-BCDE$*/

Answer: A

185. The
following formula will produce:

F

_{n}= F_{n-1}+ F_{n-2}
(A) Armstrong Number

(B) Fibonacci Series

(C) Euler Number

(D) Prime Number

Answer: B

186. All
possible spanning trees of graph G:

(A) have same number of edges and vertices.

(B) have same number of edges and but not
vertices.

(C) have same number of vertices but not
edges.

(D) depends upon algorithm being used.

Answer: A

187. A
full binary tree with n leaves contains .............

(A) n nodes

(B) log n

_{2}nodes
(C) 2n –1 nodes

(D) 2

^{n}nodes
Answer: C

188. The
Î˜ notation in asymptotic evaluation represents ...........

(A) Base case

(B) Average case

(C) Worst case

(D) NULL case

Answer: B

189. A
sort which relatively passes through a list to exchange the first element with
any element less than it and then repeats with a new first element is called
................

(A) Insertion sort

(B) Selection sort

(C) Heap sort

(D) Quick sort

Answer: D

190. Which
of the following sorting algorithms does not have a worst case running time of O(n

^{2}) ?
(A) Insertion sort

(B) Merge sort

(C) Quick sort

(D) Bubble sort

Answer: B

## 0 Comments