Preview

05 - Scheduling, types and function

 1. A single core computer can appear to multi-task by running small parts of multiple programs one after the other.
scheduling_q1.png

  TRUE

  FALSE

 2. The scheduler is the module of the operating system (OS) that allocates _____ ____ to programs.

  processor time

  virtual memory

  computational volume

  resource space

 3. The scheduler has to try to maximise efficient use of the CPU and make sure no tasks are left incomplete for too long.

  FALSE

  TRUE

 4. What scheduling algorithm is described below? 
All processes ready to run are put into a queue. The first process is allocated 
a set amount of CPU time. If the process is completed within the set time, 
the next process is loaded into RAM. If the process is not finished, 
it is sent to the back of the queue.

  Round robin

  Leapfrog

  Just in time

  First past the post

 5. A first come first served algorithm allows each process in a queue to …

  move to another queue

  be arranged by length of processing time

  pause and return to the queue

  run to completion

 6. What scheduling algorithm is described below? 
The processes are queued and run in order of the length of time the alogrithm estimates each process needs to run to completion.

  Lottery scheduling

  Priority job first

  Shortest job first

  Longest job first

 7. The shortest remaining time alogrithm orders processes by the estimated length of time required to …

  re-order the queue

  pause the process

  complete all processes in the queue

  complete the process

 8. What scheduling algorithm is described below? 
The scheduler decides the priority of each process and puts it into a different queue. 
Higher priority jobs are completed first, followed by lower priority jobs. Processes
can be moved between queues.

  Mixed priority queue

  Split sequence queue

  Tri-level response queue

  Multi-level feedback queue

 9. Which of these algorithms would prioritise starting a long but less important process over a short but more important process for the user?

  First come first served

  Shortest remaining time

  Shortest job first

  Lottery scheduling

 10. Which of these algorithms could significantly delay the completion of low priority processes?

  Shortest remaining time

  Split sequence queue

  Multi-level feedback queue

  Tri-level response queue


Report an error