uiz Space

May 2026 term · Database Management Systems · BSCS2001

Database Management Systems End Term: 13 September 2026 (May 2026 term)

The IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 13 Sept 2026, in the May 2026 term: 18 questions for 44 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
18
Marks
44
Duration
180 min
MCQ
9
Numerical
6
MSQ
3

Updated

Official paper: Database Management 13 Sep 26 · No negative marking.

Question 1

+3 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • C

Question 2

+3 marksOne correct option
  1. A

    1

  2. B

    2

  3. C

    3

  4. D

    4

Show answer

Correct answer

  • B

    2

Question 3

+3 marksOne correct option

Consider the relational schema R(A, B, C, D, E, F), where the domains for A, B, C, D, E and F include atomic values only. If R satisfies the functional dependencies {AB → CDE, ABC → EF, E → F}, then identify the correct statement(s).

  1. A

    R is in 2NF and also in 3NF

  2. B

    R is in 2NF but not in 3NF

  3. C

    R is in BCNF but not in 3NF

  4. D

    R is in 3NF and also in BCNF

Show answer

Correct answer

  • B

    R is in 2NF but not in 3NF

Question 4

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 5

+2 marksOne correct option

Consider the following ER relationship:

Which of the following statements is correct?

  1. A

    Every student must enroll in at least one course.

  2. B

    A student can enroll in at most one course.

  3. C

    A course must have at least one student.

  4. D

    A course can have at most one student.

Show answer

Correct answer

  • C

    A course must have at least one student.

Question 6

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 7

+2 marksOne correct option

Which of the following could be the hash function used by the file?

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 8

+2 marksOne correct option
  1. A
  2. B
  3. C
  4. D
Show answer

Correct answer

  • A

Question 9

+3 marksNumerical answer
Show answer

Correct answer: 2400

Question 10

+3 marksNumerical answer
Show answer

Correct answer: 4

Question 11

+3 marksNumerical answer
Show answer

Correct answer: 256

Question 12

+3 marksNumerical answer
Show answer

Correct answer: 5

Question 13

+3 marksOne or more correct options

Select all that apply.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answers

  • A
  • C

Question 14

+3 marksOne or more correct options

Consider the following schedule S and answer question

Which of the following is/are correct?

Select all that apply.

  1. A

    The schedule is 2-phase lockable

  2. B

    The schedule is not 2-phase lockable

  3. C

    Schedule is Serializable

  4. D

    Schedule is not Serializable

Show answer

Correct answers

  • B

    The schedule is not 2-phase lockable

  • D

    Schedule is not Serializable

Question 15

+2 marksOne or more correct options

Consider the following relation Employee.

A bitmap index is constructed on the attribute Team, with one bitmap for each distinct value of Team. The bits in each bitmap correspond to the rows of the table in the order shown above.
Which of the following statements are correct?

Select all that apply.

  1. A
  2. B
  3. C
  4. D
Show answer

Correct answers

  • A
  • B
  • C

Question 16

+1 markOne correct option

Consider the following statements.
1. In RAID 2, the Hamming code is used for parity. 2. RAID 4 has a striping unit of disk block instead of a single bit. 3. The Write performance of RAID 5 is poorer than that of RAID 6. 4. RAID 10 provides better throughput and latency than all other RAID levels except RAID 0.

  1. A

    Statement 1, 2 and 3 are correct.

  2. B

    Statement 1 and 3 are correct.

  3. C

    Statement 1, 3 and 4 are correct.

  4. D

    Statement 1, 2 and 4 are correct.

Show answer

Correct answer

  • D

    Statement 1, 2 and 4 are correct.

Question 17

+2 marksNumerical answer

Consider a Block nested loop join for the two relations, employee and project. Assuming the worst-case memory availability and employee as the outer relation, the provided details are as follows: Total number of block transfers: 18300• Total number of seeks required: 800• Number of blocks in the outer relation: 300• What is the number of blocks in the inner relation?

Show answer

Correct answer: 60

Question 18

+2 marksNumerical answer

Consider the following backup schedule used by a company:

If a system failure occurs on Sunday before the backup for the day has been completed, what is the minimum number of backup sets that must be loaded for complete recovery?

Show answer

Correct answer: 4