OS: CPU Scheduling
This game contains the MCQs on CPU scheduling topic
Create multiple-choice games on Wisc-Online and play them on our Chakalaka mobile app!
But that's not all! Explore educational games created by others. Simply search by category or enter agame code number and dive into a world of learning and fun.
Download the Chakalaka mobile app here:
Topics of this game:
- Which of the following process scheduling algorithm may lead to starvation
- Which scheduling policy is most suitable for a time-shared operating systems?
- Consider a set of n tasks with known runtimes r1, r2, … rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?
- Which of the following scheduling algorithms is non-preemptive?
- Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2. Group I | Group II (P) Gang Scheduling (1) Guaranteed Scheduling (Q) Rate Monotonic Scheduling (2) Real-time Scheduling (R) Fair Share Scheduling (3) Thread Scheduling
User comments are currently unavailable. We apologize for the inconvenience and are working to restore this feature as soon as possible.