The IIT Madras BS Database Management Systems (DBMS) Quiz 2 paper sat on 12 Apr 2026, in the January 2026 term, set 1: 16 questions for 18 marks in 120 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.
Consider the following Entity Relationship Diagram:
Choose the correct statement(s):
A project may exist on which no employee is currently working.
There may exist a department which currently has no ongoing projects
An employee might be working in more than one departments
Every dependent depends on exactly one employee
Correct answers
A project may exist on which no employee is currently working.
There may exist a department which currently has no ongoing projects
Every dependent depends on exactly one employee
Suppose we are trying to find a number 52 in a binary search tree. Which of the following probe sequences are possible while performing the search? Note: Each option shows a probe sequence for searching 52 in different binary search trees
85, 62, -18, 55, -8, 51, 52
78, -22, 68, -10, 58, 55, 52
-25, 82, 45,-10, 70, 55, 52
28, 75,-15, 62,-8, 68, 52
Correct answers
85, 62, -18, 55, -8, 51, 52
78, -22, 68, -10, 58, 55, 52
Consider the relation M(P,Q,R,S,T ) with the following functional dependencies: S → PQ PQR → ST The number of super keys of M is:
A written answer, not marked automatically.
Consider the following schema:
A written answer, not marked automatically.
Consider the relational schema R(A, B, C, D, E, F, G, H), with the following functional dependencies: D → EF GB → C G → ABH CDE → F Select the functional dependency that can be removed from the given set without altering any candidate key of this relation.
G → ABH
CDE → F
D → EF
GB → C
Correct answer
CDE → F
Consider a relation G(P,Q,R,S,T), with the following functional dependencies: T → P QR → T P → Q What is the highest normal form of G? Note: All intermediate steps/decomposition in the process of normalization must be loss-less.
1NF
2NF
3NF
BCNF
Correct answer
3NF
Consider a relation R(A,B,C,D,E,F,G,H) with the following functional dependencies: A→BC B →CFH E →A F →EG CH →G Normalize R, such that all the resulting relations are at their highest possible normal forms, now answer the question given below. Note: All intermediate steps/decomposition in the process of normalization must be loss-less. Select the correct option among the following:
The minimum number of relations in which R can be decomposed, so that all of the resulting relations are in BCNF is 4.
There is no possible way to decompose R into smaller relations such that all of them are in BCNF.
The dependency F → G is lost in the normalization process.
No dependency is lost in the normalization process.
Correct answer
No dependency is lost in the normalization process.
Consider a hard-disk with the following specifications: Average Seek Time = 12ms Average Rotational delay = 3.5 ms One disk block unit is 4 KB Data Rate = 256 KB/sec What will be the total disk access time for a single block unit?
27.625 ms
19.225 ms
15.5 ms
31.125 ms
Correct answer
31.125 ms
Consider a relation shoe(model, price) which contains the models and prices of different shoes. If it is given that price of every shoe is different then what does the following SQL query list?
model of the fourth most costly shoe.
models of four most costly shoes.
model of the fourth least costly shoe.
models of four least costly shoes.
Correct answer
models of four most costly shoes.
Which among the following methods of psycopg2 is/are used to execute SQL statements?
cursor.execute()
cursor.executemany()
cursor.fetchall()
cursor.fetchmany()
Correct answers
cursor.execute()
cursor.executemany()
Consider a relation R(A,B,C,D) which has no non-trivial functional dependencies. Select all the option(s) which can serve as candidate key(s) of the relation R.
{ABC, BCD, CDA, DAB}
{A, B, C, D}
{ABCD}
None of these
Correct answer
{ABCD}
Consider a relation R(A,B,C,D,E) with the following functional dependency set: FD = {D → B, E → A, CD → E } If this relation is decomposed into R1(B,C,D,E) and R2(E,A), then which of the following statement(s) is/are true? Note: All intermediate steps/decomposition in the process of normalization must be loss less.
The decomposition is lossy but dependency preserving.
The decomposition is lossless and dependency preserving.
R1 is in 2NF and R2 is in 3NF.
Both R1 and R2 are in 2NF.
Correct answer
The decomposition is lossless and dependency preserving.
Given a relation T(P,Q,R) with the following set of functional dependencies: P → QR Q → PR R → PQ Answer the given sub-questions:
How many functional dependencies are there in the canonical/minimal cover of the given relation?
A written answer, not marked automatically.
Given a relation T(P,Q,R) with the following set of functional dependencies: P → QR Q → PR R → PQ Answer the given sub-questions:
How many canonical/minimal cover(s) is/are possible for the given relation?
A written answer, not marked automatically.
Suppose LRU block replacement policy is used for managing the buffer in main memory. If the buffer has 3 block frames, then for the given block request sequence what is the total number of page faults? 1, 3, 2, 4, 2, 3, 1, 2, 4, 3, 1, 4 Note: Assume that the buffer was initially empty
A written answer, not marked automatically.
Given a relation T(P,Q,R) with the following set of functional dependencies: P → QR Q → PR R → PQ Answer the given sub-questions:
A written answer, not marked automatically.
