CPTR 352 - Final Exam Review Questions with
Complete Solutions
Match the scheduling algorithm with the description.
A preemptive scheduling algorithm that is based on a real-time process's remaining time to
process an input.
1. FIFO or FCFS
2. SJF or SJN
3. SRT
4. RR
5. ML
6. MLF
7. RM
8. EDF EDF
Match the scheduling algorithm with the description.
,A preemptive scheduling algorithm that is based on a real-time process's total time allowed to
process an input.
1. FIFO or FCFS
2. SJF or SJN
3. SRT
4. RR
5. ML
6. MLF
7. RM
8. EDF RM
Match the scheduling algorithm with the description.
A non-preemptive scheduling algorithm that is based on a process's arrival time.
1. FIFO or FCFS
,2. SJF or SJN
3. SRT
4. RR
5. ML
6. MLF
7. RM
8. EDF FIFO or FCFS
Match the scheduling algorithm with the description.
A preemptive scheduling algorithm that is based on a process's position within a single queue.
1. FIFO or FCFS
2. SJF or SJN
3. SRT
4. RR
5. ML
, 6. MLF
7. RM
8. EDF RR
Match the scheduling algorithm with the description.
A preemptive scheduling algorithm that is based on a process's recent CPU usage and its
position in a queue.
1. FIFO or FCFS
2. SJF or SJN
3. SRT
4. RR
5. ML
6. MLF
7. RM
8. EDF MLF
Complete Solutions
Match the scheduling algorithm with the description.
A preemptive scheduling algorithm that is based on a real-time process's remaining time to
process an input.
1. FIFO or FCFS
2. SJF or SJN
3. SRT
4. RR
5. ML
6. MLF
7. RM
8. EDF EDF
Match the scheduling algorithm with the description.
,A preemptive scheduling algorithm that is based on a real-time process's total time allowed to
process an input.
1. FIFO or FCFS
2. SJF or SJN
3. SRT
4. RR
5. ML
6. MLF
7. RM
8. EDF RM
Match the scheduling algorithm with the description.
A non-preemptive scheduling algorithm that is based on a process's arrival time.
1. FIFO or FCFS
,2. SJF or SJN
3. SRT
4. RR
5. ML
6. MLF
7. RM
8. EDF FIFO or FCFS
Match the scheduling algorithm with the description.
A preemptive scheduling algorithm that is based on a process's position within a single queue.
1. FIFO or FCFS
2. SJF or SJN
3. SRT
4. RR
5. ML
, 6. MLF
7. RM
8. EDF RR
Match the scheduling algorithm with the description.
A preemptive scheduling algorithm that is based on a process's recent CPU usage and its
position in a queue.
1. FIFO or FCFS
2. SJF or SJN
3. SRT
4. RR
5. ML
6. MLF
7. RM
8. EDF MLF
