1

1. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, theexpected number of collisions involving a particular key x is :

- less than 1.
- less than n.
- less than m
- less than n/2.

2. The OS of a computer may periodically collect all the free memory space to form contiguousblock of free space. This is called

- Concatenation
- Garbage collection
- Collision
- Dynamic Memory Allocation

3. You have to sort a list L consisting of a sorted list followed by a few “random” elements.Which of the following sorting methods would be especially suitable for such a task?

- Bubble sort
- Selection sort
- Quick sort
- Insertion sort

4. B Trees are generally

- very deep and narrow
- very wide and shallow
- very deep and very wide
- cannot say

5. A technique for direct search is

- Binary Search
- Linear Search
- Tree Search
- Hashing

6. If a node having two children is deleted from a binary tree, it is replaced by its

- Inorder predecessor
- Inorder successor
- Preorder predecessor
- None of the above

7. The searching technique that takes O (1) time to find a data is

- Linear Search
- Binary Search
- Hashing
- Tree Search

8. A mathematical-model with a collection of operations defined on that model is called

- Data Structure
- Abstract Data Type
- Primitive Data Type
- Algorithm

9. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sortis

- 6
- 5
- 7
- 8

10. The postfix form of the expression (A B)*(C*D− E)*F / G is

- AB CD*E − FG /**
- AB CD* E − F **G /
- AB CD* E − *F *G /
- AB CDE * − * F *G /