uiz Space

January 2026 term · Database Management Systems · BSCS2001

Database Management Systems End Term: 10 May 2026, Set 2 (January 2026 term)

The IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 10 May 2026, in the January 2026 term, set 2: 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
7
Written
5
Take as mock testPractise with answers

Updated

Official paper: Database Management Systems 06 May 26 · No negative marking.

Question 1

+2 marksOne correct option

Consider a B+ tree index to be built on the attribute EmployeeID of a table Employees, with the following properties: • The length of the attribute EmployeeID is 16 bytes. • The size of each child pointer is 8 bytes. • The size of each disk block size is 512 bytes. • The size of each record pointer is 10 bytes. With the given information, what is the best choice for the order of the non-leaf nodes of the B+ tree?

  1. A

    19

  2. B

    20

  3. C

    21

  4. D

    22

Show answer

Correct answer

  • D

    22

Question 1 on its own page

Question 2

+2 marksOne correct option
Figure from the original question paper
  1. A

    4

  2. B

    5

  3. C

    6

  4. D

    7

Show answer

Correct answer

  • A

    4

Question 2 on its own page

Question 3

+2 marksOne correct option
Figure from the original question paper
  1. A

    {A → D, C → D, AB → C, D → A}

  2. B

    {C → D, AD → B, AB → D, D → C}

  3. C

    {A → B, C → D, AB → C, D → B}

  4. D

    {C → D, AB → D, B → A, A → D }

Show answer

Correct answer

  • D

    {C → D, AB → D, B → A, A → D }

Question 3 on its own page

Question 4

+2 marksOne correct option
Figure from the original question paper
  1. A
    Figure from the original question paper
  2. B
    Figure from the original question paper
  3. C
    Figure from the original question paper
  4. D
    Figure from the original question paper
Show answer

Correct answer

  • A
    Figure from the original question paper
Question 4 on its own page

Question 5

+3 marksOne correct option

Identify the hash function, that generates unique hash values for the following search key values: 11, 19, 25, 32, 7.

Identify the hash function, that generates unique hash values for the following search key values: 11, 19, 25, 32, 7.
  1. A

    —

  2. B

    —

  3. C

    —

  4. D

    —

Show answer

Correct answer

  • C

    —

Question 5 on its own page

Question 6

+3 marksOne correct option
Figure from the original question paper
  1. A

    10000100 OR 00000110

  2. B

    00000101 OR 00100100

  3. C

    10000100 AND 00100100

  4. D

    10000100 OR 00100100

Show answer

Correct answer

  • D

    10000100 OR 00100100

Question 6 on its own page

Question 7

+3 marksOne correct option
Figure from the original question paper
  1. A

    Q1 is correct but Q2 is wrong

  2. B

    Q2 is correct but Q1 is wrong

  3. C

    Both Q1 and Q2 are wrong

  4. D

    Both Q1 and Q2 are correct

Show answer

Correct answer

  • D

    Both Q1 and Q2 are correct

Question 7 on its own page

Question 8

+3 marksOne correct option

The query returns:

The query returns:
  1. A

    Names of employees who work on at least one project

  2. B

    Names of employees who work on exactly one project

  3. C

    Names of employees who work on all projects

  4. D

    Names of employees who do not work on any project

Show answer

Correct answer

  • C

    Names of employees who work on all projects

Question 8 on its own page

Question 9

+3 marksOne or more correct options

Schedule S is as given:

Schedule S is as given:

Select all that apply.

  1. A

    Schedule S is conflict serializable.

  2. B

    Schedule S can be two-phase lockable.

  3. C

    Two phase lockable schedules are always serializable.

  4. D

    Schedule S is not two-phase lockable.

Show answer

Correct answers

  • A

    Schedule S is conflict serializable.

  • C

    Two phase lockable schedules are always serializable.

  • D

    Schedule S is not two-phase lockable.

Question 9 on its own page

Question 10

+3 marksOne or more correct options
Figure from the original question paper

Select all that apply.

  1. A
    Figure from the original question paper
  2. B
    Figure from the original question paper
  3. C
    Figure from the original question paper
  4. D
    Figure from the original question paper
Show answer

Correct answers

  • A
    Figure from the original question paper
  • C
    Figure from the original question paper
Question 10 on its own page

Question 11

+3 marksOne or more correct options

