uiz Space

May 2025 term · Database Management Systems · BSCS2001

Database Management Systems Quiz 2: 3 August 2025, Set 4 (May 2025 term)

The IIT Madras BS Database Management Systems (DBMS) Quiz 2 paper sat on 3 Aug 2025, in the May 2025 term, set 4: 15 questions for 51 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
15
Marks
51
Duration
120 min
MCQ
8
MSQ
5
Written
2
Take as mock testPractise with answers

Updated

Official paper: IIT M IMPROVEMENT AN EXAM QIV4 03 Aug · No negative marking.

Question 1

+1 markOne correct option

THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : DATABASE MANAGEMENT SYSTEMS (COMPUTER BASED EXAM)" ARE YOU SURE YOU HAVE TO WRITE EXAM FOR THIS SUBJECT? CROSS CHECK YOUR HALL TICKET TO CONFIRM THE SUBJECTS TO BE WRITTEN. (IF IT IS NOT THE CORRECT SUBJECT, PLS CHECK THE SECTION AT THE TOP FOR THE SUBJECTS REGISTERED BY YOU)

  1. A

    YES

  2. B

    NO

Show answer

Correct answer

  • A

    YES

Question 1 on its own page

Question 2

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

    The decomposition is lossless and dependency preserving

  2. B

    The decomposition is lossy and dependency preserving

  3. C

    The decomposition is lossless but not dependency preserving

  4. D

    The decomposition is lossy and not dependency preserving

Show answer

Correct answer

  • C

    The decomposition is lossless but not dependency preserving

Question 2 on its own page

Question 3

+4 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 3 on its own page

Question 4

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

    1NF

  2. B

    2NF

  3. C

    3NF

  4. D

    BCNF

Show answer

Correct answer

  • B

    2NF

Question 4 on its own page

Question 5

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

    1

  2. B

    4

  3. C

    6

  4. D

    5

Show answer

Correct answer

  • D

    5

Question 5 on its own page

Question 6

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

    Statement 1 is correct and Statement 2 is wrong

  2. B

    Both the statements are wrong.

  3. C

    Statement 1 is wrong and Statement 2 is correct.

  4. D

    Both the statements are correct.

Show answer

Correct answer

  • D

    Both the statements are correct.

Question 6 on its own page

Question 7

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

    8

  2. B

    9

  3. C

    10

  4. D

    11

Show answer

Correct answer

  • C

    10

Question 7 on its own page

Question 8

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

    F = Novel, G = BookWorld, H = ReadersHub, I = Delhi, J = Mumbai

  2. B

    F = Magazine, G = BookWorld, H = ReadersHub, I = Delhi, J = Mumbai

  3. C

    F = Magazine, G = ReadersHub, H = BookWorld, I = Delhi, J = Mumbai

  4. D

    F = Novel, G = ReadersHub, H = BookWorld, I = Mumbai, J = Delhi

Show answer

Correct answer

  • B

    F = Magazine, G = BookWorld, H = ReadersHub, I = Delhi, J = Mumbai

Question 8 on its own page

Question 9

+4 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

  • B
    Figure from the original question paper
  • D
    Figure from the original question paper
Question 9 on its own page

Question 10

+4 marksOne or more correct options

Construct a binary search tree by inserting the values in the following order 15,14, 30, 5, 13, 19, 26, 12, 1, 6. Which of the following statement(s) is/are correct? Note: Consider the root node at level 0.

Select all that apply.

  1. A

    The height of binary search tree is 6.

  2. B

    The sum of the leaf nodes of the binary search tree is 33

  3. C

    The nodes 12,1 and 6 are part of the left subtree of node 13.

  4. D

    Node 19 is at level 2

Show answer

Correct answers

  • B

    The sum of the leaf nodes of the binary search tree is 33

  • D

    Node 19 is at level 2

Question 10 on its own pageAlso asked in Quiz 2 3 Aug 2025, Quiz 2 3 Aug 2025, Quiz 2 3 Aug 2025, Quiz 2 3 Aug 2025 and 1 more

Question 11

+2 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

  • B
    Figure from the original question paper
  • D
    Figure from the original question paper
Question 11 on its own page

Question 12

+2 marksOne or more correct options

Identify the correct statement(s):

Select all that apply.

  1. A

    Binary search has a time complexity of O(log n). where n is number ofelements.

  2. B

    In a linked list the data elements are required to be stored in contiguousmemory locations

  3. C

    Main memory is the fastest and most costly form of storage

  4. D

    A sector is the smallest unit of data read or written on a Magnetic Disk forevery read operation.

Show answer

Correct answers

  • A

    Binary search has a time complexity of O(log n). where n is number ofelements.

  • D

    A sector is the smallest unit of data read or written on a Magnetic Disk forevery read operation.

Question 12 on its own pageAlso asked in Quiz 2 3 Aug 2025, Quiz 2 3 Aug 2025, Quiz 2 3 Aug 2025, Quiz 2 3 Aug 2025 and 1 more

Question 13

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

Select all that apply.

  1. A

    Query 1 will execute more efficiently when multitable clustering fileorganization scheme is used.

  2. B

    Both the queries will execute more efficiently when sequential clustering fileorganization scheme is used.

  3. C

    Query 2 will execute more efficiently when sequential clustering fileorganization scheme is used.

  4. D

    Query 1 will execute more efficiently when sequential clustering fileorganization scheme is used.

Show answer

Correct answers

  • A

    Query 1 will execute more efficiently when multitable clustering fileorganization scheme is used.

  • C

    Query 2 will execute more efficiently when sequential clustering fileorganization scheme is used.

Question 13 on its own page

Question 14

+4 marksWritten answer

Consider a binary search tree consisting of 31 elements. Let m be the maximum height possible for a given binary search tree, and n be the minimum height possible for a given binary search tree. What will be the value of m − n?

Show answer

A written answer, not marked automatically.

Question 14 on its own page

Question 15

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

A written answer, not marked automatically.

Question 15 on its own page