Quiz Space

Database Management Systems · Quiz 2 · 12 Apr 2026 · January 2026 term · Set 1

Question 2: Suppose we are trying to find a number 52 in a binary sea…

Question 2

+3 marksOne or more correct options

Suppose we are trying to find a number 52 in a binary search tree. Which of the following probe sequences are possible while performing the search? Note: Each option shows a probe sequence for searching 52 in different binary search trees

Select all that apply.

  1. A

    85, 62, -18, 55, -8, 51, 52

  2. B

    78, -22, 68, -10, 58, 55, 52

  3. C

    -25, 82, 45,-10, 70, 55, 52

  4. D

    28, 75,-15, 62,-8, 68, 52

Show answer

Correct answers

  • A

    85, 62, -18, 55, -8, 51, 52

  • B

    78, -22, 68, -10, 58, 55, 52

See the whole paperTake it as a mock test

Question 2 of 16 in the IIT Madras BS Database Management Systems (DBMS) Quiz 2 paper sat on 12 Apr 2026, in the January 2026 term (Business Data Management 06 Apr 26). It carries 3 marks.

More questions from this paper

  1. Q1Consider the following Entity Relationship Diagram: Choose the correct statement(s):
  2. Q3Consider the relation M(P,Q,R,S,T ) with the following functional dependencies: S → PQ PQR → ST The number of super key…
  3. Q4Consider the following schema:
  4. Q5Consider the relational schema R(A, B, C, D, E, F, G, H), with the following functional dependencies: D → EF GB → C G →…
  5. Q6Consider a relation G(P,Q,R,S,T), with the following functional dependencies: T → P QR → T P → Q What is the highest no…
  6. Q7Consider a relation R(A,B,C,D,E,F,G,H) with the following functional dependencies: A→BC B →CFH E →A F →EG CH →G Normali…
  7. Q8Consider a hard-disk with the following specifications: Average Seek Time = 12ms Average Rotational delay = 3.5 ms One …
  8. Q9Consider a relation shoe(model, price) which contains the models and prices of different shoes. If it is given that pri…
  9. Q10Which among the following methods of psycopg2 is/are used to execute SQL statements?
  10. Q11Consider a relation R(A,B,C,D) which has no non-trivial functional dependencies. Select all the option(s) which can ser…
  11. Q12Consider a relation R(A,B,C,D,E) with the following functional dependency set: FD = {D → B, E → A, CD → E } If this rel…
  12. Q13How many functional dependencies are there in the canonical/minimal cover of the given relation?
  13. Q14How many canonical/minimal cover(s) is/are possible for the given relation?
  14. Q15Suppose LRU block replacement policy is used for managing the buffer in main memory. If the buffer has 3 block frames, …
  15. Q16Given a relation T(P,Q,R) with the following set of functional dependencies: P → QR Q → PR R → PQ Answer the given sub-…