#### Q11: Which data structure is best suited to implement binary search?

- (A) Linked list
- (B) Stack
- (C) Queue
- (D) Array

#### Q12: The value of first linked list address is ?

- (A) 0
- (B) -1
- (C) 1
- (D) None of Above

#### Q13: An ADT is defined to be a mathematical model of a user-defined type along with the collection of all____________ operations on that model.

- (A) Cardinality
- (B) Assignment
- (C) Primitive
- (D) Structured

#### Q14: The number of different trees with 8 nodes is

- (A) 256
- (B) 255
- (C) 248
- (D) 260

#### Q15: Find the odd one out

- (A) Bin-Packing Problem
- (B) TVSP Problem
- (C) Knap Sack Problem
- (D) OBST Problem
- (E) Sum of Subset

#### Q16: Which of the following are essential statement types for describing algorithms?

- (A) Sequence
- (B) Selection
- (C) Repetition
- (D) All the above
- (E) A and B Only

#### Q17: An algorithm is complete if

- (A) It terminates with a solution when one exists
- (B) It starts with a solution
- (C) It does not terminate with a solution
- (D) It has a loop
- (E) It has a decision parameter.

#### Q18: When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing n elements)

- (A) q(n) and q(1) respectively
- (B) q(n) and q(n) respectively
- (C) q(1) and q(1) respectively
- (D) None of the above

#### Q19: A linear collection of data elements where the linear node is given by means of pointer is called

- (A) Linked list
- (B) Node list
- (C) Primitive list
- (D) None of these

#### Q20: The expression X=4+2%-8 evaluate

- (A) -6
- (B) 6
- (C) 4
- (D) None

## Answers:

Question | Q11 | Q12 | Q13 | Q14 | Q15 | Q16 | Q17 | Q18 | Q19 | Q20 |

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