SLR4 - Scheduling Algorithms

Which scheduling algorithm is this?
"Each process is given a maximum length of processor time in the running state, after which it is put back into the ready queue."

• Round robin (RR)

• Shortest remaining time (SRT)

• Multi-level feedback queues (MLFQ)

• First come first server (FCFS)

• Shortest job first (SJF)

Which scheduling algorithm is this?
"The ready queue is sorted by estimated completion time."

• Round robin (RR)

• Shortest remaining time (SRT)

• Multi-level feedback queues (MLFQ)

• First come first server (FCFS)

• Shortest job first (SJF)

Which scheduling algorithm is this?
"Processes that arrive with a shorter completion time than the current running process are moved to the running state."

• Round robin (RR)

• Shortest remaining time (SRT)

• Multi-level feedback queues (MLFQ)

• First come first server (FCFS)

• Shortest job first (SJF)

Which scheduling algorithm is this?
"Several ready queues are used, each with a different scheduling algorithm."

• Round robin (RR)

• Shortest remaining time (SRT)

• Multi-level feedback queues (MLFQ)

• First come first server (FCFS)

• Shortest job first (SJF)

Which scheduling algorithm is this?
"Jobs can move between different queues as their priorities change."

• Round robin (RR)

• Shortest remaining time (SRT)

• Multi-level feedback queues (MLFQ)

• First come first server (FCFS)

• Shortest job first (SJF)

Which scheduling algorithm is this?
"The first job to enter the queue is the first to enter the running state. "

• Round robin (RR)

• Shortest remaining time (SRT)

• Multi-level feedback queues (MLFQ)

• First come first server (FCFS)

• Shortest job first (SJF)

Which scheduling algorithm is this?
"The same scheuling method used by queues in shops like Tesco. "

• Round robin (RR)

• Shortest remaining time (SRT)

• Multi-level feedback queues (MLFQ)

• First come first server (FCFS)

• Shortest job first (SJF)

Which type of algrithm does NOT change the order when scheduling?

• Pre-emptive

• Non Pre-emptive

Which scheduling algorithm is this?
"Jobs are sorted in the ready queue according to the estimated processor time needed. "

• Round robin (RR)

• Shortest remaining time (SRT)

• Multi-level feedback queues (MLFQ)

• First come first server (FCFS)

• Shortest job first (SJF)

Which of the following is an example of a 'Non-Pre-emptive' scheduling algorithm.

• Round robin (RR)

• Multi-level feedback queues (MLFQ)

• First come first server (FCFS)

• Shortest job first (SJF)

• Shorest Remaining Time (SRT)