Database Management System MCQs with Answers
Practice important Database Management System MCQs with answers and explanations.
Multiple Choice Questions
Q591: What happens when records are added to a fixed-size record file?
- A: The entire file must be reorganized
- B: The index is updated only
- C: The new record is added without any changes
- D: Only the transaction file is updated
View Answer
A
Q592: When defining an indexed sequential file, how many keys are recommended for efficiency?
- A: 0 to 255
- B: 1 to 10
- C: 1 to 8
- D: 5 to 10
View Answer
C
Q593: Fill in the blank: In indexed sequential file organization, a key search involves comparing the search key with the index keys to find the highest index key _______ the search key.
- A: preceding
- B: after
- C: matching
- D: during
View Answer
A
Q594: Fill in the blank: In direct access file organization, an index file helps to obtain the address of the block that contains the required _______.
- A: record
- B: identifier
- C: key
- D: field
View Answer
A
Q595: What is the purpose of a hash function in hashing techniques?
- A: To sort records in sequential order
- B: To compute the address of a data item
- C: To create a new data record
- D: To index records by their key value
View Answer
B
Q596: In hashing, what is a bucket?
- A: A storage unit for all records
- B: A function that computes addresses
- C: A key-value pair in a hash table
- D: A list of all search keys
View Answer
A
Q597: What happens when two search keys map to the same bucket address?
- A: A collision occurs and both records are placed in the same bucket
- B: A new bucket is created for the second record
- C: The first record is overwritten by the second record
- D: The search key is discarded
View Answer
A
Q598: Which technique involves adding records to a list attached to the slot where a collision occurs?
- A: Linear probing
- B: Overflow areas
- C: Chaining
- D: Re-hashing
View Answer
C
Q599: What is a perfect hashing function?
- A: A function that maps keys to a small number of addresses
- B: A function that maps each key to a unique integer
- C: A function that maps most keys to unique integers
- D: A function that uses multiple hash operations
View Answer
B
Q600: What is the major disadvantage of linear probing in hashing?
- A: It can lead to clustering of keys
- B: It increases the number of collisions
- C: It slows down the hashing process
- D: It requires additional memory
View Answer
A