BTechibtechi.in
Loading Loading
Free IIT Madras BS notes, PYQs and mock tests at btechi.in

DBMS · All 2025 papers

88 questions · 250 marks · 5 papers

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Database Management Systems

All 2025 papers

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.
NAT: Numerical response. No negative marking.
Scientific calculator allowed for all calculations.
Official answer key is sealed at the end of this sheet.

Quiz 1 · 26 Oct 2025 (AN)Quiz 1

Q1MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q2MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q3MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q4MCQ4 Marks·Choose one option
Key ↓
1. A4 rows and 6 columns
2. B3 rows and 7 columns
3. C4 rows and 5 columns
4. D3 rows and 6 columns
Q5MCQ3 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q6MCQ3 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q7MSQ4 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q8MSQ3 Marks·Choose all correct options
Asked 5 times Key ↓
1. AThere might exist an item that has not been produced by any company
2. BThere might exist a customer who has not ordered any item
3. CAn item can be ordered by multiple customers
4. DAn item cannot be produced by more than one company
Q9MSQ2 Marks·Choose all correct options
Key ↓
Identify the correct statement(s):
1. ALogical level of schema is analogous to type information of a variable in a program
2. BIn physical level of schema,application programs hide details of data types
3. CThe ability to modify the physical schema without changing the logical schema is called Logical Data Independence
4. DRelational Algebra falls under the Pure class of languages used for proving properties about computational power and for optimization
Q10NAT4 Marks·Write the number
Key ↓
Your answer:
Q11NAT4 Marks·Write the number
Key ↓
Your answer:
Read the passage below, then answer Q12–Q14
Q12MCQ3 Marks·Choose one option
Key ↓
1. A50
2. B10
3. C60
4. D59
Q13MSQ4 Marks·Choose all correct options
Key ↓
1. Aa → b → c
2. Bb → a → c
3. Cb → c → a
4. Dc → b → a
Q14MSQ4 Marks·Choose all correct options
Key ↓
Which of the following SQL queries is/are used to create table Teams?
1. A
2. B
3. C
4. D

End Term · 31 Aug 2025 (FN)End Term

Q15MCQ2 Marks·Choose one option
Key ↓
1. ANames of all the mentors with ‘GOOD’ rating from at least one of their mentees.
2. BNames of all the mentors with ’GOOD’ rating from all their mentees.
3. CNames of all the mentors with ‘BAD’ rating from at most one of their mentees.
4. DNames of all the mentors with ’BAD’ rating from all their mentees.
Q16MCQ2 Marks·Choose one option
Asked 3 times Key ↓
Consider a non-empty B+-tree of order 17. What are the maximum and minimum number of keys that can be placed in the root node?
1. Amax. number of keys = 16, min. number of keys = 1.
2. Bmax. number of keys = 17, min. number of keys = 1.
3. Cmax. number of keys = 16, min. number of keys = 8.
4. Dmax. number of keys = 17, min. number of keys = 8.
Q17MCQ3 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q18MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A2
2. B0
3. C1
4. D5
Q19MCQ3 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q20MSQ3 Marks·Choose all correct options
Asked 3 times Key ↓
1. ASchedule S can not be two-phase lockable.
2. BSchedule S can be two-phase lockable.
3. CSchedule S can be strict two-phase lockable.
4. DSchedule S is conflict serializable.
Q21MSQ3 Marks·Choose all correct options
Asked 3 times Key ↓
1. AT0 and T1 can be ignored.
2. BT0,T1, T2 and T3 can be ignored.
3. CT4 need to be undone.
4. DT0 and T3 need to be redone.
Q22MSQ3 Marks·Choose all correct options
Asked 2 times Key ↓
1. A(0,1,2,7,8)
2. B(0,5,2,3,4)
3. C(0,5,6,3,8)
4. D(0,5,2,7,4)
Q23MSQ3 Marks·Choose all correct options
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q24MSQ2 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q25MSQ2 Marks·Choose all correct options
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q26MSQ2 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q27MSQ2 Marks·Choose all correct options
Key ↓
1. ANumber of block transfers require=300600
2. BNumber of block transfers require=300500
3. CNumber of seeks require=1200
4. DNumber of seeks require=1400
Q28MSQ2 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q29NAT2 Marks·Write the number
Key ↓
Your answer:
Q30NAT2 Marks·Write the number
Key ↓
Your answer:
Q31NAT2 Marks·Write the number
Asked 5 times Key ↓
Your answer:
Q32NAT3 Marks·Write the number
Key ↓
Consider a magnetic disk with 16 platters, 2 surfaces per platter, 1024 tracks per surface, 2048 sectors per track and 512 bytes per sector. The disk rotates at 6000 rpm. What is the disk capacity (in GB)?
Your answer:
Q33NAT3 Marks·Write the number
Key ↓
Your answer:
Q34NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:

Quiz 2 · 3 Aug 2025 (AN)Quiz 2

