1. An abstract data type that supports the operations
insert, delete and search is called a ——————
(a) Graph                                    (b) Dictionary
(c) Both (a) and (b)                    (d) None

2. Last In First Out: ————————
(a) Queue                              (b) Priority Queue
(c) Stack                                 (d) None

3. To solve any recurrence relation is called
———————— method
(a) substitution                  (b) general
(c) repetition                      (d) quick loop sort

4. TVSP stands for ————————
(a) Tree vertex splitting problem
(b) Travelling salesman problem
(c) Tree vertex salesman problem
(d) None

5. A ———————— schedule is a schedule in
which the processing of a task of any processor is
not terminated until the task is complete
(a) preemptive                      (b) non preemptive
(c) both (a) and (b)                (d) none

6. BFS stands for ————————
(a) Back Tracking first search
(b) Back First Search
(c) Binary First Search
(d) Breadth First Search

7. We are given n distinct positive numbers and we
desire to find all combinations of these numbers
whose sums are m. This is called ———————
(a) product of subsets             (b) product of numbers
(c) sum of numbers                 (d) sum of subsets

8. The ———————— optimization problem asks
for the smallest integer m for which the graph G
can be coloured
(a) Multistage                    (b) M-colorability
(c) Both (a) and (b)           (d) None