8. Scheduling is called preemptive when a. a process switch from running to wait

Question

8. Scheduling is called preemptive when a. a process switch from running to waiting all of the above b. a process terminated d. none of the above 9, # of processes that complete their execution per time unit is called c. throughput d. terminated bdegree of multiprogramming 10. 10 15 21 P2 P3 Pl for the above Gant table using a given CPU scheduling algorithm; assuming all processes arrived at time 0. a. average waiting time is 7 b. c. this type of scheduling is not SJF average turnaround time is 49/4 l of

Explanation / Answer

Q 8) Correct Option C

Preemptive scheduling's main concept is based on priority where a scheduler may preempt a low priority running process when a high priority process enters into a ready state. So when process is preempted then the process is passed in waiting state from running state. It tottaly depends on schedular that it can allow the current process to continue running, or it could stop it and put the current process to sleep and select different process to run.

Q 9) Correct Option C

Throughput:It is the number of processess that complete their execution per unit time

Q 10) Correct Option A

turn around time=Completion time-arrival time which is not equal to 49/4

waiting time=turn around time-burst time, which is equal to 7

Related Questions

Navigate

• Browse (All)
• Browse 8
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.