🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: File Organization and Hashing: all 9 questions

Quiz: File Organization and Hashing · Question 9 of 9

In a heap file of b blocks, how many blocks does a search for a key that does NOT exist read?

In a heap file of b blocks, how many blocks does a search for a key that does NOT exist read?

  1. A.1
  2. B.b/2
  3. C.log₂ b
  4. D.b
Answer & explanation

Correct answer: b

With no order, the search can only stop after checking every block.

Can you get the rest right without peeking?

Take the timed Quiz: File Organization and Hashing quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →