Consider the relation CAR(LicenseNo, EngineSerialNo, Model, Year) and the following functional dependencies set Figure from the original question paper If the relation CAR is decomposed into two relations C1 and C2, which of the following is a lossless decomposition?

(B) Option figure from the original question paper

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

(D) Option 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

Consider table profile shown in table 5: | Name | Salary | |---|---| | Data Engg | 55000 | | Data Sci. | 75000 | | Data Arch. | 75000 | | App Dev | 40000 | | JAVA Dev | 30000 | | Programmer | 60000 | Table 5: profile Choose the correct output table when the following query is executed. UPDATE profile SET salary = salary + 5000 WHERE name LIKE 'Data%' or 'X' = 'X'

(C) Option figure from the original question paper

(A) Option figure from the original question paper

(B) Option figure from the original question paper

(D) Option figure from the original question paper

Figure from the original question paper

(B) {Course, Section, Instructor}

(D) {Course, Section, Time, Instructor}

Figure from the original question paper

(A) Both X covers Y and Y covers X

(D) Neither X covers Y nor Y covers X

May 2022 term · Database Management Systems · BSCS2001

Database Management Systems Quiz 2: 10 July 2022 (May 2022 term)

The IIT Madras BS Database Management Systems (DBMS) Quiz 2 paper sat on 10 Jul 2022, in the May 2022 term: 17 questions for 50 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.

Questions: 17
Marks: 50
Duration: 120 min
MCQ: 11
MSQ: 4
Numerical: 2

Take as mock test Practise with answers

Updated 25 Sept 2026

Official paper: IIT M DIPLOMA QUIZ2 EXAM QPE1 10 July 2022 · No negative marking.

Question 1

+2 marksOne correct option

Consider the following statements.
Statement 1: Minimum arity of a node is defined as the arity of the tree.
Statement 2: Arity of the Binary Search Tree is 1.

A
Statement 1 is correct, statement 2 is wrong.
B
Statement 1 is wrong, statement 2 is correct.
C
Both the statements are correct.
D
Both the statements are wrong.

Show answer

Correct answer

D
Both the statements are wrong.

Question 1 on its own page

Question 2

+2 marksOne correct option

A
Decomposition
B
Union
C
Pseudo-transitivity
D
Augmentation

Show answer

Correct answer

B
Union

Question 2 on its own page

Question 3

+2 marksOne correct option

Consider the following statements:
1. HyperText Transfer Protocol (HTTP) is used for communication with the Web server 2. HTTP provides formatting, hypertext link, and image display features.
3. The HTTP protocol is connectionless.
Choose the correct option.

A
Statements 1 & 2 are correct.
B
Statements 2 & 3 are correct.
C
Statements 1 & 3 are correct.
D
All the statements are correct.

Show answer

Correct answer

C
Statements 1 & 3 are correct.

Question 3 on its own page

Question 4

+3 marksOne correct option

Consider the tables Name and Rule shown in the Table 2 and Table 3 respectively.

Name
1. Augmentation
2. Complementation
3. Replication
4. Transitivity

Table 2: Name

Rule
A. If X $\twoheadrightarrow$ Y and Z $\subseteq$ W, then WX $\twoheadrightarrow$ YZ.
B. If X $\twoheadrightarrow$ Y and Y $\twoheadrightarrow$ Z, then X $\twoheadrightarrow$ (Z –Y)
C. If X $\twoheadrightarrow$ Y, then X $\twoheadrightarrow$ (R - (X $\cup$ Y)).
D. If X $\rightarrow$ Y, then X $\twoheadrightarrow$ Y but the reverse is not true

Table 3: Rule

Which among the following is the correct matching of Name and Rule?

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

Show answer

Correct answer

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

Question 4 on its own page

Question 5

+3 marksOne correct option

Consider a relational schema Faculty $(fid, fname, address, experience, designation, salary)$ , where the domains of all the attributes consist of atomic values. Consider the following functional dependencies for the relation Faculty.

$\begin{aligned} &\mathcal{F} = \{ \\ &fid \rightarrow fname, address, experience, designation, \\ &designation \rightarrow salary, \\ &experience \rightarrow designation \\ &\} \end{aligned}$

What is the highest normal form of the above relational schema Faculty?

A
1NF
B
2NF
C
3NF
D
BCNF

Show answer

Correct answer

B
2NF

Question 5 on its own page

Question 6

+3 marksOne correct option

Consider the relation CAR(LicenseNo, EngineSerialNo, Model, Year) and the following functional dependencies set

