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

DBMS · Quiz 2 · 3 Aug 2025 (Afternoon)

14 questions · 50 marks · 60 min

Answer key Take as mock

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Database Management Systems

Quiz 2 · 3 Aug 2025 (Afternoon)

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.

Q1MCQ3 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
Q2MCQ4 Marks·Choose one option
Key ↓
1. A
2. B
3. C
4. D
Q3MCQ4 Marks·Choose one option
Key ↓
1. A1NF
2. B2NF
3. C3NF
4. DBCNF
Q4MCQ4 Marks·Choose one option
Key ↓
1. A1
2. B4
3. C6
4. D5
Q5MCQ4 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.
Q6MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A8
2. B9
3. C10
4. D11
Q7MCQ4 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
Q8MSQ4 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q9MSQ4 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
Q10MSQ2 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q11MSQ2 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.
Q12MSQ3 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.
Q13NAT4 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:
Q14NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:

Official Key

Master Answer Key & Explanations

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

Reveal Key

Q1C

Q2A

Q3B

Q4D

Q5D

Q6C

Q7B

Q8B, D

Q9B, D

Q10B, D

Q11A, D

Q12A, C

Q1326

Q1412

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