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

Question text with timeline "Figure 3: State of Transactions" showing transactions T1-T5 relative to a checkpoint and a system failure

(A) T2 can be ignored and T3 needs to be redone.

(C) T1 needs to be redone and T4 can be undone.

(B) T4 needs to be undone and T5 needs to be redone.

(D) T3 needs to be undone and T4 needs to be redone.

Consider the Schedule given below: | T_1 | T_2 | T_3 | |---|---|---| | | | R(D) | | | R(A) | | | R(C) | | | | | W(A) | | | | R(B) | | | | R(C) | | | | | R(E) | | R(A) | | | | | R(D) | | | W(A) | | | | | | W(B) | | R(E) | | | Which of the following statements is/are correct about the given Schedule?

(A) A precedence graph of the schedule is acyclic

(D) The given schedule is view serializable and conflict serializable

(B) The given schedule is not view serializable

(C) The given schedule is view serializable but not conflict 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

Consider the definition of the table Products. CREATE TABLE Products ( Product_SID CHAR(10) PRIMARY KEY, Product_Name CHAR(50) UNIQUE, Category CHAR(30) NOT NULL, Price NUMERIC(8,2) CHECK (PRICE >= 0), Stock INT CHECK (STOCK >= 0) ); The following sequence of queries is executed on this table: 1. INSERT INTO Products VALUES ('P101', 'Laptop', 'Electronics', 1200.00, 50); 2. INSERT INTO Products VALUES ('P102', 'Smartphone', 'Electronics', 800.00, 100); 3. INSERT INTO Products VALUES ('P103', 'Desk Chair', 'Furniture', 150.00, 20); Which of the following results in an invalid operation on the table Products?

(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) Option figure from the original question paper

(C) Option figure from the original question paper

(A) Option figure from the original question paper

(D) Option figure from the original question paper

Figure from the original question paper

(A) The decomposition of R into R1 and R2 is dependency preserving.

(B) The decomposition of R into R1 and R2 is lossless.

Question text with ER diagram "Figure 4: Banking System" (entities Bank, Loan, Account, Customer with relationships Offers, Manages, Availed by, Hod by)

(A) A bank offers more than one loan

(D) Every customer must be holding at least one account

(B) An account is managed by more than one bank

(C) Every loan must be availed by at least one customer

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

Consider the following table: | BookID | Title | Author | Publisher | |---|---|---|---| | 301 | Introduction to SQL | Dr. Anderson | ABC Publishers | | 302 | Data Science Basics | Dr. Kim | XYZ Publishers | | 303 | Machine Learning | Dr. Anderson | ABC Publishers | | 304 | Data Science Basics | Dr. Taylor | XYZ Publishers | | 305 | Advanced SQL | Dr. Anderson | ABC Publishers | Table 2: Books Which of the following functional dependencies hold in the Books table?

(A) Option figure from the original question paper

(C) Option figure from the original question paper

(D) Option figure from the original question paper

(B) Option figure from the original question paper

September 2024 term · Database Management Systems · BSCS2001

Database Management Systems End Term: 22 December 2024, Set QDF1 (September 2024 term)

The IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 22 Dec 2024, in the September 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: 9
MSQ: 10
Numerical: 1

Take as mock test Practise with answers

Updated 25 Sept 2026

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

Question 1

+2 marksOne correct option

Consider the table Player given in Figure 1.

pname	team	rating	age	type
AJAY	TEAM-B	7	23	BATSMAN
ARIF	TEAM-B	8	33	BOWLER
JAMES	TEAM-A	8	22	ALLROUNDER
JHON	TEAM-A	9	26	BOWLER
MARTIN	TEAM-A	7	25	BATSMAN
RAJ	TEAM-A	8	31	BATSMAN
RAMESH	TEAM-B	6	23	BATSMAN
ROBIN	TEAM-B	8	28	ALLROUNDER
ROSS	TEAM-A	6	24	BATSMAN

Figure 1: Table Player

The bitmap index on the table Player is as shown in Figure 2.

1	0	0	0	1	1	1	0	1
0	1	0	1	0	0	0	0	0
0	0	1	0	0	0	0	1	0

Figure 2: Bitmap index

Identify the column on which the given bitmap index is constructed.

A
team
B
rating
C
age
D
type

Show answer

Correct answer

D
type

Question 1 on its own page

Question 2

+2 marksOne correct option

Show answer

Correct answer

