📝 Proportional Share Scheduling in Real Time CPU Scheduling

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

Practice MCQs for Proportional Share Scheduling in Real Time CPU Scheduling. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-10

Easy Questions

Medium Questions

Hard Questions

📝 Sample Questions

Q1. What is the primary mechanism used by proportional share schedulers to allocate CPU time?

🔹 A. Time quanta are assigned based on process priority

🔹 B. T shares are allocated among all applications

🔹 C. CPU time is allocated on a first-come, first-served basis

🔹 D. Processes are allocated CPU time based on their memory usage

💡 Difficulty: easy | ✅ Correct: B

Q2. What happens when a new process requests shares that exceed the available unallocated shares?

🔹 A. The process is admitted with a lower priority

🔹 B. The process is admitted but with fewer shares

🔹 C. The process is denied entry to the system

🔹 D. The system increases the total shares T

💡 Difficulty: medium | ✅ Correct: C

Q3. What is the key requirement for proportional share schedulers to guarantee CPU allocations?

🔹 A. They must use the shortest job first algorithm

🔹 B. They must work with an admission-control policy

🔹 C. They must be implemented in hardware

🔹 D. They must use fixed time quanta

💡 Difficulty: hard | ✅ Correct: B

⬆️ 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