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

DBMS · All 2024 papers

40 questions · 100 marks · 2 papers

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Database Management Systems

All 2024 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.

End Term · 22 Dec 2024 (FN)End Term

Q1MCQ2 Marks·Choose one option
Asked 2 times Key ↓
1. Ateam
2. Brating
3. Cage
4. Dtype
Q2MCQ2 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q3MCQ2 Marks·Choose one option
Asked 2 times Key ↓
Consider seek time of your hard disk read head is 2ms, rotational speed is 60,000 RPM. The disk has 300 sectors/track and sector size is 256 bytes. What will be the transfer rate (KB/ms)?
1. A75 KB/ms
2. B25 KB/ms
3. C50 KB/ms
4. D100 KB/ms
Q4MCQ2 Marks·Choose one option
Asked 3 times Key ↓
Consider a non-empty B+-tree of order 13. What are the maximum and minimum number of keys that can be placed in the root node?
1. Amax. number of keys = 13, min. number of keys = 6.
2. Bmax. number of keys = 12, min. number of keys = 1.
3. Cmax. number of keys = 14, min. number of keys = 1.
4. Dmax. number of keys = 14, min. number of keys = 7.
Q5MCQ2 Marks·Choose one option
Asked 2 times Key ↓
Consider a multilevel index with five levels as L1, L2, L3, L4 and L5. Let L1 be the innermost and L5 be the outermost levels. Let the index blocking factor or the maximum number of entries held by a block be 50. If the number of blocks in level L1 is 62,50,000, then how many blocks are required at L2, L3, L4 and L5?
1. ANumber of blocks at L2 is 125000, Number of blocks at L3 is 2500, Number of blocks at L4 is 50, Number of blocks at L5 is 1
2. BNumber of blocks at L2 is 125000, Number of blocks at L3 is 2000, Number of blocks at L4 is 50, Number of blocks at L5 is 1
3. CNumber of blocks at L2 is 120000, Number of blocks at L3 is 2400, Number of blocks at L4 is 40, Number of blocks at L5 is 1
4. DNumber of blocks at L2 is 120000, Number of blocks at L3 is 3000, Number of blocks at L4 is 60, Number of blocks at L5 is 1
Q6MCQ2 Marks·Choose one option
Asked 5 times Key ↓
1. A5
2. B4
3. C3
4. D6
Q7MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A5
2. B4
3. C6
4. D3
Q8MCQ3 Marks·Choose one option
Asked 4 times Key ↓
1. AA = 1000, B = 750, C = 1700, D = 710
2. BA = 1000, B = 750, C = 1700, D = 690
3. CA = 1000, B = 350, C = 1700, D = 710
4. DA = 1000, B = 350, C = 1700, D = 690
Q9MCQ1 Mark·Choose one option
Key ↓
Consider the following statements: 1. Hot backup refers to keeping a database up and running while the backup is being performed concurrently. 2. Cold backup is mainly used for Transaction Log Backup. 3. Transactional Logging is used in circumstances where a possibly inconsistent backup is taken. Choose the correct option.
1. AStatements 1 and 2 are correct
2. BStatements 1 and 3 are correct
3. CAll the statements are correct
4. DOnly Statement 1 is correct
Q10MSQ3 Marks·Choose all correct options
Asked 3 times Key ↓
1. AT2 can be ignored and T3 needs to be redone.
2. BT4 needs to be undone and T5 needs to be redone.
3. CT1 needs to be redone and T4 can be undone.
4. DT3 needs to be undone and T4 needs to be redone.
Q11MSQ3 Marks·Choose all correct options
Asked 2 times Key ↓
1. AA precedence graph of the schedule is acyclic
2. BThe given schedule is not view serializable
3. CThe given schedule is view serializable but not conflict serializable
4. DThe given schedule is view serializable and conflict serializable
Q12MSQ3 Marks·Choose all correct options
Asked 2 times Key ↓
1. AS1 and S2 are conflict equivalent.
2. BS1 and S2 are not conflict equivalent.
3. CS1 and S2 are view equivalent.
4. DS1 and S2 are not view equivalent.
Q13MSQ3 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q14MSQ3 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q15MSQ3 Marks·Choose all correct options
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q16MSQ3 Marks·Choose all correct options
Asked 4 times Key ↓
1. AThe decomposition of R into R1 and R2 is dependency preserving.
2. BThe decomposition of R into R1 and R2 is lossless.
3. CThe schema R1 is in 3NF.
4. DThe schema R2 is in 2NF.
Q17MSQ3 Marks·Choose all correct options
Asked 5 times Key ↓
1. AA bank offers more than one loan
2. BAn account is managed by more than one bank
3. CEvery loan must be availed by at least one customer
4. DEvery customer must be holding at least one account
Q18MSQ2 Marks·Choose all correct options
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q19MSQ2 Marks·Choose all correct options
Asked 5 times Key ↓
1. A
2. B
3. C
4. D
Q20NAT3 Marks·Write the number
Asked 4 times Key ↓
Consider a Block nested loop join for the two relations, instructor and department. Assuming the worst-case memory availability and instructor as the outer relation, the provided details are as follows: • Total number of block transfers: 25000 • Total number of seeks required: 500 • Number of block in the outer relation: 250 What is the number of blocks in the inner relation?
Your answer:

End Term · 22 Dec 2024 (AN)End Term

