📝 Kernel Data Structures

📖 From Operating System • 1. Introduction to Operating System • 4 questions available

Practice MCQs for Kernel Data Structures. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-04

Easy Questions

Medium Questions

Hard Questions

Q1. For implementing the ready queue in an operating system scheduler, why is a doubly linked list generally preferred over a singly linked list?

🔹 A. It allows for O(1) removal of a process from anywhere in the list given only a pointer to that process.

🔹 B. It uses less memory per node because it requires fewer pointers.

🔹 C. It prevents infinite loops during traversal.

🔹 D. It allows for faster sequential access than arrays.

💡 Difficulty: easy | ✅ Correct: A

Q2. In the context of I/O request handling, why might an operating system use a priority queue instead of a standard FIFO queue?

🔹 A. To ensure that all requests are processed in the exact order they were received.

🔹 B. To allow high-priority processes (like real-time tasks) to bypass lower-priority ones.

🔹 C. To reduce the memory overhead of storing request metadata.

🔹 D. To simplify the driver code by removing the need for sorting.

💡 Difficulty: medium | ✅ Correct: B

Q3. Which data structure is most appropriate for managing function calls and local variable storage during program execution, and why?

🔹 A. Queue, because it ensures First-In-First-Out processing of function returns.

🔹 B. Stack, because it supports Last-In-First-Out (LIFO) behavior required for nested function calls.

🔹 C. Array, because it allows random access to any active function's variables.

🔹 D. Linked List, because it allows dynamic resizing of the call history.

💡 Difficulty: easy | ✅ Correct: B

⬆️ View all questions in the quiz below

🚀 Start Quiz 📝 Practice Mode