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 :
  1. less than 1.
  2. less than n.
  3. less than m
  4. less than n/2.
Answer: A
Explanation:

Directing to forums.. wait...!

2. The OS of a computer may periodically collect all the free memory space to form contiguousblock of free space. This is called
  1. Concatenation
  2. Garbage collection
  3. Collision
  4. Dynamic Memory Allocation
Answer: B
Explanation:

Directing to forums.. wait...!

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?
  1. Bubble sort
  2. Selection sort
  3. Quick sort
  4. Insertion sort
Answer: D
Explanation:

Directing to forums.. wait...!

4. B Trees are generally
  1. very deep and narrow
  2. very wide and shallow
  3. very deep and very wide
  4. cannot say
Answer: D
Explanation:

Directing to forums.. wait...!

5. A technique for direct search is
  1. Binary Search
  2. Linear Search
  3. Tree Search
  4. Hashing
Answer: D
Explanation:

Directing to forums.. wait...!

6. If a node having two children is deleted from a binary tree, it is replaced by its
  1. Inorder predecessor
  2. Inorder successor
  3. Preorder predecessor
  4. None of the above
Answer: B
Explanation:

Directing to forums.. wait...!

7. The searching technique that takes O (1) time to find a data is
  1. Linear Search
  2. Binary Search
  3. Hashing
  4. Tree Search
Answer: C
Explanation:

Directing to forums.. wait...!

8. A mathematical-model with a collection of operations defined on that model is called
  1. Data Structure
  2. Abstract Data Type
  3. Primitive Data Type
  4. Algorithm
Answer: B
Explanation:

Directing to forums.. wait...!

9. The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sortis
  1. 6
  2. 5
  3. 7
  4. 8
Answer: B
Explanation:

Directing to forums.. wait...!

10. The postfix form of the expression (A B)*(C*D− E)*F / G is
  1. AB CD*E − FG /**
  2. AB CD* E − F **G /
  3. AB CD* E − *F *G /
  4. AB CDE * − * F *G /
Answer: A
Explanation:

Directing to forums.. wait...!