C) ?fa process is blocked D) None of these executing in its critical section, th

Question

C) ?fa process is blocked D) None of these executing in its critical section, then all the resources of the system must be i until it finishes execution 10) The scheduling algorithm is designed especially for time-sharing systems A) SJF B) FCFS C) RR D) Multilevel queue npreemptive? ich of the following scheduling algorithms must be no A) SRTF B) RR C) FCFSs 11) Wh D) priority algorithms occurs in first-come-first-served scheduling when a process with a long CPU burst 12) The occupies the CPU and short processes have to wait. A) dispatch latency B) preemptive execution C) convoy effect D) race condition

Explanation / Answer

Answer

10) The ____ scheduling algorithm is designed especially for time-sharing systems.

ans.Round Robin (RR)

11) Which of the following scheduling algorithms must be nonpreemptive?

ans. First Come First Serve (FCFS)

12) The ______ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU and short processes have to wait.

ANS. convoy effect.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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