Question

2. Which of the following scheduling algorithm is nonpreemptiye?

A. Shortest-Job-First Scheduling
B. First-Come, First-Served Scheduling
6. Priority Scheduling
D. Round-Robin Scheduling​

Answer 1

Answer:

Hope it helps you.

Explanation:

A Process Scheduler schedules different processes to be assigned to the CPU based on particular scheduling algorithms. There are six popular process scheduling algorithms which we are going to discuss in this chapter −

First-Come, First-Served (FCFS) Scheduling

Shortest-Job-Next (SJN) Scheduling

Priority Scheduling

Shortest Remaining Time

Round Robin(RR) Scheduling

Multiple-Level Queues Scheduling

These algorithms are either non-preemptive or preemptive. Non-preemptive algorithms are designed so that once a process enters the running state, it cannot be preempted until it completes its allotted time, whereas the preemptive scheduling is based on priority where a scheduler may preempt a low priority running process anytime when a high priority process enters into a ready state.

Answer 2

Explanation:

round robin scheduling is the answer