🏠 Home > Operating System > 6. CPU Scheduling > Linux Scheduling
← Back to 6. CPU Scheduling

📝 Linux Scheduling

📖 From Operating System • 6. CPU Scheduling • 75 questions available

Practice MCQs for Linux Scheduling. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-10

16
Easy Questions
39
Medium Questions
20
Hard Questions

📝 Sample Questions

Q1. Which scheduler became the default Linux scheduling algorithm in release 2.6.23 of the kernel?

🔹 A. O(1) Scheduler
🔹 B. Completely Fair Scheduler (CFS)
🔹 C. Traditional UNIX Scheduler
🔹 D. Real-Time Scheduler

💡 Difficulty: easy | ✅ Correct: B

Q2. What is targeted latency in the CFS scheduler?

🔹 A. The minimum time quantum for a task
🔹 B. The interval of time during which every runnable task should run at least once
🔹 C. The maximum time a task can run before being preempted
🔹 D. The time taken to select the next task

💡 Difficulty: medium | ✅ Correct: B

Q3. In the CFS scheduler, how do I/O-bound tasks typically compare to CPU-bound tasks in terms of vruntime?

🔹 A. I/O-bound tasks have lower vruntime
🔹 B. I/O-bound tasks have higher vruntime
🔹 C. Both have similar vruntime
🔹 D. vruntime is not applicable to I/O-bound tasks

💡 Difficulty: hard | ✅ Correct: A

⬆️ View all questions in the quiz below

🔗 Related Topics

📝 Computer System Architecture📝 Computer System Organization📝 Computing Environments📝 Kernel Data Structures📝 Memory Management
🚀 Start Quiz 📝 Practice Mode