- Option : B
- Explanation :

Given hash function: h(K) = floor (m (K*A mod 1)) where A = ( √(5) – 1)/2

h(123456) = floor(10000 * (123456 * (√5 − 1) / 2) mod 1)

= floor(10000 * (76300.004115 mod 1)

= floor(10000 * (.004115))

= 41.15

= 41

So, option (B) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : D
- Explanation :

Initially we have:

When we insert 10 and 17:

We have to maintain max-heap, so:

The level-order traversal of the heap after the insertion of the element is 20, 18, 17, 13, 12, 10, 15 So, option (D) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : B
- Explanation :

If there are n integers to sort, each integer has d digits, and each digit is in the set {1, 2, ..., k}, radix sort can sort the numbers in O(d (n + k)). For more information Refer:Radix Sort Option (B) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.