Figure from the original question paper

(A) Schedule S can not be two-phase lockable.

(C) Schedule S can be strict two-phase lockable.

(B) Schedule S can be two-phase lockable.

(D) Schedule S is conflict serializable.

Consider the following log records of transactions where an immediate database modification scheme is used. | 1 | \langle T0, start \rangle | |---|---| | 2 | \langle T0, A, 200, 300 \rangle | | 3 | \langle T1, start \rangle | | 4 | \langle T1, B, 1300, 1000 \rangle | | 5 | \langle T2, start \rangle | | 6 | \langle T2, C, 500, 300 \rangle | | 7 | \langle T1, commit \rangle | | 8 | \langle T3, start \rangle | | 9 | \langle T0, commit \rangle | | 10 | \langle T3, D, 400, 500 \rangle | | 11 | \langle CheckpointL1 \rangle | | 12 | \langle T3, commit \rangle | | 13 | \langle T2, commit \rangle | | 14 | \langle T4, start \rangle | | 15 | \langle T4, E, 2000, 1500 \rangle | Suppose failure occurred after the step 15, then which of the following option(s) is/ are the correct?

(B) T0,T1, T2 and T3 can be ignored.

(D) T0 and T3 need to be redone.

Figure from the original question paper

(A) Option figure from the original question paper

(B) Option figure from the original question paper

(C) Option figure from the original question paper

(D) Option figure from the original question paper

E-R diagram with Customer, Loan and Branch entities and Borrower and Loan_Branch relationships (Figure 1: E-R diagram)

(A) Option figure from the original question paper

(B) Option figure from the original question paper

(D) Option figure from the original question paper

(C) Option figure from the original question paper

Figure from the original question paper

(A) Option figure from the original question paper

(D) Option figure from the original question paper

(B) Option figure from the original question paper

(C) Option figure from the original question paper

Consider a block nested-loop join for the two relation students and takes: | Relation | students | takes | |---|---|---| | Number of tuples(n) | 3000 | 2500 | | Number of blocks(b) | 500 | 600 | Assuming the worst-case memory availability and considering takes as the outer relation, which of the following options is/are correct?

(A) Number of block transfers require=300600

(C) Number of seeks require=1200

(B) Number of block transfers require=300500

(D) Number of seeks require=1400

May 2025 term · Database Management Systems · BSCS2001

Database Management Systems End Term: 31 August 2025 (May 2025 term)

The IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 31 Aug 2025, in the May 2025 term: 20 questions for 50 marks in 180 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.

Questions: 20
Marks: 50
Duration: 180 min
MCQ: 5
MSQ: 9
Numerical: 6

Take as mock test Practise with answers

Updated 25 Sept 2026

Official paper: IIT M DIPLOMA FN EXAM QDD1 31 Aug 2025 · No negative marking.

Question 1

+2 marksOne correct option

Consider the following relational schema:

mentor(mentorID, mentorName, department)
mentee(menteeID, menteeName, advisorID, rating)

advisorID is a foreign key referring to mentorID of the mentor relation. Assume that each mentor advises at least one mentee. Every mentee is required to give a rating to their mentor for feedback purposes. What does the following query return?

sql

1SELECT mentorName
2FROM mentor MR
3WHERE NOT EXISTS (SELECT menteeID
4FROM mentee ME
5WHERE ME.advisorID = MR.mentorID
6AND ME.rating <>'BAD');

A
Names of all the mentors with ‘GOOD’ rating from at least one of their mentees.
B
Names of all the mentors with ’GOOD’ rating from all their mentees.
C
Names of all the mentors with ‘BAD’ rating from at most one of their mentees.
D
Names of all the mentors with ’BAD’ rating from all their mentees.

Show answer

Correct answer

D
Names of all the mentors with ’BAD’ rating from all their mentees.

Question 1 on its own page

Question 2

+2 marksOne correct option

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?

A
max. number of keys = 16, min. number of keys = 1.
B
max. number of keys = 17, min. number of keys = 1.
C
max. number of keys = 16, min. number of keys = 8.
D
max. number of keys = 17, min. number of keys = 8.

