#### Q21: Maximum number of nodes for binary tree of height h are: (Assumption: Height of root is 1)

- (A) 2
^{h}+ 1 - (B) 2
^{h} - (C) 2
^{h}– 1 - (D) 2
^{h+1}– 1

#### Q22: Two dimensional arrays are also called ?

- (A) Matrix Array
- (B) Table Array
- (C) Both A and B
- (D) None of the Above

#### Q23: A mathematical-model with a collection of operations defined on that model is called

- (A) Data Structure
- (B) Abstract Data Type
- (C) Primitive Data Type
- (D) Algorithm

#### Q24: Select the true statement.

- (A) Every binary tree is either complete or full
- (B) Every complete binary tree is also a full binary tree
- (C) Every full binary tree is also a complete binary tree
- (D) No binary tree is both complete and full

#### Q25: Read the following statements carefully, and choose the correct answer.

I. The Ω notation is Anti Symmetric.

II. The big Oh notation is Semi Equivalence

- (A) (I) is FALSE but (II) is TRUE
**(B) Both (I), (II) are TRUE**- (C) (I) is TRUE but (II) is FALSE
- (D) Both (I), (II) are FALSE
- (E) (II) is TRUE and (I) cannot be defined

#### Q26: Can we read a data item at any location of a list within a constant time (i.e. O(1))?

- (A) Yes
- (B) Yes, only if the list is implemented by pointers (i.e. linked-list)
**(C) Yes, only if the list is implemented by an array**- (D) No, we need O(n) computation steps no matter what

#### Q27: The two basic types of record access methods are

**(A) sequential and random**- (B) direct and immediate
- (C) sequential and indexed
- (D) on-line and real-time
- (E) none of above

#### Q28: Queue is a ———– list.

- (A) LIFO
- (B) LILO
- (C) FILO
**(D) FIFO**

#### Q29: Linked lists are not suitable data structures for which one of the following problems

- (A) Insertion sort
**(B) Binary search**- (C) Radix sort
- (D) Polynomial manipulation

#### Q30: Linked lists are not suitable for implementing

- (A) Insertion sort
**(B) Binary search**- (C) Radix sort
- (D) Polynomial manipulation

## Answers:

Question | Q21 | Q22 | Q23 | Q24 | Q25 | Q26 | Q27 | Q28 | Q29 | Q30 |

Answer | B | C | B | B | B | C | A | D | B | B |