Question 10555 – GATE 1990

Match the pairs in the following questions:

(a) A heap construction                            (p) Ω(n log₁₀ n)
(b) Constructing Hash table with linear probing    (q) O(n)
(c) AVL Tree construction                          (r) O(n²)
(d) Digital trie construction                      (s) O(n log₁₀ n)

Correct Answer: A

Question 6 Explanation:

Heap construction – O(n)
Constructing Hash table with linear probing – O(n²
AVL tree construction – O(n log₁₀ n)
Digital trie construction – Ω(n log₁₀ n)

(a) – (q), (b) – (r), (c) – (s), (d) – (p)

0 0 votes

Article Rating

0 Comments

Inline Feedbacks

View all comments