Show answer

Correct answer

A
max. number of keys = 16, min. number of keys = 1.

Question 2 on its own page

Question 3

+3 marksOne correct option

Given the following schema:

students(studentID, firstName, lastName, admissionDate, deptID)
departments(deptID, deptName, profID, buildingID)

You want to display the first names and admission dates of all first admissions in their respective departments in the building having ID=1001. Which of the following queries will display the correct result?

Show answer

Correct answer

Question 3 on its own page

Question 4

+3 marksOne correct option

Show answer

Correct answer

Question 4 on its own page

Question 5

+3 marksOne correct option

Consider the table Bands given below:

ID	Name	Genre	YearEstablished
001	Pink Floyd	Progressive Rock	1964
002	Guns N' Roses	Hard Rock	1985
003	Black Sabbath	Heavy Metal	1968
004	Dream Theater	Progressive Rock	1985
005	Iron Maiden	Heavy Metal	1975
006	Opeth	Progressive Metal	1990
007	Led Zeppelin	Hard Rock	1968
008	Pantera	Groove Metal	1981
009	Aerosmith	Blues Rock	1970
010	Slipknot	Groove Metal	1995

Let hash function h(x) generate 16-bit binary hash values for the distinct elements in Genre attribute:

Progressive Rock- 1100 0010 1110 0101
Hard Rock- 1000 1010 0101 1110
Heavy Metal- 0111 1100 0011 0110
Progressive Metal- 1110 0101 0000 1101
Groove Metal- 0100 1010 1111 1011
Blues Rock- 0011 1111 1010 0101

If we insert the records in the following order:
Pink Floyd, Black Sabbath, Dream Theater, Aerosmith, Pantera, Opeth, Guns N' Roses, Iron Maiden, Slipknot, Led Zeppelin.

Considering bucket size as 2, using dynamic hashing technique, which one of the following denotes the correct distribution of records in hash buckets?

Show answer

Correct answer

Question 5 on its own page

Question 6

+3 marksOne or more correct options

Select all that apply.

A
Schedule S can not be two-phase lockable.
B
Schedule S can be two-phase lockable.
C
Schedule S can be strict two-phase lockable.
D
Schedule S is conflict serializable.

Show answer

Correct answers

A
Schedule S can not be two-phase lockable.
C
Schedule S can be strict two-phase lockable.

Question 6 on its own page

Question 7

+3 marksOne or more correct options

Consider the following log records of transactions where an immediate database modification scheme is used.

1	$\langle T0, start \rangle$
2	$\langle T0, A, 200, 300 \rangle$
3	$\langle T1, start \rangle$
4	$\langle T1, B, 1300, 1000 \rangle$
5	$\langle T2, start \rangle$
6	$\langle T2, C, 500, 300 \rangle$
7	$\langle T1, commit \rangle$
8	$\langle T3, start \rangle$
9	$\langle T0, commit \rangle$
10	$\langle T3, D, 400, 500 \rangle$
11	$\langle CheckpointL1 \rangle$
12	$\langle T3, commit \rangle$
13	$\langle T2, commit \rangle$
14	$\langle T4, start \rangle$
15	$\langle T4, E, 2000, 1500 \rangle$

Suppose failure occurred after the step 15, then which of the following option(s) is/ are the correct?

Select all that apply.

A
T0 and T1 can be ignored.
B
T0,T1, T2 and T3 can be ignored.
C
T4 need to be undone.
D
T0 and T3 need to be redone.

Show answer

Correct answers

A
T0 and T1 can be ignored.
C
T4 need to be undone.

Question 7 on its own page

Question 8

+3 marksOne or more correct options

Select all that apply.

A
(0,1,2,7,8)
B
(0,5,2,3,4)
C
(0,5,6,3,8)
D
(0,5,2,7,4)

Show answer

Correct answers

B
(0,5,2,3,4)
C
(0,5,6,3,8)
D
(0,5,2,7,4)

Question 8 on its own page

