10.2. Exam 2 - Process ManagementΒΆ

Complete take home essay exam 2 and submit typed answers in K-State Online Canvas.

  1. Explain how the round robin scheduling algorithm combines the best attributes of both first come–first served and shortest job next.
  2. In what ways is multilevel priority queue process scheduling similar to shortest job next and also round robin?
  3. Describe the difference between CPU bound and I/O bound processes.
  4. What are Process Control Blocks and how does the operating system use them?
  5. Why does the CPU have a mode bit for user mode and supervisor mode? What changes depending on the value of the mode bit?