← Back to 12. File System Implementation

📝 Hash table Implementation in Directory

📖 From Operating System • 12. File System Implementation • 10 questions available

Practice MCQs for Hash table Implementation in Directory. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-27

2
Easy Questions
5
Medium Questions
3
Hard Questions

📝 Sample Questions

Q1. What is the primary purpose of a hash function in a hash table?

🔹 A. To sort keys
🔹 B. To compute an index for a key
🔹 C. To encrypt data
🔹 D. To compress values

💡 Difficulty: easy | ✅ Correct: B

Q2. A hash table uses separate chaining with 10 buckets. If 30 keys are inserted, what is the expected average chain length?

🔹 A. 3
🔹 B. 2
🔹 C. 5
🔹 D. 1

💡 Difficulty: medium | ✅ Correct: B

Q3. Given the hash function \(h(k)= (3k+7) \mod 13\) and a table of size 13 using linear probing, where will key 9 be placed if slots 8 and 9 are already occupied?

🔹 A. Slot 7
🔹 B. Slot 8
🔹 C. Slot 9
🔹 D. Slot 10

💡 Difficulty: hard | ✅ Correct: D

⬆️ View all questions in the quiz below

🔗 Related Topics

📝 File System Structure in operating system📝 Overview of File System Implementation in Operating System📝 Partitions and mounting in File System Implementation📝 Virtual File Systems in File System Implementation📝 Linear list Implementation in Directory
🚀 Start Quiz 📝 Practice Mode