Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Multiple Choice Questions
Q641: What is a key feature of a hash table's storage in the context of hashing?
- A: Data is stored in consecutive locations
- B: Data is stored in sorted order
- C: Data is stored based on hash indices
- D: Data is stored in a linked list
View Answer
C
Q642: In the hashCode function, what is done with the ASCII values of characters?
- A: Added together and then modded with table size
- B: Multiplied together and then modded with table size
- C: Added together and then multiplied by table size
- D: Multiplied together and then added to table size
View Answer
A
Q643: What is a disadvantage of using a simple modulo operation for hashing?
- A: It may lead to collisions if the key distribution is uneven
- B: It ensures even distribution of keys
- C: It results in faster retrieval times
- D: It avoids gaps in array storage
View Answer
A
Q644: How does an AVL tree maintain its balance?
- A: By using hashing
- B: By ensuring all nodes have the same height
- C: By performing rotations to balance the tree
- D: By sorting nodes at each level
View Answer
C
Q645: Which data structure uses a table with non-consecutive storage locations for entries?
- A: Linked list
- B: Hash table
- C: Binary search tree
- D: AVL tree
View Answer
B
Q646: What operation is performed by the remove method in hashing?
- A: Calculate storage place and set it to null
- B: Calculate storage place and retrieve the data
- C: Retrieve data and remove it from the table
- D: Insert new data at the calculated index
View Answer
A
Q647: What is a common issue with using a hash function where T is not a prime number?
- A: The hash values might be unique for all keys.
- B: The hash values might be evenly distributed.
- C: The hash values might collide more frequently.
- D: The hash values might be always different.
View Answer
C
Q648: What is a good practice to avoid collisions in hash functions?
- A: Use a non-prime number for T.
- B: Use a large hash table size.
- C: Use a prime number for T.
- D: Use multiple hash functions.
View Answer
C
Q649: What problem arises when two different keys hash to the same index?
- A: Collision
- B: Collision Resolution
- C: Linear Probing
- D: Hash Table Overflow
View Answer
A
Q650: What technique is used to handle collisions by finding the next available position in the array?
- A: Linear Probing
- B: Quadratic Probing
- C: Linked List
- D: Open Addressing
View Answer
A