Indian Institute of Technology Madras
BS Degree Programme · Examination & Study Paper
Database Management Systems
Hashing & bitmap indices
Official Paper
Examination Instructions & Guidelines
- Solve on notebook/paper first before checking solutions.
- MCQ: Exactly 1 option is correct. Negative marking applies.
- MSQ: One or more options correct. Select all to score.
- Scientific calculator allowed for all calculations.
- Official answer key is sealed at the end of this sheet.
End Term · 31 Aug 2025 (FN)End Term
- Q1MCQ3 Marks·Choose one option
- A
- B
- C
- D
- A
End Term · 13 Apr 2025 (FN)End Term
- Q2MCQ3 Marks·Choose one option
- A
- B
- C
- D
- A
- Q3MSQ1 Mark·Choose all correct options
Choose the correct statement(s).
- AIn static hashing, the size of the hash table remains fixed, which may lead to overflow or underutilization of space.
- BIn dynamic hashing, the hash table grows and shrinks dynamically as data is inserted or deleted.
- CStatic hashing is more efficient for applications where the number of records is expected to change frequently.
- DDynamic hashing does not handle collisions effectively compared to static hashing.
End Term · 13 Apr 2025 (AN)End Term
- Q4MSQ1 Mark·Choose all correct options
Choose the correct statement(s).
- AIn static hashing, overflow is commonly handled using overflow buckets or chaining.
- BDynamic hashing is suitable for applications where the number of records is unpredictable.
- CStatic hashing is ideal when the dataset size is expected to grow significantly.
- DDynamic hashing ensures that hash table utilization remains balanced as data changes.
- Q5MSQ3 Marks·Choose all correct options
- A
- B
- C
- D
- A
End Term · 22 Dec 2024 (FN)End Term
- Q6MCQ2 Marks·Choose one option
- Ateam
- Brating
- Cage
- Dtype
End Term · 22 Dec 2024 (AN)End Term
- Q7MCQ2 Marks·Choose one option
- Ateam
- Brating
- Cage
- Dtype