Question : What is the primary purpose of hashing?
Solution :
Correct Answer : Searching data quickly
Description -
Question : Which data structure is mainly used with hashing?
Solution :
Correct Answer : Hash Table
Description -
Question : A good hash function should:
Solution :
Correct Answer : Minimize collisions
Description -
Question : Which collision resolution technique stores collided elements in linked lists?
Solution :
Correct Answer : Separate Chaining
Description -
Question : Which probing technique checks the next slot sequentially?
Solution :
Correct Answer : Linear Probing
Description -
Question : What is the average search complexity in a hash table?
Solution :
Correct Answer : O(1)
Description -
Question : Which data structure follows the Complete Binary Tree property?
Solution :
Correct Answer : Heap
Description -
Question : In a Max Heap, the root contains:
Solution :
Correct Answer : Maximum element
Description -
Question : In a Min Heap, every parent is:
Solution :
Correct Answer : Smaller than or equal to its children
Description -
Question : Heap Sort has worst-case complexity of:
Solution :
Correct Answer : O(n log n)
Description -
Question : What is the worst-case search complexity in a hash table?
Solution :
Correct Answer : O(n)
Description -
Question : Which of the following is NOT a collision resolution method?
Solution :
Correct Answer : Bubble Sort
Description -
Question : A Binomial Heap is mainly used because:
Solution :
Correct Answer : It supports efficient heap merging
Description -
Question : The merge operation in a Binomial Heap takes:
Solution :
Correct Answer : O(log n)
Description -
Question : Fibonacci Heap improves upon Binomial Heap mainly for:
Solution :
Correct Answer : Decrease-Key operation
Description -
Question : Which graph algorithm benefits most from Fibonacci Heap?
Solution :
Correct Answer : Dijkstra's Algorithm
Description -
Question : Which operation in a Fibonacci Heap has amortized O(1) complexity?
Solution :
Correct Answer : Insert
Description -
Question : Which heap has the best amortized complexity for Merge (Union)?
Solution :
Correct Answer : Fibonacci Heap
Description -
Question : Which of the following is true about load factor (α) in hashing?
Solution :
Correct Answer : α = Number of Elements / Number of Buckets
Description -
Question : Which statement correctly compares Binomial Heap and Fibonacci Heap?
Solution :
Correct Answer : Fibonacci Heap has better amortized decrease-key complexity.
Description -