Consider a relation schema S(A,B,C,D,E,G) and the set of functional dependencies, F = {A → BC, B → D, D → E, E → B, C → G}. This schema is decomposed into two relations S1 (A,B,D,E) and S2(A,C,G). Consider the following statements given below regarding the decomposition of S1 and S2. Choose the correct option(s).

Select all that apply.

  1. A

    The decomposition of S into S1 and S2 is dependency preserving.

  2. B

    The decomposition of S into S1 and S2 is lossless.

  3. C

    The schema S1 is in 2NF.

  4. D

    The schema S2 is in 3NF.

Show answer

Correct answers

  • A

    The decomposition of S into S1 and S2 is dependency preserving.

  • B

    The decomposition of S into S1 and S2 is lossless.

  • C

    The schema S1 is in 2NF.

Question 11 on its own page

Question 12

+3 marksOne or more correct options

Which of the following sequences will result in the given tree?

Which of the following sequences will result in the given tree?

Select all that apply.

  1. A

    50, 25, 75, 65, 35, 12, 85, 10, 82, 40, 53, 90, 18

  2. B

    50, 25, 75, 65, 12, 35, 85, 10, 18, 40, 53, 90, 82

  3. C

    50, 65, 75, 25, 12, 35, 85, 10, 18, 40, 53, 90, 82

  4. D

    50, 25, 65, 75, 12, 35, 85, 10, 18, 53, 40, 82, 90

Show answer

Correct answers

  • A

    50, 25, 75, 65, 35, 12, 85, 10, 82, 40, 53, 90, 18

  • B

    50, 25, 75, 65, 12, 35, 85, 10, 18, 40, 53, 90, 82

Question 12 on its own page

Question 13

+1 markOne or more correct options

Choose the correct statement(s).

Select all that apply.

  1. A

    RAID 0 only uses data striping, no redundant information is maintained.

  2. B

    RAID 1 employs mirroring, maintaining two identical copies of the data on two different disks.

  3. C

    RAID 3 consists of bit-level striping with dedicated parity.

  4. D

    RAID 4 write performance is high as parity is distributed over multiple disks.

Show answer

Correct answers

  • A

    RAID 0 only uses data striping, no redundant information is maintained.

  • B

    RAID 1 employs mirroring, maintaining two identical copies of the data on two different disks.

Question 13 on its own page

Question 14

+2 marksOne or more correct options

Consider the E-R Diagram as shown below:

Consider the E-R Diagram as shown below:

Select all that apply.

  1. A

    A course can be managed by at most one instructor.

  2. B

    There might exist an instructor who does not work in any course.

  3. C

    The entity health is a weak entity and is existence dependent on instructors.

  4. D

    All courses have at least one instructor working on them.

Show answer

Correct answers

  • A

    A course can be managed by at most one instructor.

  • B

    There might exist an instructor who does not work in any course.

  • C

    The entity health is a weak entity and is existence dependent on instructors.

Question 14 on its own page

Question 15

+2 marksOne or more correct options

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

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

Select all that apply.

  1. A

    T1 can be ignored.

  2. B

    T2 and T3 need to be redone.

  3. C

    T4 and T5 need to be undone.

  4. D

    T3 can be ignored.

Show answer

Correct answers

  • A

    T1 can be ignored.

  • B

    T2 and T3 need to be redone.

  • C

    T4 and T5 need to be undone.

Question 15 on its own page

Question 16

+3 marksWritten answer

Consider you have a file in your hard disk of size 1200 KB. Seek time of your hard disk read head is 4 ms and rotational speed is 24,000 rpm. The disk has 200 sectors per track and 512 bytes per sector. Considering the fact that the file data is stored in consecutive sectors, how much time will be required to read the whole file after a read request is made? (answer in milliseconds and calculate upto two decimal places)

Show answer

A written answer, not marked automatically.

Question 16 on its own page

Question 17

+3 marksWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 17 on its own page

Question 18

+3 marksWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 18 on its own page

Question 19

+2 marksWritten answer

Find the total number of super keys of S.

Find the total number of super keys of S.
Show answer

A written answer, not marked automatically.

Question 19 on its own page

Question 20

+2 marksWritten answer

Consider a block nested-loop join for the two relations employees and works:

Consider a block nested-loop join for the two relations employees and works:
Show answer

A written answer, not marked automatically.

Question 20 on its own page