Indian Institute of Technology Madras
BS Degree Programme · Examination & Study Paper
Database Management Systems
End Term · 22 Dec 2024 (Afternoon)
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.
- Q1MCQ3 Marks·Choose one option

- AA precedence graph of the schedule is cyclic
- BThe given schedule is not view serializable
- CThe given schedule is view serializable but not conflict serializable
- DThe given schedule is view serializable and conflict serializable
- Q2MCQ3 Marks·Choose one option

- AStatements 1 and 4 are correct.
- BStatements 1 and 3 are correct.
- CStatements 2 and 3 are correct.
- DStatements 2 and 4 are correct.
- Q3MCQ3 Marks·Choose one option

- A5
- B4
- C6
- D3
- Q4MCQ3 Marks·Choose one option

- A

- B

- C

- D

- A
- Q5MCQ3 Marks·Choose one option

- AThe decomposition of R into R1 and R2 is dependency preserving.
- BThe decomposition of R into R1 and R2 is lossless.
- CThe schema R1 is in 3NF.
- DThe schema R2 is in 2NF.
- Q6MCQ2 Marks·Choose one option

- Ateam
- Brating
- Cage
- Dtype
- Q7MCQ2 Marks·Choose one option

- A

- B

- C

- D

- A
- Q8MCQ2 Marks·Choose one option
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)?
- A75 KB/ms
- B25 KB/ms
- C50 KB/ms
- D100 KB/ms
- Q9MCQ2 Marks·Choose one option
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?
- Amax. number of keys = 15, min. number of keys = 8.
- Bmax. number of keys = 15, min. number of keys = 1.
- Cmax. number of keys = 16, min. number of keys = 1.
- Dmax. number of keys = 16, min. number of keys = 8.
- Q10MCQ2 Marks·Choose one option
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?
- 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
- 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
- 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
- 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
- Q11MCQ2 Marks·Choose one option

- A5
- B4
- C3
- D2
- Q12MCQ2 Marks·Choose one option

- AID and name of students who have not taken any course from Biology department
- BID and name of students who have taken courses from Biology department
- CID and name of students who have taken all the courses from Biology department
- DID and name of students who have not taken courses from other than Biology department
- Q13MCQ1 Mark·Choose one option
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.
- AStatements 1 and 2 are correct
- BStatements 1 and 3 are correct
- CAll the statements are correct
- DOnly Statement 1 is correct
- Q14MSQ3 Marks·Choose all correct options
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.- A

- B

- C

- D

- A
- Q15MSQ3 Marks·Choose all correct options
Consider a state of transactions as shown in Figure 3.
Which of the following statement(s) is/are correct according to the given figure?- AT1 can be ignored and T3 needs to be redone.
- BT4 and T5 need to be undone.
- CT1 needs to be redone and T4 can be undone.
- DT2 needs to be undone and T4 needs to be redone.
- Q16MSQ3 Marks·Choose all correct options

- A

- B

- C

- D

- A
- Q17MSQ3 Marks·Choose all correct options

- A

- B

- C

- D

- A
- Q18MSQ3 Marks·Choose all correct options

- A

- B

- C

- D

- A
- Q19MSQ2 Marks·Choose all correct options
Which of the following functional dependencies hold in the Students table?- A

- B

- C

- D

- A
- Q20NAT3 Marks·Write the number
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: