Home > Computer Engineering > Quizzes > Operating Systems Practice Test: CPU Scheduling
Operating Systems Practice Test: CPU Scheduling
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 64% Most missed: “The switching of the CPU from one process or thread to another is called _______…”
Operating Systems Practice Test: CPU Scheduling
Time left 00:00
25 Questions

1. Scheduling is done so as to ____________
2. The real difficulty with SJF in short term scheduling is ____________
3. What is an interrupt vector?
4. What is an ISR?
5. With round robin scheduling algorithm in a time shared system ____________
6. In a programmed input/output(PIO) __________
7. Consider the following set of processes, the length of the CPU burst time given in milliseconds. Process Burst time P1 6 P2 8 P3 7 P4 3 Assuming the above process being scheduled with the SJF scheduling algorithm.
8. How does the Hardware trigger an interrupt?
9. In an interrupt driven input/output __________
10. Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section ____________
11. A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem.
12. Mutual exclusion implies that ____________
13. An I/O bound program will typically have ____________
14. A process is selected from the ______ queue by the ________ scheduler, to be executed.
15. Which of the following conditions must be satisfied to solve the critical section problem?
16. The switching of the CPU from one process or thread to another is called ____________
17. Preemptive Shortest Job First scheduling is sometimes called ____________
18. DMA is used for __________
19. Round robin scheduling falls under the category of ____________
20. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
21. Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________
22. Choose one of the disadvantages of the priority scheduling algorithm?
23. Orders are processed in the sequence they arrive if _______ rule sequences the jobs.
24. What is ‘Aging’?
25. Which of the following algorithms tends to minimize the process flow time?