Professional Documents
Culture Documents
PRATICAL -03
Aim - Implementation of First Come First Serve (FCFS) CPU scheduling.
#include <iostream>
using namespace std;
int main()
{
int processes[] = {1, 2, 3};
int n = sizeof processes / sizeof processes[0];
MAHARISHI MARKENDESHWOR DEEMED TO BE UNIVERSITY ,MULLANA,AMBALA
Name: Ajay Dangoriya Tharu Section: D1
Roll no: 11222780 Course Code : BCSE-507L
Output:
MAHARISHI MARKENDESHWOR DEEMED TO BE UNIVERSITY ,MULLANA,AMBALA
Name: Ajay Dangoriya Tharu Section: D1
Roll no: 11222780 Course Code : BCSE-507L
PRATICAL-04
Aim – Implementation of Shortest Job First (SJF) CPU Scheduling.
#include <iostream>
using namespace std;
int main()
{
int A[100][4];
int i, j, n, total = 0, index, temp;
float avg_wt, avg_tat;
temp = A[i][0];
A[i][0] = A[index][0];
A[index][0] = temp;
}
A[0][2] = 0;
avg_wt = (float)total / n;
MAHARISHI MARKENDESHWOR DEEMED TO BE UNIVERSITY ,MULLANA,AMBALA
Name: Ajay Dangoriya Tharu Section: D1
Roll no: 11222780 Course Code : BCSE-507L
total = 0;
cout << "P BT WT TAT" << endl;
avg_tat = (float)total / n;
cout << "Average Waiting Time= " << avg_wt << endl;
cout << "Average Turnaround Time= " << avg_tat << endl;
}
OUTPUT: