Scheduling Algorithms

In this, the process that comes first will be executed first and next process starts only after the previous gets fully executed.

• First-come, first-serve

• Shortest-job-first scheduling

• Round-robin scheduling

• Priority scheduling

• Multilevel Queue scheduling

This is scheduling policy that selects for execution the waiting process with the smallest execution time.

• First-come, first-serve

• Shortest-job first scheduling

• Round-robin scheduling

• Priority scheduling

• Multilevel queue scheduling

It is a CPU Scheduling algorithm where each process is assigned a fixed time slot in a cyclic way.

• First-come, first-serve

• Shortest-job-first scheduling

• Round-robin scheduling

• Priority scheduling

• Multilevel queue scheduling

Allocating time on the processor to individual processes is known as...

• CPU Scheduling
• CPU Timing
• CPU Clocking
• CPU Sorting

The problem with round robin, SJF and STR is what?

• They don't take into account priority

• They all take too long

• Short jobs will not be completed

Which of these is NOT an aim of the CPU scheduler

• To maximise CPU time

• Process as many jobs as possible

• To complete jobs in at least 30 seconds

Which of these is a benefit of FCFS

• Simple to implement

• It considers priority

• Long jobs will get completed eventually

Which algorithm is being described.."Long jobs might never get completed as short processes will always ‘jump the queue"

• Round robin

• FCFS

• STR

Which algorithm is complicated to implement and might not look at small jobs

• Multi-level feedback

• Round robin

• FCFS

If a CPU has the following:

Process A = 3 cycles

Process B = 2 cycles

Process C = 5 cycles

Which would implement 'B' the quickest?

• Round robin (1 cycle time slice)

• FCFS

• STR