Question 2 on its own page

Question 3

+2 marksOne correct option

Consider seek time of your hard disk read head is 2ms, rotational speed is 60,000 RPM. The disk has 300 sectors/track and sector size is 256 bytes. What will be the transfer rate (KB/ms)?

A
75 KB/ms
B
25 KB/ms
C
50 KB/ms
D
100 KB/ms

Show answer

Correct answer

A
75 KB/ms

Question 3 on its own page

Question 4

+2 marksOne correct option

Consider a non-empty B+-tree of order 13. What are the maximum and minimum number of keys that can be placed in the root node?

A
max. number of keys = 13, min. number of keys = 6.
B
max. number of keys = 12, min. number of keys = 1.
C
max. number of keys = 14, min. number of keys = 1.
D
max. number of keys = 14, min. number of keys = 7.

Show answer

Correct answer

B
max. number of keys = 12, min. number of keys = 1.

Question 4 on its own page

Question 5

+2 marksOne correct 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 50. If the number of blocks in level L1 is 62,50,000, then how many blocks are required at L2, L3, L4 and L5?

A
Number of blocks at L2 is 125000,
Number of blocks at L3 is 2500,
Number of blocks at L4 is 50,
Number of blocks at L5 is 1
B
Number of blocks at L2 is 125000,
Number of blocks at L3 is 2000,
Number of blocks at L4 is 50,
Number of blocks at L5 is 1
C
Number of blocks at L2 is 120000,
Number of blocks at L3 is 2400,
Number of blocks at L4 is 40,
Number of blocks at L5 is 1
D
Number of blocks at L2 is 120000,
Number of blocks at L3 is 3000,
Number of blocks at L4 is 60,
Number of blocks at L5 is 1

Show answer

Correct answer

A
Number of blocks at L2 is 125000,
Number of blocks at L3 is 2500,
Number of blocks at L4 is 50,
Number of blocks at L5 is 1

Question 5 on its own page

Question 6

+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/ Incremental	13/ Differential	14/ Incremental
15/ Incremental	16/ Incremental	17/ Incremental	18/ Incremental	19/ Differential	20/ Incremental	21/ Incremental
22/ Incremental	23/ Incremental	24/ Incremental	25/ Differential	26/ Incremental	27/ Incremental	28/ Incremental
29/ Incremental	30/ Incremental

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

Show answer

Correct answer

Question 6 on its own page

Question 7

+3 marksOne correct option

Show answer

Correct answer

Question 7 on its own page

Question 8

+3 marksOne correct option

Consider the given log records at an instance of time:

$< T_0 \text{ start} >$
$< T_0, A, 1000, 800 >$
$< T_1 \text{ start} >$
$< T_1, B, 500, 750 >$
$< T_0, C, 1700, 1000 >$
$< T_2 \text{ start} >$
$< T_2, D, 420, 690 >$
$< Commit\ T_2 >$
$< Checkpoint\ L >$
$< T_1, D, 690, 710 >$
$< Commit\ T_1 >$
$< T_0, B, 750, 350 >$

Table 1: Log records

Suppose there is a system crash after the last log record. What would be the values of A, B, C and D stored on disk at that point?

A
A = 1000, B = 750, C = 1700, D = 710
B
A = 1000, B = 750, C = 1700, D = 690
C
A = 1000, B = 350, C = 1700, D = 710
D
A = 1000, B = 350, C = 1700, D = 690

Show answer

Correct answer

A
A = 1000, B = 750, C = 1700, D = 710

Question 8 on its own page

Question 9

+1 markOne correct option

Consider the following statements:
1. Hot backup refers to keeping a database up and running while the backup is being performed concurrently.
2. Cold backup is mainly used for Transaction Log Backup.
3. Transactional Logging is used in circumstances where a possibly inconsistent backup is taken. Choose the correct option.

A
Statements 1 and 2 are correct
B
Statements 1 and 3 are correct
C
All the statements are correct
D
Only Statement 1 is correct

Show answer

Correct answer

B
Statements 1 and 3 are correct

Question 9 on its own page

Question 10

+3 marksOne or more correct options

Select all that apply.

A
T2 can be ignored and T3 needs to be redone.
B
T4 needs to be undone and T5 needs to be redone.
C
T1 needs to be redone and T4 can be undone.
D
T3 needs to be undone and T4 needs to be redone.

Show answer

Correct answers

