GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2021 · Set-1
Programming & Data StructuresHashinghardMSQ2 marks
Consider a dynamic hashing approach for 4-bit integer keys: 1. There is a main hash table of size \(4\). 2. The two least significant bits of a key index the main hash table. 3. Initially, all main-hash-table entries are empty. 4. On collision, keys at a main-hash-table entry are organized as a binary tree that grows on demand. 5. The third least significant bit first divides keys into left and right subtrees. 6. Further collisions divide each binary-tree node using the fourth least significant bit. 7. A split is done only when needed. Consider the following state of the hash table. Which key-insertion sequence can cause this state?

Select every correct option.

Save your progress

Related Programming & Data Structures PYQs

GATE 2021 · Set-1

A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than t…

GATE 2021 · Set-1

Consider the following sequence of operations on an empty stack. push(54); push(52); pop(); push(55); push(62); s = pop(); Conside…

GATE 2021 · Set-1

Consider the following ANSI C program. ```c #include <stdio.h> int main() { int i, j, count; count = 0; i = 0; for (j = -3…

GATE 2021 · Set-1

Consider the following ANSI C function: ```c int SimpleFunction(int Y[], int n, int x) { int total = Y[0], loopIndex; for (loo…

GATE 2021 · Set-2

Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal …

GATE 2021 · Set-2

Consider the following ANSI C program. ```c #include <stdio.h> int main(){ int arr[4][5]; int i, j; for (i=0; i<4; i++){ …