### Explain and Solve : Round Robin (RR) of Operating System Concepts

If you haven't read/tried the earlier/other problems then click the links follow:

Round Robin: This method is quite same as the FCFS but the difference is the in this case the processor will not process the whole job (process) at a time. Instead, it will complete an amount of job (quantum) at a turn and then will go to the next process and so on. When all job has got a turn, it will again start from the first job and work for a quantum of time/cycle on each job and proceed. Now consider a CPU and also consider a list in which the processes are listed as follows,

 Arrival Process Burst Time 0 1 3 1 2 2 2 3 1

Quantum = 2 Second

### Explain and Solve : Priority Scheduling of Operating System Concepts

If you haven't read/tried the earlier problems then click the links follow:

Priority Scheduling: This method is quite same as the SJF but the difference is that instead of choosing the next process to work on by the shortest burst time, CPU chooses the next process by the shortest priority value. Here, all the processes are given a priority value. The process with the shortest (The most shortest is 1) priority will be worked on first and so on. Now consider a CPU and also consider a list in which the processes are listed as follows,

 Arrival Process Burst Time Priority 0 1 3 2 1 2 2 1 2 3 1 3

### Explain and Solve : Shortest Job First (SJF) of Operating System Concepts

If you haven't read/tried the earlier problems then click the links follow:

### Shortest Job First (SJF):

This method is quite same as the FCFS but the difference is the in this case the processor will not process the jobs (processes) as they will come. Instead, a scheduler after a complete cycle (consider this as a 1 second job done) will check which is the job with the shortest burst time right now and will work on that. Now consider a CPU and also consider a list in which the processes are listed as follows,

 Arrival Process Burst Time 0 1 3 1 2 2 2 3 1

### Explain and Solve : First Come First Served (FCFS) of Operating System Concepts

If you haven't read/tried the earlier problems then click the links follow:

First Come First Served (FCFS): CPU gets a lot of processes to handle. The problem is shortening the waiting time for a process to reach CPU and get processed. Now consider a CPU and also consider a list in which the processes are listed as follows,

 Arrival Process Burst Time 0 1 3 1 2 2 2 3 1