Question 9

+3 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 9 on its own page

Question 10

+2 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 10 on its own page

Question 11

+2 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 11 on its own page

Question 12

+2 marksOne or more correct options

Consider the table Student as shown in figure 2.

roll_no	sname	department
1	Stevie	Mechanical
2	Rohn	Civil Engg
3	Tania	Physics
4	Henry	Zoology
5	Steward	Mathematics

Figure 2: Table Student

Which among the following SQL statements will result in the output shown below?

roll_no	sname	department
1	Stevie	Mechanical
3	Tania	Physics
4	Henry	Zoology
5	Steward	Mathematics

Figure 3: Table Result

Select all that apply.

Show answer

Correct answers

Question 12 on its own page

Question 13

+2 marksOne or more correct options

Consider a block nested-loop join for the two relation students and takes:

Relation	students	takes
Number of tuples(n)	3000	2500
Number of blocks(b)	500	600

Assuming the worst-case memory availability and considering takes as the outer relation, which of the following options is/are correct?

Select all that apply.

A
Number of block transfers require=300600
B
Number of block transfers require=300500
C
Number of seeks require=1200
D
Number of seeks require=1400

Show answer

Correct answers

A
Number of block transfers require=300600
C
Number of seeks require=1200

Question 13 on its own page

Question 14

+2 marksOne or more correct options

Consider the instance of a relation R given in Table 1.
Which among the following functional dependencies set can be inferred from the given information?

A	B	C	D
a1	b1	c2	d4
a2	b1	c6	d3
a1	b2	c2	d4
a3	b4	c7	d3
a3	b1	c7	d3
a4	b2	c6	d3
a1	b7	c2	d4
a3	b4	c7	d3

Table 1: Relation R

Select all that apply.

Show answer

Correct answer

Question 14 on its own page

Question 15

+2 marksNumerical answer

Consider the following tables:

PlayerID	PlayerName
1	Messi
2	Muller
3	Ronaldo
4	Messi
5	Ozil
6	Ronaldo

Players Table

PlayerID	LeagueName	Goals
1	La Liga	7
2	Premier League	5
3	La Liga	2
1	Champions League	8
2	Bundesliga	6
1	Copa del Rey	5
4	La Liga	4
4	Champions League	3
3	Champions League	1
6	La Liga	3
3	Copa del Rey	4
6	Champions League	2

Stats Table

Consider the following SQL query.

sql

1SELECT P.PlayerName, Sum(S.Goals)
2FROM Players Table P, Stats Table S
3WHERE P.PlayerID= S.PlayerID
4GROUP BY P.PlayerName

The numbers of rows that will be returned by the SQL query is:

Show answer

Correct answer: 3

Question 15 on its own page

Question 16

+2 marksNumerical answer

Show answer

Correct answer: 5

Question 16 on its own page

Question 17

+2 marksNumerical answer

Show answer

Correct answer: 4

Question 17 on its own page

Question 18

+3 marksNumerical answer

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)?

Show answer

Correct answer: 32

Question 18 on its own page

Question 19

+3 marksNumerical answer

Show answer

Correct answer: 6

Question 19 on its own page

Question 20

+3 marksNumerical answer

Show answer

Correct answer: 8

Question 20 on its own page

A	B	C	D
a1	b1	c2	d4
a2	b1	c6	d3
a1	b2	c2	d4
a3	b4	c7	d3
a3	b1	c7	d3
a4	b2	c6	d3
a1	b7	c2	d4
a3	b4	c7	d3

A	B	C	D
a1	b1	c2	d4
a2	b1	c6	d3
a1	b2	c2	d4
a3	b4	c7	d3
a3	b1	c7	d3
a4	b2	c6	d3
a1	b7	c2	d4
a3	b4	c7	d3

A	B	C	D
a1	b1	c2	d4
a2	b1	c6	d3
a1	b2	c2	d4
a3	b4	c7	d3
a3	b1	c7	d3
a4	b2	c6	d3
a1	b7	c2	d4
a3	b4	c7	d3