Q35MCQ3 Marks·Choose one option
Asked 4 times Key ↓
1. AThe decomposition is lossless and dependency preserving
2. BThe decomposition is lossy and dependency preserving
3. CThe decomposition is lossless but not dependency preserving
4. DThe decomposition is lossy and not dependency preserving
Q36MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q37MCQ4 Marks·Choose one option
Key ↓
1. A1NF
2. B2NF
3. C3NF
4. DBCNF
Q38MCQ4 Marks·Choose one option
Key ↓
1. A1
2. B4
3. C6
4. D5
Q39MCQ4 Marks·Choose one option
Key ↓
1. AStatement 1 is correct and Statement 2 is wrong
2. BBoth the statements are wrong.
3. CStatement 1 is wrong and Statement 2 is correct.
4. DBoth the statements are correct.
Q40MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A8
2. B9
3. C10
4. D11
Q41MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. AF = Novel, G = BookWorld, H = ReadersHub, I = Delhi, J = Mumbai
2. BF = Magazine, G = BookWorld, H = ReadersHub, I = Delhi, J = Mumbai
3. CF = Magazine, G = ReadersHub, H = BookWorld, I = Delhi, J = Mumbai
4. DF = Novel, G = ReadersHub, H = BookWorld, I = Mumbai, J = Delhi
Q42MSQ4 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q43MSQ4 Marks·Choose all correct options
Asked 2 times Key ↓
Construct a binary search tree by inserting the values in the following order 15,14, 30, 5, 13, 19, 26, 12, 1, 6. Which of the following statement(s) is/are correct? Note: Consider the root node at level 0.
1. AThe height of binary search tree is 6.
2. BThe sum of the leaf nodes of the binary search tree is 33
3. CThe nodes 12,1 and 6 are part of the left subtree of node 13.
4. DNode 19 is at level 2
Q44MSQ2 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q45MSQ2 Marks·Choose all correct options
Key ↓
Identify the correct statement(s):
1. ABinary search has a time complexity of O(log n). where n is number of elements.
2. BIn a linked list the data elements are required to be stored in contiguous memory locations
3. CMain memory is the fastest and most costly form of storage
4. DA sector is the smallest unit of data read or written on a Magnetic Disk for every read operation.
Q46MSQ3 Marks·Choose all correct options
Key ↓
1. AQuery 1 will execute more efficiently when multitable clustering file organization scheme is used.
2. BBoth the queries will execute more efficiently when sequential clustering file organization scheme is used.
3. CQuery 2 will execute more efficiently when sequential clustering file organization scheme is used.
4. DQuery 1 will execute more efficiently when sequential clustering file organization scheme is used.
Q47NAT4 Marks·Write the number
Key ↓
Consider a binary search tree consisting of 31 elements. Let m be the maximum height possible for a given binary search tree, and n be the minimum height possible for a given binary search tree. What will be the value of m − n?
Your answer:
Q48NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:

End Term · 13 Apr 2025 (FN)End Term

Q49MCQ2 Marks·Choose one option
Asked 2 times Key ↓
1. A19
2. B20
3. C21
4. D22
Q50MCQ2 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q51MCQ2 Marks·Choose one option
Asked 5 times Key ↓
1. A4
2. B5
3. C6
4. D7
Q52MCQ2 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q53MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q54MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A1-a, 2-c, 3-f
2. B1-b, 2-c, 3-e
3. C1-a, 2-d, 3-e
4. D1-b, 2-d, 3-f
Q55MSQ1 Mark·Choose all correct options
Asked 2 times Key ↓
Choose the correct statement(s).
1. AIn static hashing, the size of the hash table remains fixed, which may lead to overflow or underutilization of space.
2. BIn dynamic hashing, the hash table grows and shrinks dynamically as data is inserted or deleted.
3. CStatic hashing is more efficient for applications where the number of records is expected to change frequently.
4. DDynamic hashing does not handle collisions effectively compared to static hashing.
Q56MSQ2 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q57MSQ2 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q58MSQ2 Marks·Choose all correct options
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q59MSQ2 Marks·Choose all correct options
Asked 5 times Key ↓
Consider the following Entity Relationship Diagram: Choose the correct statements.
1. AA bank can provide more than one ATM machine
2. BAn ATM card is used by only one customer
3. CA customer can use only one ATM card
4. DAn ATM card can be inserted in many ATM machines
Q60MSQ3 Marks·Choose all correct options
Asked 3 times Key ↓
1. ASchedule S is conflict serializable.
2. BSchedule S can be two-phase lockable.
3. CTwo phase lockable schedule are always serializable schedule.
4. DSchedule S is not View Serializable
Q61NAT3 Marks·Write the number
Asked 2 times Key ↓
Consider you have a file in your hard disk of size 1000 KB. Seek time of your hard disk read head is 3ms and rotational speed in 30,000 rpm. The disk has 200 sectors per track and 512 bytes per sector. Considering the fact that the file data is stored in non consecutive sectors. How much time will be required to read the whole file after a read request is made? (in ms)
Your answer:
Q62NAT3 Marks·Write the number
Asked 3 times Key ↓
Consider a system using the Least Recently Used (LRU) page replacement policy. The system has a main memory buffer with 4 slots, and the page reference sequence is as follows: 3, 4, 1, 4, 2, 3, 1, 4, 2, 3 Calculate the total number of page misses (page faults) during this sequence.
Your answer:
Q63NAT3 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q64NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q65NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q66NAT3 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Read the passage below, then answer Q67–Q68
Q67NAT3 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q68MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D

