Question 86
What is the load factor α of a hash table with m = 20 slots and n = 50 stored keys?
📘 Detailed Solution
Load factor α = n / m = 50 / 20 = 2.5.
✓ Saved
GATE DA Python Data Structures & Collections | Set 1
Your score
0/100
0 answered
Correct 0
Incorrect 0
Unanswered 100
Accuracy 0%
Question 87
What is the average case time complexity of search, insertion, and deletion in an AVL Tree with N nodes?
📘 Detailed Solution
An AVL tree is a strictly self-balancing binary search tree, guaranteeing O(log N) height and O(log N) search/insert/delete operations.
✓ Saved
Question 88
Evaluate the sum of values of all nodes in a BST constructed by inserting keys [15, 10, 20, 5]:
📘 Detailed Solution
Keys in tree: 15, 10, 20, 5. Sum = 15 + 10 + 20 + 5 = 50.
✓ Saved
Question 89
What problem occurs in linear probing when multiple keys hash to nearby slots, creating long contiguous chains of occupied slots?
📘 Detailed Solution
Primary clustering occurs in linear probing when consecutive occupied slots form large contiguous blocks, increasing average probe times.
✓ Saved
Question 90
How many NULL pointers exist in a standard Singly Linked List of N = 8 nodes?
📘 Detailed Solution
In a singly linked list of N nodes, only the next pointer of the last node is NULL (1 NULL pointer).
✓ Saved