Implementation of Round Robin CPU Scheduling algorithm using C++ (2024)

Home
DS & Algo. ▾
- Data Structure
- Algorithms
- Coding Problems
Languages ▾
- C
- C++
- C++ STL
- Java
- Python
- Scala
- Ruby
- C#.Net
- Golang
- Android
- Kotlin
- SQL
Web. ▾
- JavaScript
- CSS
- jQuery
- PHP
- Node.Js
- AdonisJs
- VueJS
- Ajax
- HTML
- Django
Programs ▾
- C
- C++
- Data Structure
- Java
- C#.Net
- VB.Net
- Python
- PHP
- Golang
- Scala
- Swift
- Rust
- Ruby
- Kotlin
- C Interview Programs
Aptitude ▾
- C Aptitude
- C++ Aptitude
- Java Aptitude
- C# Aptitude
- PHP Aptitude
- Linux Aptitude
- DBMS Aptitude
- Networking Aptitude
- AI Aptitude
- More...
Interview ▾
- Golang
- MIS Executive
- DBMS
- C
- Embedded C
- Java
- SEO
- HR
Find Output ▾
- C
- C++
- C#.Net
- Java
- Go
- PHP
- More...
MCQs ▾
- Web Technologie MCQs
- CS Subjects MCQs
- Databases MCQs
- Programming MCQs
- Testing Software MCQs
- Digital Mktg Subjects MCQs
- Cloud Computing S/W MCQs
- Engineering Subjects MCQs
- Commerce MCQs
- More MCQs...
CS Subjects ▾
- Machine Learning/AI
- Operating System
- Computer Network
- Software Engineering
- Discrete Mathematics
- Digital Electronics
- Data Mining
- MIS
- DBMS
- Embedded Systems
- Cryptography
- CS Fundamental
- More Tutorials...
More ▾
- Tech Articles
- Puzzles
- Full Forms
- Code Examples
- Blogs
- Guest Post
- Programmer's Calculator
- XML Sitemap Generator
- About
- Contact

Round Robin Algorithm

This algorithm is known as preemptive version of FCFS as discussed earlier, it executes the process on the basis of first come first serve, and the only difference here is it works on the principle of quantum time.

C++ Program for the Round Robin Scheduling

//C++ Program to implement Round Robin //Scheduling CPU Algorithm#include <iostream>#include <vector>/*at = Arrival time,bt = Burst time,time_quantum= Quantum timetat = Turn around time,wt = Waiting time*/using namespace std;int main(){int i,n,time,remain,temps=0,time_quantum;int wt=0,tat=0;cout<<"Enter the total number of process="<<endl;cin>>n;remain=n;// assigning the number of process to remain variablevector<int>at(n);vector<int>bt(n);vector<int>rt(n);//dynamic array declaration using vector method of (STL)//STL standard template library of C++cout<<"Enter the Arrival time, Burst time for All the processes"<<endl;for(i=0;i<n;i++){cin>>at[i];cin>>bt[i];rt[i]=bt[i];}cout<<"Enter the value of time QUANTUM:"<<endl;cin>>time_quantum;cout<<"\n\nProcess\t:Turnaround Time:Waiting Time\n\n";for(time=0,i=0;remain!=0;){if(rt[i]<=time_quantum && rt[i]>0){time += rt[i];//Addition using shorthand operatorsrt[i]=0;temps=1;}else if(rt[i]>0){rt[i] -= time_quantum;//Subtraction using shorthand operatorstime += time_quantum;//Addition using shorthand operators}if(rt[i]==0 && temps==1){remain--;//Desplaying the result of wating, turn around time:printf("Process{%d}\t:\t%d\t:\t%d\n",i+1,time-at[i],time-at[i]-bt[i]);cout<<endl;wt += time-at[i]-bt[i];tat += time-at[i];temps=0;}if(i == n-1)i=0;else if(at[i+1] <= time)i++;elsei=0;}cout<<"Average waiting time "<<wt*1.0/n<<endl;cout<<"Average turn around time "<<tat*1.0/n<<endl;;return 0;}

Output