The document describes a program to simulate the round robin CPU scheduling algorithm, which takes as input the number of processes, arrival time and burst time of each process, and a time quantum. The program uses a for loop to calculate the waiting time, turnaround time, and display the Gantt chart of processes executed in a round robin fashion. The output includes the average waiting time and average turnaround time.
The document describes a program to simulate the round robin CPU scheduling algorithm, which takes as input the number of processes, arrival time and burst time of each process, and a time quantum. The program uses a for loop to calculate the waiting time, turnaround time, and display the Gantt chart of processes executed in a round robin fashion. The output includes the average waiting time and average turnaround time.
The document describes a program to simulate the round robin CPU scheduling algorithm, which takes as input the number of processes, arrival time and burst time of each process, and a time quantum. The program uses a for loop to calculate the waiting time, turnaround time, and display the Gantt chart of processes executed in a round robin fashion. The output includes the average waiting time and average turnaround time.
The document describes a program to simulate the round robin CPU scheduling algorithm, which takes as input the number of processes, arrival time and burst time of each process, and a time quantum. The program uses a for loop to calculate the waiting time, turnaround time, and display the Gantt chart of processes executed in a round robin fashion. The output includes the average waiting time and average turnaround time.
Aim: To write a program to stimulate the CPU scheduling algorithm Priority Scheduling Algorithm.
Source Code: #include <stdio.h> //Function to swap two variables void swap(int *a,int *b) { int temp=*a; *a=*b; *b=temp; } int main() { int n; printf("Enter Number of Processes: "); scanf("%d",&n); // b is array for burst time, p for priority and index for process id int b[n],p[n],index[n]; for(int i=0;i<n;i++) { printf("Enter Burst Time and Priority Value for Process %d: ",i+1); scanf("%d %d",&b[i],&p[i]); index[i]=i+1; } for(int i=0;i<n;i++) { int a=p[i],m=i;
//Finding out highest priority element and placing it at its desired position for(int j=i;j<n;j++) { if(p[j] > a) { a=p[j]; m=j; } }
printf("Order of process Execution is\n"); for(int i=0;i<n;i++) { printf("P%d is executed from %d to %d\n",index[i],t,t+b[i]); t+=b[i]; } printf("\n"); printf("Process Id Burst Time Wait Time TurnAround Time\n"); int wait_time=0; for(int i=0;i<n;i++) { printf("P%d %d %d %d\n",index[i],b[i],wait_time,wait_time + b[i]); wait_time += b[i]; } return 0; } Output: Lab-8 Date: 03-11-2022
Round Robin Scheduling.
Aim: To write a program to stimulate the CPU scheduling
algorithm Round Robin Scheduling.
Source Code: #include<stdio.h> #include<conio.h> void main() { // initlialize the variable name int i, NOP, sum=0,count=0, y, quant, wt=0, tat=0, at[10], bt[10], temp[10]; float avg_wt, avg_tat; printf(" Total number of process in the system: "); scanf("%d", &NOP); y = NOP; // Assign the number of process to variable y
// Use for loop to enter the details of the process like Arrival time and the Burst Time for(i=0; i<NOP; i++) { printf("\n Enter the Arrival and Burst time of the Process[%d]\n", i+1); printf(" Arrival time is: \t"); // Accept arrival time scanf("%d", &at[i]); printf(" \nBurst time is: \t"); // Accept the Burst time scanf("%d", &bt[i]); temp[i] = bt[i]; // store the burst time in temp array } // Accept the Time qunat printf("Enter the Time Quantum for the process: \t"); scanf("%d", &quant); // Display the process No, burst time, Turn Around Time and the waiting time printf("\n Process No \t\t Burst Time \t\t TAT \t\t Waiting Time "); for(sum=0, i = 0; y!=0; ) { if(temp[i] <= quant && temp[i] > 0) // define the conditions { sum = sum + temp[i]; temp[i] = 0; count=1; } else if(temp[i] > 0) { temp[i] = temp[i] - quant; sum = sum + quant; } if(temp[i]==0 && count==1) { y--; //decrement the process no. printf("\nProcess No[%d] \t\t %d\t\t\t\t %d\t\t\t %d", i+1, bt[i], sum-at[i], sum-at[i]-bt[i]); wt = wt+sum-at[i]-bt[i]; tat = tat+sum-at[i]; count =0; } if(i==NOP-1) { i=0; } else if(at[i+1]<=sum) { i++; } else { i=0; } } // represents the average waiting time and Turn Around time avg_wt = wt * 1.0/NOP; avg_tat = tat * 1.0/NOP; printf("\n Average Turn Around Time: \t%f", avg_wt); printf("\n Average Waiting Time: \t%f", avg_tat); getch(); } Output:
Beata Stawarska - Saussure's Philosophy of Language As Phenomenology - Undoing The Doctrine of The Course in General Linguistics-Oxford University Press (2015) PDF
Beata Stawarska - Saussure's Philosophy of Language As Phenomenology - Undoing The Doctrine of The Course in General Linguistics-Oxford University Press (2015) PDF
