+91-9920808017
Take an Online Test - GK Test / Computer Organisation Test

Home >

Data Structures >

Data Structures

Abstract Data Types
Algorithms
Binary Heaps & Binary Search trees
Graphs

Queues
Sorting & Searching
Stacks
Trees

11:

Consider a hashing function that resolves collision by quadratic probing. Assume the address space is indexed from 1 to 8. Which of the following locations will never be probed if a collision occurs at position 4?

 A. 4 B. 5 C. 8 D. 2

12:

A hash table has space for 100 records. What is the probability of collision before the table is 10% full?

 A. 0.45 B. 0.5 C. 0.3 D. 0.34 (approximately)

13:

Which of the following statements is true?

I. As the number of entries inthe hash table incrases, the number of collisions increases.

II. Recursive programs are efficient.

III. The worst time complexity of quick sort is O (n2).

IV. Binary search implemented using a linked list is efficient.

 A. I and II B. II and III C. I and IV D. I and III

14:

A hash function randomly distributes records one by one in a space that can hold x number of records. The probability that the mth record is the first record to result in collision is

 A. (x-1) (x-2) ... (x-(m-2)) (m-1)/xm-4 B. (x-1) (x-2(... (x-(m-1()(m-1)/xm-1 C. (x-1) (x-2) ... (x-(m-2))(m-1)/xm D. (x-1)(x-2)...(x-(m-1))(m-1)/xm

15:

If the hashing function is the remainder on division, then clustering is more likely to occur if the storage space is divided into 40 sectors rather than 41. this conclusion is

 A. more likely to be false B. more likely to be true C. is always false D. none of the above