Quiz Space

Database Management Systems · Quiz 2 · 3 Aug 2025 · May 2025 term · Set 2

DBMS Quiz 2 3 Aug 2025 — Question 12

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 of 15 in the IIT Madras BS Database Management Systems (DBMS) Quiz 2 paper sat on 3 Aug 2025, in the May 2025 term (IIT M IMPROVEMENT AN EXAM QIV4 03 Aug). It carries 2 marks.

This question was also asked in

More questions from this paper

  1. Q1THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : DATABASE MANAGEMENT SYSTEMS (COMPUTER BASED EXAM)" ARE YOU SURE…
  2. Q2Figure question
  3. Q3Figure question
  4. Q4Figure question
  5. Q5Figure question
  6. Q6Figure question
  7. Q7Figure question
  8. Q8Figure question
  9. Q9Figure question
  10. Q10Construct a binary search tree by inserting the values in the following order 15,14, 30, 5, 13, 19, 26, 12, 1, 6. Which…
  11. Q11Figure question
  12. Q13Figure question
  13. Q14Consider a binary search tree consisting of 31 elements. Let m be the maximum height possible for a given binary search…
  14. Q15Figure question