OS Round Robin Scheduling

Round Robin ( RR )

The name of this algorithm comes from the round-robin principle, where each person gets an equal share of something in turns. It is the oldest, simplest scheduling algorithm, which is mostly used for multitasking.

In Round-robin scheduling, each ready task runs turn by turn only in a cyclic queue for a limited time slice. This algorithm also offers starvation free execution of processes.

Q1. Write a C Program to compute the waiting time and turnaround time for each processes using the Round Robin Algorithm, given names of two process and their burst times. Assume that the process arrive at the same time t0.

Answer: Click Here

Q2. Write a C Program to compute the waiting time and turnaround time for each processes using the Round Robin Algorithm, given names of two process and their burst times. Also compute and print the average waiting time, average turnaround time and Gantt Chart. Assume that the process arrive at the same time t0.

Answer: Click Here