If the relation CAR is decomposed into two relations C1 and C2, which of the following is a lossless decomposition?

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 table profile shown in table 5:

Name	Salary
Data Engg	55000
Data Sci.	75000
Data Arch.	75000
App Dev	40000
JAVA Dev	30000
Programmer	60000

Table 5: profile

Choose the correct output table when the following query is executed.

sql

1UPDATE profile
2SET salary = salary + 5000
3WHERE name LIKE 'Data%' or 'X' = 'X'

Show answer

Correct answer

Question 8 on its own page

Question 9

+4 marksOne correct option

Consider table employee inside the database organization. Table employee has the data as shown in table 4:

eid	edept	ename	esalary
5	Acc	Abhijeet	720000
6	Mar	Shahid	608000
7	Sales	Shab	200000
8	Mar	Meenakshi	336000
9	Sales	Dj	528000
10	Mar	Sashi	432000
11	Acc	Rekha	3080000
12	HR	Joseph	1822504
13	HR	Arif	3037504

Table 4: employee

How many rows will be fetched and display by the Python code given below?

python

1import os
2import sys
3import psycopg2
4
5conn = None
6try:
7    conn = psycopg2.connect(database = 'organization', user = 'postgres',
8    password = 'passwrd',host = 'localhost',port = '5432')
9
10    cur=conn.cursor()
11    cur.execute('select * from employee where esalary > 500000')
12    result = cur.fetchmany()
13    for i in result:
14        print(i)
15    cur.close()
16except (Exception, psycopg2.DatabaseError) as error:
17        print(error)
18finally:
19    if conn is not None:
20        conn.close()

Show answer

Correct answer

Question 9 on its own page

Question 10

+3 marksOne or more correct options

Select all that apply.

A
{Course, Section, Time}
B
{Course, Section, Instructor}
C
{Instructor, RoomNo}
D
{Course, Section, Time, Instructor}

Show answer

Correct answers

A
{Course, Section, Time}
B
{Course, Section, Instructor}

Question 10 on its own page

Question 11

+4 marksOne or more correct options

Consider the table R shown in the Table 1

Which among the following holds true for the given table?

Select all that apply.

A
X → Y
B
X →→ Y
C
X →→ Z
D
Y → Z

Show answer

Correct answers

B
X →→ Y
C
X →→ Z

Question 11 on its own page

Question 12

+4 marksOne or more correct options

Consider a relational schema BankAccount*(Name, AadharNo, AccountNo,ContactNo)* with the following functional dependencies:

Above relation BankAccount is decomposed into three smaller relations. BankAccount1( Name, AadharNo), BankAccount2(AadharNo, AccountNo) and BankAccount3(AccountNo,ContactNo). Based on the given information, which among the following is incorrect?

Select all that apply.

A
The number of super keys for relation BankAccount are 15.
B
The decomposition of BankAccount is lossy.
C
AccountNo → ContactNo is preserved in the decomposed relations.
D
ContactNo → Name is not preserved in the decomposed relations.

Show answer

Correct answers

B
The decomposition of BankAccount is lossy.
D
ContactNo → Name is not preserved in the decomposed relations.

Question 12 on its own page

Question 13

+4 marksOne or more correct options

Select all that apply.

A
Both X covers Y and Y covers X
B
X covers Y
C
Y covers X
D
Neither X covers Y nor Y covers X

Show answer

Correct answer

C
Y covers X

Question 13 on its own page

Question 14

+3 marksNumerical answer

If the maximum level of a complete binary search tree is 5, then what is the maximum number of nodes?
NOTE: Enter your answer to the nearest integer.

Show answer

Correct answer: 63

Question 14 on its own page

Question 15

+2 marksOne correct option

Answer the given subquestions on the basis of the following data.
Consider a magnetic disk with 8 platters, 2 surfaces/platter, 1024 tracks/surface, 2048 sectors/track, and 512 bytes/sector. The disk rotates with 6000 revolutions per minute.

What is the capacity of the disk?

A
16 GB
B
32 GB
C
32 MB
D
16 MB

Show answer

Correct answer

A
16 GB

Question 15 on its own page

Question 16

+3 marksNumerical answer

What is the minimum number of bits required for addressing all the sectors?
NOTE: Enter your answer to the nearest integer.

Show answer

Correct answer: 25

Question 16 on its own page

Question 17

+2 marksOne correct option

Given that the rotational speed of the disk is 6000 revolutions per minute. Consider the seek time is 3ms. What will be the rotational latency?

A
10 sec
B
5 sec
C
10 ms
D
5 ms

Show answer

Correct answer

D
5 ms

Question 17 on its own page