← All topics
Quiz: File Organization and Hashing: questions with answers
9 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. Block size is 2,048 bytes and each record is 150 bytes (unspanned). What is the blocking factor?
- Q2. Which file organization is best for WHERE roll = 1042 but useless for WHERE marks BETWEEN 60 AND 70?
- Q3. What does this print? (code)
- Q4. What is the main weakness of static hashing for a growing table?
- Q5. In extendible hashing, when must the directory be doubled?
- Q6. Global depth is 3 and a bucket's local depth is 1. How many directory entries point to that bucket?
- Q7. What does this print? (code)
- Q8. Why can choosing a prime number of buckets help with h(k) = k mod M?
- Q9. In a heap file of b blocks, how many blocks does a search for a key that does NOT exist read?