PYQBOOK
Filter Questions
Found 475 question(s)
Q441
MCQ
GATE
CS
Medium
2 Marks
2020
DS → Trees
In a balanced binary search tree with n elements, what is the worst case time complexity of reporting all elements in range [a, b]? Assume that the number of reported elements is k.
Q442
MCQ
GATE
CS
Easy
1 Mark
2020
DS → Trees
The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the following is the postorder traversal of the tree?
Q443
NAT
GATE
CS
Medium
1 Mark
2020
DS → Hash Tables
Consider a double hashing scheme in which the primary hash function is h1(k) = k mod 23, and the secondary hash function is h2(k) = 1 + (k mod 19). Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k = 90 is
Q444
NAT
GATE
CS
Medium
1 Mark
2020
DS → Hash Tables
Consider a double hashing scheme in which the primary hash function is h1(k) = k mod 23, and the secondary hash function is h2(k) = 1 + (k mod 19). Assume that the table size is 23. Then the address returned by probe 1 in the probe sequence (assume that the probe sequence begins at probe 0) for key value k = 90 is
Q445
MCQ
GATE
CS
Medium
1 Mark
2020
EM → Calculus