Round Robin implementation in C
![Image](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiN8MJmXyJ0gzr4fG7mpvffEJ1rIYkE5OQBryuOelNiexKzPtNRtbDTgp2zcLw_Wm73nyoQhjyf9m5iTTZzM60C2J1rfShTsplAf2RCh88zfJf_DFri1K-NvjRpCs8eKUOGlmXX81J1xo4D/s1600/Screenshot+%252820%2529.png)
Simulate the following RR CPU scheduling algorithms to find turnaround time and waiting time Round Robin is a CPU scheduling algorithm where each process is assigned a fixed time slot or quanta in a cyclic way. Things to remember RR is always used in preemptive way Commonly used in CPU its simple and starvation free since every process is given a fair share of time has a Overhead context switch problem Program Output