Quiz Space

September 2022 term · Database Management Systems · BSCS2001

DBMS End Term: 11 December 2022 (September 2022 term)

The IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 11 Dec 2022, in the September 2022 term: 28 questions for 52 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
28
Marks
52
Duration
180 min
MCQ
17
MSQ
6
Written
5
Take as mock testPractise with answers

Updated

Official paper: IIT M DIPLOMA FN1 EXAM ETD1 11 Dec 2022 · No negative marking.

Question 1

+1 markOne correct option

THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL: DATABASE MANAGEMENT SYSTEMS" ARE YOU SURE YOU HAVE TO WRITE EXAM FOR THIS SUBJECT? CROSS CHECK YOUR HALL TICKET TO CONFIRM THE SUBJECT 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

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

Select all that apply.

  1. A

    Number of block transfers require=420600

  2. B

    Number of block transfers require=420700

  3. C

    Number of seeks require=1200

  4. D

    Number of seeks require=1400

Show answer

Correct answers

  • B

    Number of block transfers require=420700

  • D

    Number of seeks require=1400

Question 2 on its own page

Question 3

+1 markOne 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

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

Question 4

+1 markOne correct option

Consider the following entity relationship diagram as shown in figure 1.

Consider the following entity relationship diagram as shown in figure 1. Which of the following option is the correct E-R notation to express complex attributes?

Consider the following entity relationship diagram as shown in figure 1.
  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

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

    1NF

  2. B

    2NF

  3. C

    3NF

  4. D

    BCNF

Show answer

Correct answer

  • C

    3NF

Question 5 on its own page

Question 6

+1 markOne correct option

The RAID-4 is implemented using four disks. How much space is being utilized effectively? [Note: Each disk has a size of 1 Terabyte]

  1. A

    25%

  2. B

    50%

  3. C

    75%

  4. D

    100%

Show answer

Correct answer

  • C

    75%

Question 6 on its own page

Question 7

+1 markOne correct option

What is the full form of RAID?

  1. A

    Redundant Allocation of Independent Disks

  2. B

    Reliable Array of Independent Disks

  3. C

    Redundant Array of Independent Disks

  4. D

    Reliable Array of Inexpensive Disks

Show answer

Correct answer

  • C

    Redundant Array of Independent Disks

Question 7 on its own page

Question 8

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

    Atomicity

  2. B

    Consistency

  3. C

    Isolation

  4. D

    Durability

Show answer

Correct answer

  • D

    Durability

Question 8 on its own page

Question 9

+3 marksOne or more correct options

Consider the following schedules: S1:W3(A), R2(A), W2(A), W3(B), W3(C), W1(C) S2:W1(A), W3(A), W3(C), W2(A), W1(B), W3(B) Which of the following options is/are correct?

Select all that apply.

  1. A

    Schedule S1 is conflict serializable.

  2. B

    Schedule S1 can be two-phase lockable.

  3. C

    Schedule S2 is conflict serializable.

  4. D

    Schedule S2 can be two-phase lockable.

Show answer

Correct answers

  • A

    Schedule S1 is conflict serializable.

  • B

    Schedule S1 can be two-phase lockable.

  • C

    Schedule S2 is conflict serializable.

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

    T1 and T2 can be ignored.

  2. B

    T1, T2 and T3 can be ignored.

  3. C

    T4 need to be undone.

  4. D

    T0 and T3 need to be redone.

Show answer

Correct answers

  • A

    T1 and T2 can be ignored.

  • C

    T4 need to be undone.

  • D

    T0 and T3 need to be redone.

Question 10 on its own page

Question 11

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

Question 12

+2 marksWritten answer

Consider a Binary Search Tree(BST) consisting of 16 elements. What is the maximum possible height of the given BST?

Show answer

A written answer, not marked automatically.

Question 12 on its own page

Question 13

+2 marksWritten answer

Consider a relation Books (isbn_no, title, publication). The attribute publication consists of 4 distinct values. A bitmap index is created on the attribute publication, the size of the bitmap index file is 800 bytes. Find the number of tuples in the Books relation.

Show answer

A written answer, not marked automatically.

Question 13 on its own page

Question 14

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

A written answer, not marked automatically.

Question 14 on its own page

Question 15

+2 marksOne correct option

Consider the following schedule S as given below: S : R2(A), W2(A),W1(B),W2(C),W3(A),W1(A) According to the timestamp protocol, if the timestamps for transactions T1,T2, and T3 are 7, 2, and 12 respectively, then choose the correct option.

  1. A

    No transaction needs Roll Back.

  2. B

    Transaction T3 needs to Roll Back.

  3. C

    Transaction T2 needs to Roll Back.

  4. D

    Transaction T1 needs to Roll Back.

Show answer

Correct answer

  • D

    Transaction T1 needs to Roll Back.

Question 15 on its own page

Question 16

+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

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

Question 17

+2 marksOne correct option

Consider a disk with a sector size of 256 bytes, 1500 tracks per surface, 60 sectors per track, and 4 double-sided platters. Find out the capacity of one surface of a platter. [Note: 1KB = 1024 bytes]

  1. A

    2,30,40,000 KB

  2. B

    22,500 KB

  3. C

    22,000 KB

  4. D

    90,000 KB

Show answer

Correct answer

  • B

    22,500 KB

Question 17 on its own page

Question 18

+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

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

Question 19

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

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

Question 20

+3 marksOne correct option

Insert the key values in the following order into an empty 3 order B tree: 44, 23, 89, 56, 24, 60, 99, 10, 78, 5. The resultant B tree must contain which of the following key values in the leaf nodes?

  1. A

    10, 24, 56, 89

  2. B

    10, 24, 56, 78, 99

  3. C

    5, 10, 24, 56, 78, 99

  4. D

    5, 24, 56, 60, 89

Show answer

Correct answer

  • C

    5, 10, 24, 56, 78, 99

Question 20 on its own page

Question 21

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

    1-a, 2-c

  2. B

    1-b, 2-e

  3. C

    1-a, 2-e

  4. D

    1-b, 2-d

Show answer

Correct answer

  • C

    1-a, 2-e

Question 21 on its own page

Question 22

+1 markOne or more correct options
Figure from the original question paper

Select all that apply.

  1. A

    PQS

  2. B

    PS

  3. C

    QRU

  4. D

    QS

Show answer

Correct answers

  • A

    PQS

  • D

    QS

Question 22 on its own page

Question 23

+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

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

Question 24

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

    50

  2. B

    500

  3. C

    60

  4. D

    10

Show answer

Correct answer

  • A

    50

Question 24 on its own page

Question 25

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

Select all that apply.

  1. A

    a → b → c

  2. B

    b → a → c

  3. C

    b → c → a

  4. D

    c → b → a

Show answer

Correct answers

  • C

    b → c → a

  • D

    c → b → a

Question 25 on its own page

Question 26

+1 markOne correct option
Figure from the original question paper
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

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

Question 27

+3 marksWritten answer

Consider a multilevel index, where the outermost index entries must be kept in a single disk block. In each block, 20 entries can be accommodated. There are 4000 blocks at the innermost level (first-level index). How many blocks have to be accessed to access a record from the data file by searching the multilevel index?

Show answer

A written answer, not marked automatically.

Question 27 on its own page

Question 28

+1 markWritten answer
Figure from the original question paper
Show answer

A written answer, not marked automatically.

Question 28 on its own page