Uniprocessor Scheduling / Scgeduling Algorythms

Refer to the table you produced based on follows.

Please answer thet Below are 10 questions.

1. The scheduling policy for which process D finishes the latest is a. FCFS b. RR1 c. SPN d. SRT

2. The scheduling policy for which process B finishes the earliest is a. FCFS b. RR1 c. SPN d. SRT

3. The process that finishes at the same time regardless of scheduling policy is a. A b. B c. C d. D e. E

4. The longest residency (or "turnaround") time T_r for any process under any scheduling policy is a. 8 b. 10 c. 15 d. 18 e. 20

5. The poorest (greatest) normalized residency T_r/T_s for any process under any scheduling policy is a. 1.98 b. 10.00 c. 20.00 d. 3.50 e. 6.20

6. The scheduling policy that exhibits the poorest average normalized residency time (averaged over all the processes) is a. FCFS b. RR1 c. SPN d. SRT

7. The process that needs the smallest amount of execution time in order to run from start to finish (independent of scheduling algorithm) is a. A b. B c. C d. D e. E

8. The scheduling policy for which the termination of the first process to complete occurs latest is a. FCFS b. RR1 c. SPN d. SRT 9. If the normalized residency T_r/T_s of a process is 1 it means a. The amount of time the process resided in the system was the same as that of all other processes b. The process entered the system at the same time as its predecessor left the system c. The amount of time the process resided in the system was the same as that of its predecessor d. The amount of time the process resided in the system was the same as that of its successor e. The amount of time the process resided in the system was kept to a minimum

10. The scheduling policy for which the execution of processes is most highly interspersed (intermixed instead of one-at-a-time) is: a. FCFS b. RR1 c. SPN d. SRT

Table 9.4 Process Scheduling Example Process Arrival Time Service Tim 0 0 8