End Term · 13 Apr 2025 (AN)End Term

Q69MCQ2 Marks·Choose one option
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q70MCQ2 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q71MCQ2 Marks·Choose one option
Asked 5 times Key ↓
1. A4
2. B5
3. C6
4. D3
Q72MCQ3 Marks·Choose one option
Asked 3 times Key ↓
Consider the following schedule S. S:W1(A), W3(A), W3(C), R2(A), W2(A), W1(B), W3(B) Consider the following statements. Statement 1: The given schedule S is Conflict serializable. Statement 2: All Conflict serializable schedules are 2-P lockable. Statement 3: The given schedule is 2-P lockable. Which of the following options is correct?
1. AStatement 1 is true and statement 3 is false
2. BStatement 2 is true and statement 3 is false
3. CStatements 1 and 2 are true
4. DAll these statements are true.
Q73MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A19
2. B20
3. C21
4. D22
Q74MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A1-a, 2-d, 3-f
2. B1-b, 2-d, 3-e
3. C1-a, 2-c, 3-e
4. D1-b, 2-c, 3-f
Q75MCQ1 Mark·Choose one option
Key ↓
Consider the following statements and select the correct option. 1. RAID 1 employs mirroring, maintaining two identical copies of the data on two different disks 2. RAID 3 has a single check disk with parity information.
1. ABoth the statements are correct.
2. BBoth the statements are wrong.
3. CStatement 1 is correct and statement 2 is wrong.
4. DStatement 1 is wrong and statement 2 is correct.
Q76MSQ1 Mark·Choose all correct options
Asked 2 times Key ↓
Choose the correct statement(s).
1. AIn static hashing, overflow is commonly handled using overflow buckets or chaining.
2. BDynamic hashing is suitable for applications where the number of records is unpredictable.
3. CStatic hashing is ideal when the dataset size is expected to grow significantly.
4. DDynamic hashing ensures that hash table utilization remains balanced as data changes.
Q77MSQ3 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q78MSQ2 Marks·Choose all correct options
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q79MSQ2 Marks·Choose all correct options
Asked 5 times Key ↓
Consider the following Entity Relationship Diagram: Choose the correct statements.
1. AA bank can provide exactly one ATM machine
2. BAn ATM card can be used by multiple customers
3. CA customer can use multiple ATM cards
4. DAn ATM card can be inserted in many ATM machines
Q80MSQ2 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q81NAT3 Marks·Write the number
Asked 2 times Key ↓
Consider you have a file in your hard disk of size 1024 KB. The seek time of your hard disk read head is 4 ms, and the rotational speed is 30,000 rpm. The disk has 256 sectors per track, and each sector stores 512 bytes. Considering that the file data is stored in non-consecutive sectors, how much time will be required to read the whole file after a read request is made (in ms)?
Your answer:
Q82NAT3 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Q83NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q84NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q85NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:
Q86NAT3 Marks·Write the number
Asked 4 times Key ↓
Your answer:
Read the passage below, then answer Q87–Q88
Q87NAT3 Marks·Write the number
Asked 2 times Key ↓
Your answer:
Q88MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D

Official Key

Master Answer Key & Explanations

Official answer keys from IIT Madras BS past papers. Click any question to review.

Reveal Key

Q1D

Q2D

Q3A

Q4D

Q5C

Q6A

Q7A, C, D

Q8C, D

Q9A, D

Q104

Q112

Q12A

Q13C, D

Q14B

Q15D

Q16A

Q17A

Q18C

Q19C

Q20A, C

Q21A, C

Q22B, C, D

Q23A, B, C

Q24A, B, D

Q25A, D

Q26A, C, D

Q27A, C

Q28D

Q293

Q305

Q314

Q3232

Q336

Q348

Q35C

Q36A

Q37B

Q38D

Q39D

Q40C

Q41B

Q42B, D

Q43B, D

Q44B, D

Q45A, D

Q46A, C

Q4726

Q4812

Q49B

Q50C

Q51C

Q52A

Q53C

Q54D

Q55A, B

Q56D

Q57A, D

Q58A, B

Q59A, B, D

Q60A, B, C

Q6124

Q624

Q63500

Q6424

Q655

Q6641

Q674

Q68C

Q69D

Q70D

Q71D

Q72A

Q73B

Q74A

Q75A

Q76A, B, D

Q77C, D

Q78A, B

Q79C, D

Q80B, C

Q8121

Q8239

Q834

Q8424

Q854

Q862200

Q876

Q88B

Questions and answer keys are reproduced from the official IIT Madras BS papers. BTechi is not affiliated with IIT Madras.