A
T2 can be ignored and T3 needs to be redone.
C
T1 needs to be redone and T4 can be undone.

Question 10 on its own page

Question 11

+3 marksOne or more correct options

Consider the Schedule given below:

$T_1$	$T_2$	$T_3$
		R(D)
	R(A)
R(C)
	W(A)
	R(B)
	R(C)
		R(E)
R(A)
	R(D)
W(A)
		W(B)
R(E)

Which of the following statements is/are correct about the given Schedule?

Select all that apply.

A
A precedence graph of the schedule is acyclic
B
The given schedule is not view serializable
C
The given schedule is view serializable but not conflict serializable
D
The given schedule is view serializable and conflict serializable

Show answer

Correct answers

A
A precedence graph of the schedule is acyclic
D
The given schedule is view serializable and conflict serializable

Question 11 on its own pageAlso asked in End Term 3 Sept 2023

Question 12

+3 marksOne or more correct options

Consider the following two schedules S1 and S2 and three transactions $T_1, T_2, T_3$ :

$\begin{aligned} &\mathbf{S1}: R_1(X); R_3(Y); W_1(X); R_2(X); W_3(Y); W_2(X); R1(Y); W_1(Y); \\ &\mathbf{S2}: R_3(Y); R_1(X); W_1(X); R_2(X); W_3(Y); R_1(Y); W_1(Y); W_2(X); \end{aligned}$

where $R_i(X)$ denotes a read operation by transaction $T_i$ on a data item X, $W_i(X)$ denotes a write operation by transaction $T_i$ on a data item X, $C_i$ denotes a commit by $T_i$ , and $A_i$ denotes an abort by $T_i$ .

Which among the following statements is/are correct?

Select all that apply.

A
S1 and S2 are conflict equivalent.
B
S1 and S2 are not conflict equivalent.
C
S1 and S2 are view equivalent.
D
S1 and S2 are not view equivalent.

Show answer

Correct answers

A
S1 and S2 are conflict equivalent.
C
S1 and S2 are view equivalent.

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

Consider the definition of the table Products.

sql

1CREATE TABLE Products (
2  Product_SID CHAR(10) PRIMARY KEY,
3  Product_Name CHAR(50) UNIQUE,
4  Category CHAR(30) NOT NULL,
5  Price NUMERIC(8,2) CHECK (PRICE >= 0),
6  Stock INT CHECK (STOCK >= 0)
7);

The following sequence of queries is executed on this table:

sql

11. INSERT INTO Products VALUES ('P101', 'Laptop', 'Electronics', 1200.00, 50);
22. INSERT INTO Products VALUES ('P102', 'Smartphone', 'Electronics', 800.00, 100);
33. INSERT INTO Products VALUES ('P103', 'Desk Chair', 'Furniture', 150.00, 20);

Which of the following results in an invalid operation on the table Products?

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 marksOne or more correct options

Select all that apply.

A
The decomposition of R into R1 and R2 is dependency preserving.
B
The decomposition of R into R1 and R2 is lossless.
C
The schema R1 is in 3NF.
D
The schema R2 is in 2NF.

Show answer

Correct answers

A
The decomposition of R into R1 and R2 is dependency preserving.
C
The schema R1 is in 3NF.
D
The schema R2 is in 2NF.

Question 16 on its own page

Question 17

+3 marksOne or more correct options

Select all that apply.

A
A bank offers more than one loan
B
An account is managed by more than one bank
C
Every loan must be availed by at least one customer
D
Every customer must be holding at least one account

Show answer

Correct answers

A
A bank offers more than one loan
D
Every customer must be holding at least one account

Question 17 on its own page

Question 18

+2 marksOne or more correct options

Select all that apply.

Show answer

Correct answers

Question 18 on its own page

Question 19

+2 marksOne or more correct options

Consider the following table:

BookID	Title	Author	Publisher
301	Introduction to SQL	Dr. Anderson	ABC Publishers
302	Data Science Basics	Dr. Kim	XYZ Publishers
303	Machine Learning	Dr. Anderson	ABC Publishers
304	Data Science Basics	Dr. Taylor	XYZ Publishers
305	Advanced SQL	Dr. Anderson	ABC Publishers

Table 2: Books

Which of the following functional dependencies hold in the Books table?

Select all that apply.

Show answer

Correct answers

Question 19 on its own page

Question 20

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

Show answer

Correct answer: 100

Question 20 on its own page