Q21MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. AA precedence graph of the schedule is cyclic
2. BThe given schedule is not view serializable
3. CThe given schedule is view serializable but not conflict serializable
4. DThe given schedule is view serializable and conflict serializable
Q22MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. AStatements 1 and 4 are correct.
2. BStatements 1 and 3 are correct.
3. CStatements 2 and 3 are correct.
4. DStatements 2 and 4 are correct.
Q23MCQ3 Marks·Choose one option
Asked 2 times Key ↓
1. A5
2. B4
3. C6
4. D3
Q24MCQ3 Marks·Choose one option
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q25MCQ3 Marks·Choose one option
Asked 4 times Key ↓
1. AThe decomposition of R into R1 and R2 is dependency preserving.
2. BThe decomposition of R into R1 and R2 is lossless.
3. CThe schema R1 is in 3NF.
4. DThe schema R2 is in 2NF.
Q26MCQ2 Marks·Choose one option
Asked 2 times Key ↓
1. Ateam
2. Brating
3. Cage
4. Dtype
Q27MCQ2 Marks·Choose one option
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q28MCQ2 Marks·Choose one option
Asked 2 times Key ↓
Consider seek time of your hard disk read head is 2ms, rotational speed is 30,000 RPM. The disk has 400 sectors/track and sector size is 128 bytes. What will be the transfer rate (KB/ms)?
1. A75 KB/ms
2. B25 KB/ms
3. C50 KB/ms
4. D100 KB/ms
Q29MCQ2 Marks·Choose one option
Asked 3 times Key ↓
Consider a non-empty B+-tree of order 16. What are the maximum and minimum number of keys that can be placed in the root node?
1. Amax. number of keys = 15, min. number of keys = 8.
2. Bmax. number of keys = 15, min. number of keys = 1.
3. Cmax. number of keys = 16, min. number of keys = 1.
4. Dmax. number of keys = 16, min. number of keys = 8.
Q30MCQ2 Marks·Choose one option
Asked 2 times Key ↓
Consider a multilevel index with five levels as L1, L2, L3, L4 and L5. Let L1 be the innermost and L5 be the outermost levels. Let the index blocking factor or the maximum number of entries held by a block be 25. If the number of blocks in level L1 is 12,50,000, then how many blocks are required at L2, L3, L4 and L5?
1. ANumber of blocks at L2 is 50000, Number of blocks at L3 is 2000, Number of blocks at L4 is 80, Number of blocks at L5 is 4
2. BNumber of blocks at L2 is 125000, Number of blocks at L3 is 2000, Number of blocks at L4 is 80, Number of blocks at L5 is 1
3. CNumber of blocks at L2 is 50000, Number of blocks at L3 is 2000, Number of blocks at L4 is 80, Number of blocks at L5 is 1
4. DNumber of blocks at L2 is 125000, Number of blocks at L3 is 2500, Number of blocks at L4 is 80, Number of blocks at L5 is 4
Q31MCQ2 Marks·Choose one option
Asked 5 times Key ↓
1. A5
2. B4
3. C3
4. D2
Q32MCQ2 Marks·Choose one option
Asked 2 times Key ↓
1. AID and name of students who have not taken any course from Biology department
2. BID and name of students who have taken courses from Biology department
3. CID and name of students who have taken all the courses from Biology department
4. DID and name of students who have not taken courses from other than Biology department
Q33MCQ1 Mark·Choose one option
Key ↓
Consider the following statements: 1. Any transactions committed before the last checkpoint should be ignored. 2. Any transaction that was running at the time of failure needs to be redone. 3. It scans backwards from the end of the log to find the most recent < checkpointL > record. Choose the correct option.
1. AStatements 1 and 2 are correct
2. BStatements 1 and 3 are correct
3. CAll the statements are correct
4. DOnly Statement 1 is correct
Q34MSQ3 Marks·Choose all correct options
Key ↓
Consider the ER Diagram as shown below: Identify the correct relational schema for the relationship set Bank, Account and Manages Note: The primary key is underlined.
1. A
2. B
3. C
4. D
Q35MSQ3 Marks·Choose all correct options
Asked 3 times Key ↓
Consider a state of transactions as shown in Figure 3. Which of the following statement(s) is/are correct according to the given figure?
1. AT1 can be ignored and T3 needs to be redone.
2. BT4 and T5 need to be undone.
3. CT1 needs to be redone and T4 can be undone.
4. DT2 needs to be undone and T4 needs to be redone.
Q36MSQ3 Marks·Choose all correct options
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q37MSQ3 Marks·Choose all correct options
Asked 2 times Key ↓
1. A
2. B
3. C
4. D
Q38MSQ3 Marks·Choose all correct options
Asked 4 times Key ↓
1. A
2. B
3. C
4. D
Q39MSQ2 Marks·Choose all correct options
Asked 5 times Key ↓
Which of the following functional dependencies hold in the Students table?
1. A
2. B
3. C
4. D
Q40NAT3 Marks·Write the number
Asked 4 times Key ↓
Consider a Block nested loop join for the two relations, instructor and department. Assuming the worst-case memory availability and instructor as the outer relation, the provided details are as follows: What is the number of blocks in the inner relations?
Your answer:

Official Key

Master Answer Key & Explanations

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

Reveal Key

Q1D

Q2A

Q3A

Q4B

Q5A

Q6C

Q7A

Q8A

Q9B

Q10A, C

Q11A, D

Q12A, C

Q13C, D

Q14A, B

Q15B, C

Q16A, C, D

Q17A, D

Q18B, D

Q19A, C, D

Q20100

Q21D

Q22C

Q23A

Q24A

Q25B

Q26B

Q27A

Q28B

Q29B

Q30A

Q31D

Q32A

Q33B

Q34A

Q35B, C

Q36A, C

Q37A, B

Q38C, D

Q39A, B

Q4059

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