Database Management System MCQs with Answers
Practice important Database Management System MCQs with answers and explanations.
Multiple Choice Questions
Q601: When using re-hashing, what is done when a collision occurs?
- A: A new hash function is applied to find an empty slot
- B: The original hash function is re-applied until an empty slot is found
- C: The record is moved to a different bucket
- D: The search key is discarded
View Answer
A
Q602: Which collision handling technique involves using an overflow area for new elements?
- A: Chaining
- B: Overflow areas
- C: Re-hashing
- D: Linear probing
View Answer
B
Q603: In open addressing, what happens when a collision occurs?
- A: The entry is inserted at an alternative location in the array
- B: The record is stored in a linked list
- C: The search key is ignored
- D: A new hash table is created
View Answer
A
Q604: Fill in the blank: In hashing, the address of a data item is computed using a _______ on the search key value.
- A: hash function
- B: linear function
- C: lookup table
- D: direct mapping
View Answer
A
Q605: Fill in the blank: In hashing, if multiple keys map to the same bucket address, a _______ is needed to handle the collision.
- A: chaining function
- B: secondary index
- C: hash function
- D: handling technique
View Answer
A
Q606: What is an index in a database similar to in a book?
- A: A table of contents
- B: A list of page numbers
- C: A list of words and their page numbers
- D: A list of authors
View Answer
A
Q607: What is the main purpose of an index in a database?
- A: To sort records sequentially
- B: To find data quickly without scanning the entire table
- C: To create new records
- D: To delete old records
View Answer
B
Q608: Which type of index allows efficient search on any leading subset of the search key?
- A: Hash index
- B: Primary index
- C: B-tree index
- D: Secondary index
View Answer
C
Q609: What is a B-tree used for in databases?
- A: Storing data in a sequential order
- B: Sorting data by primary key
- C: Implementing indexes with efficient search capabilities
- D: Managing non-key attributes
View Answer
C
Q610: What happens if two indexes have the same key value in a database?
- A: A collision occurs, and both indexes will point to the same data
- B: A new index is created for the second key value
- C: The first index is overwritten by the second index
- D: The search key is discarded
View Answer
A