Choose the correct output obtained on running the given SQL statements on Table Employee. | EID | EName | |---|---| | E01 | Arthur | | E02 | Raina | | E03 | Meena | | E04 | Arthur | | E06 | Joey | Table Employee SQL> SAVEPOINT SP1; SQL> UPDATE Employee SET EName=‘Jainie’ WHERE EID=‘E06’; SQL> SAVEPOINT SP2; SQL> DELETE FROM Employee WHERE EID=‘E02’; SQL> SAVEPOINT SP3; SQL> UPDATE Employee SET EName=‘Raina’ WHERE EID=‘E04’; SQL> ROLLBACK TO SP2;

(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

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

Figure from the original question paper

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

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

(D) Schedule S is conflict serializable.

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

Consider the following schedule S. | T1 | T2 | |---|---| | r(A) | | | | r(b) | | w(A) | | | | r(A) | | | w(A) | | | w(B) | | r(B) | | | w(B) | | Table 2: schedule: S Which of the following is true for schedule S?

(C) Schedule S is not Conflict Serializable

(D) Schedule S is not View Serializable

(A) Schedule S is Conflict serializable

(B) Schedule S is View serializable

Figure from the original question paper

(C) Option figure from the original question paper

(D) Option figure from the original question paper

(A) Option figure from the original question paper

(B) Option figure from the original question paper

Figure from the original question paper

(B) Option figure from the original question paper

(D) Option figure from the original question paper

(A) 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

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

ER diagram (Figure 1: Library) with entities Student, Book and Author, relationships Reads and Writes, attributes Student-ID, name, Email, Author-ID, name, country, ISBN, Title, Author-ID, Year, followed by the question text

(B) There might exist a student who has not read any book

(A) There might exist an author who has not written any books

(C) An author can write at most one book

(D) A student can read at most one book

May 2024 term · Database Management Systems · BSCS2001

DBMS End Term: 1 September 2024, Set QDF1 (May 2024 term)

The IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 1 Sept 2024, in the May 2024 term, set QDF1: 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: 8
MSQ: 9
Numerical: 3

Take as mock test Practise with answers

Updated 25 Sept 2026

Official paper: IIT M FOUNDATION DIPLOMA AN EXAM QDF3 01 Sep 2024 · No negative marking.

Question 1

+2 marksOne correct option

A
75000
B
250
C
300
D
50

Show answer

Correct answer

C
300

Question 1 on its own page

Question 2

+2 marksOne correct option

Choose the correct output obtained on running the given SQL statements on Table Employee.

EID	EName
E01	Arthur
E02	Raina
E03	Meena
E04	Arthur
E06	Joey

Table Employee

sql

1SQL> SAVEPOINT SP1;
2SQL> UPDATE Employee SET EName=‘Jainie’
3     WHERE EID=‘E06’;
4SQL> SAVEPOINT SP2;
5SQL> DELETE FROM Employee WHERE EID=‘E02’;
6SQL> SAVEPOINT SP3;
7SQL> UPDATE Employee SET EName=‘Raina’
8     WHERE EID=‘E04’;
9SQL> ROLLBACK TO SP2;

Show answer

Correct answer

Question 2 on its own page

Question 3

+2 marksOne correct option

Given below are four statements. Match each of them with the corresponding property in the set of ACID properties.
Statement 1: Any data written to the database must be valid according to all the defined rules like the check and key constraints and triggers.
Statement 2: Every completed transaction is saved into the secondary storage.
Statement 3: During money transfer, either the amount debited from the source account must be credited to the destination account or the money should not be debited from the source account at all.
Statement 4: If multiple transactions are being executed concurrently, then the final result should be the same irrespective of the sequence in which the transactions were executed.
Let A denote Atomicity, C denote Consistency, I denote Isolation and D denote Durability. From among the given options, find the correct match.

A
1 - A, 2 - C, 3 - I, 4 - D
B
1 - C, 2 - D, 3 - A, 4 - I
C
1 - C, 2 - D, 3 - I, 4 - A
D
1 - I, 2 - A, 3 - D, 4 - C

Show answer

Correct answer

B
1 - C, 2 - D, 3 - A, 4 - I

Question 3 on its own page

Question 4

+2 marksOne correct option

Consider the following monthly backup schedule used by a company:

Monday	Tuesday	Wednesday	Thursday	Friday	Saturday	Sunday
1/ Full	2/ Incremental	3/ Incremental	4/ Incremental	5/ Incremental	6/ Incremental	7/ Differential
8/ Incremental	9/ Incremental	10/ Incremental	11/ Incremental	12/ Differential	13/ Incremental	14/ Incremental
15/ Incremental	16/ Incremental	17/ Differential	18/ Incremental	19/ Incremental	20/ Incremental	21/ Incremental
22/ Differential	23/ Incremental	24/ Incremental	25/ Incremental	26/ Incremental	27/ Incremental	28/ Incremental
29/ Incremental	30/ Incremental

If a failure occurs on the 27th day of the month before the backup for the day has been completed, how many backup sets have to be loaded for a full recovery?

Show answer

Correct answer

Question 4 on its own page

Question 5

+2 marksOne correct option

Consider the table Players as given below:

PID	name	gender	level
001	Percy	Male	International
002	Jason	Male	District
003	Hazel	Female	National
004	Leo	Male	National
005	Rayna	Female	District
006	Annabeth	Female	National
007	Frank	Male	International
008	Piper	Female	District

Table 1: Players

Let us create two different bitmap indices, one on the gender attribute and the other on the level attribute. Which of the following options will give the correct result if we want to find all females who are playing in the 'District' level.

Note: Options are in the form of gender (operation) level

A
00101101 AND 01001001
B
00101101 OR 00110100
C
11010010 AND 01001001
D
11010010 OR 00110100

Show answer

Correct answer

A
00101101 AND 01001001

Question 5 on its own page

Question 6

+3 marksOne correct option

A
20, 30, 25, 15
B
15, 20, 25, 30
C
20, 25, 30, 15
D
20, 25, 15, 30

Show answer

Correct answer

C
20, 25, 30, 15

Question 6 on its own page

Question 7

+3 marksOne correct option

The following key values are inserted into a B⁺ tree of order 4 in a given sequence. The tree is initially empty.
25,8,13,59,3,31,60,11,43
How many node splits will be required to perform these insertions?

Show answer

Correct answer

Question 7 on its own page

Question 8

+3 marksOne correct option

Show answer

Correct answer

Question 8 on its own page

Question 9

+1 markOne or more correct options

Choose the correct statement(s):

Select all that apply.

A
In a dense index, index record appears for every search-key value in the file.
B
Secondary index is also called non-clustering index
C
Sparse index is contains index records for only some search-key values.
D
In an ordered index, index entries are stored sorted on the search key value.

Show answer

Correct answers

A
In a dense index, index record appears for every search-key value in the file.
B
Secondary index is also called non-clustering index
C
Sparse index is contains index records for only some search-key values.
D
In an ordered index, index entries are stored sorted on the search key value.

Question 9 on its own page

Question 10

+3 marksOne or more correct options

Let $\mathbf{A}(T, U, V, W)$ be a relational schema with the following functional dependencies:

$\mathcal{F} = \{W \rightarrow UT, UV \rightarrow W, V \rightarrow T, W \rightarrow U\}$

We want to decompose the relation A into 3NF. We asked ChatGPT to decompose the relation into 3NF and below shown is the response from ChatGPT:

The decomposed schema in 3NF is:

$\mathbf{R1}(W, U, T)$
$\mathbf{R2}(V, T)$
$\mathbf{R3}(U, V, W)$

Which of the following statement(s) is/are correct?

Select all that apply.

A
The decomposition R1, R2, R3 are in 3NF and all the dependencies are getting preserved.
B
In the decomposition, R2 is not required. As R1 and R3 is sufficient decomposition in 3NF and all the dependencies are getting preserved.
C
In the decomposition, R1 is not required. As R2 and R3 is sufficient decomposition in 3NF and all the dependencies are getting preserved.
D
In the decomposition, R2 is not required. As R1 and R3 is sufficient decomposition in 3NF but all the dependencies will not get preserved.

Show answer

Correct answers

A
The decomposition R1, R2, R3 are in 3NF and all the dependencies are getting preserved.
D
In the decomposition, R2 is not required. As R1 and R3 is sufficient decomposition in 3NF but all the dependencies will not get preserved.

Question 10 on its own page

Question 11

+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

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

Question 11 on its own page

Question 12

+3 marksOne or more correct options

Consider the following schedule S.

T1	T2
r(A)
	r(b)
w(A)
	r(A)
	w(A)
	w(B)
r(B)
w(B)

Table 2: schedule: S

Which of the following is true for schedule S?

Select all that apply.

A
Schedule S is Conflict serializable
B
Schedule S is View serializable
C
Schedule S is not Conflict Serializable
D
Schedule S is not View Serializable

Show answer

Correct answers

C
Schedule S is not Conflict Serializable
D
Schedule S is not View Serializable

Question 12 on its own page

Question 13

+3 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 13 on its own page

Question 14

+3 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 14 on its own page

Question 15

+3 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 15 on its own page

Question 16

+3 marksNumerical answer

The following numbers are inserted into an empty binary search tree in the given order: 27, 23, 33, 49, 51, 92, 83, 10, 78. What is the height of the resulting binary search tree?

Show answer

Correct answer: 6

Question 16 on its own page

Question 17

+3 marksNumerical answer

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: 20500
• Total number of seeks required: 1000
• Number of block in the outer relation: 500
What is the number of blocks in the inner relations?

Show answer

Correct answer: 40

Question 17 on its own page

Question 18

+2 marksNumerical answer

Consider the given log records at an instance of time:

Table 3: Log records

$< T_0 \text{ start} >$
$< T_0, A, 100, 200 >$
$< T_1 \text{ start} >$
$< T_1, B, 400, 300 >$
$< T_0, C, 500, 600 >$
$< T_2 \text{ start} >$
$< T_2, D, 800, 700 >$
$< Commit\ T_1 >$
$< Checkpoint\ L >$
$< T_2, C, 500, 1000 >$
$< Commit\ T_2 >$
$< T_0, B, 400, 500 >$

Suppose there is a system crash after the last log record. What will be the value of the expression (B+C)-(A+D), based on the values stored on the disk at that point:

Show answer

Correct answer: 500

Question 18 on its own page

Question 19

+2 marksOne or more correct options

Select all that apply.

Show answer

Correct answer

Question 19 on its own page

Question 20

+2 marksOne or more correct options

Select all that apply.

A
There might exist an author who has not written any books
B
There might exist a student who has not read any book
C
An author can write at most one book
D
A student can read at most one book

Show answer

Correct answer

B
There might exist a student who has not read any book

Question 20 on its own page