GATE 2014 [Set-1]
January 4, 2024Question 8446 – Aptitude
January 4, 2024Question 10555 – GATE 1990
Match the pairs in the following questions:
(a) A heap construction (p) Ω(n log10 n) (b) Constructing Hash table with linear probing (q) O(n) (c) AVL Tree construction (r) O(n2) (d) Digital trie construction (s) O(n log10 n)
Correct Answer: A
Question 6 Explanation:
Heap construction – O(n)
Constructing Hash table with linear probing – O(n2
AVL tree construction – O(n log10 n)
Digital trie construction – Ω(n log10 n)
Constructing Hash table with linear probing – O(n2
AVL tree construction – O(n log10 n)
Digital trie construction – Ω(n log10 n)
(a) – (q), (b) – (r), (c) – (s), (d) – (p)