New Paste

Content

#include <iostream>
#include <vector>
#include <queue>
#include <iomanip>

using namespace std;

struct Process {
    int id;
    int arrivalTime;
    int burstTime;
    int startTime;
    int finishTime;
    int remainingTime;
    int waitingTime;
    int turnaroundTime;
    int responseTime;
};

void roundRobin(vector<Process>& processes, int n, int quantum) {
    queue<int> readyQueue;
    int time = 0;
    int completed = 0;
    double totalTurnaroundTime = 0;
    double totalWaitingTime = 0;
    double totalResponseTime = 0;
    vector<bool> visited(n, false);

readyQueue.push(0);
    visited[0] = true;
    processes[0].startTime = 0;

while (completed != n) {
        int idx = readyQueue.front();
        readyQueue.pop();

if (processes[idx].remainingTime == processes[idx].burstTime) {
            processes[idx].responseTime = time - processes[idx].arrivalTime;
            totalResponseTime += processes[idx].responseTime;
        }

if (processes[idx].remainingTime > quantum) {
            time += quantum;
            processes[idx].remainingTime -= quantum;
        } else {
            time += processes[idx].remainingTime;
            processes[idx].remainingTime = 0;
            processes[idx].finishTime = time;
            processes[idx].waitingTime = processes[idx].finishTime - processes[idx].arrivalTime - processes[idx].burstTime;
            processes[idx].turnaroundTime = processes[idx].finishTime - processes[idx].arrivalTime;

totalWaitingTime += processes[idx].waitingTime;
            totalTurnaroundTime += processes[idx].turnaroundTime;
            completed++;
        }

for (int i = 1; i < n; i++) {
            if (processes[i].arrivalTime <= time && !visited[i] && processes[i].remainingTime > 0) {
                readyQueue.push(i);
                visited[i] = true;
            }
        }

if (processes[idx].remainingTime > 0) {
            readyQueue.push(idx);
        }
    }

cout << fixed << setprecision(2);
    cout << "Average Turnaround Time: " << totalTurnaroundTime / n << endl;
    cout << "Average Waiting Time: " << totalWaitingTime / n << endl;
    cout << "Average Response Time: " << totalResponseTime / n << endl;
}

int main() {
    int n, quantum;
    cout << "Enter the number of processes: ";
    cin >> n;

vector<Process> processes(n);
    for (int i = 0; i < n; i++) {
        processes[i].id = i + 1;
        cout << "Enter arrival time of process " << i + 1 << ": ";
        cin >> processes[i].arrivalTime;
        cout << "Enter burst time of process " << i + 1 << ": ";
        cin >> processes[i].burstTime;
        processes[i].remainingTime = processes[i].burstTime;
    }

cout << "Enter time quantum: ";
    cin >> quantum;

roundRobin(processes, n, quantum);

return 0;
}

Optional Paste Settings

Title

Select folder or

Syntax Highlighting

Paste Expiration

Paste Status

Password

Description

Our statistics

Create and share texts quickly and easily 🚀

296,466+

Total pastes

151,602,915+

Total views

87+

Registered users

Our features

Everything you need 😉

Pastes creation

Create multiple posts quickly and easily with our powerful editor.

Folders

Store your pastes in different folders with custom names.

Paste protection

Protect your pastes with password, encryption and captcha.

Multiple syntax languages

We have 150+ syntax languages for your codes.

URL monetization

Earn money by enabling url shorteners in your pastes.

Global settings

Configure each aspect of your pastes globally.

Recent Pastes

Watch France vs Israel live streaming 14.11.2024
HTML | 63 | 48 seconds ago
NexusWholesaleLLC
HTML | 389 | 1 minute ago
Class-oop
Plaintext | 371 | 3 minutes ago
rindusejati
HTML | 855 | 3 minutes ago
Top 10 Marketing Pitfalls
HTML | 85 | 4 minutes ago
Live streaming Leksand vs Frölunda 14.11.2024
HTML | 1K | 5 minutes ago
The Environmental Impact of Demolition in Melbourne
HTML | 253 | 6 minutes ago