Each student will be able to:

• Define each of the following terms in 20 words or less.
  • process
  • context switch
  • process-control block
  • process scheduling
  • process starvation
• Draw a diagram defining the ready-execute-wait process cycle. Clearly indicate the different queues involved and include the appropriate arcs between the states (queues).
• List four distinct pieces of information that need to be included in a process-control block.
• Describe three distinct process scheduling algorithms.
• Compare and contrast Round-Robin and First-Come-First-Served scheduling algorithms with respect to "fairness" and "throughput"
• Describe a simple addition to priority scheduling that will prevent starvation.
• Using an example program, show how Linux pipes can be used to communicate between processes.