Simulate the following CPU scheduling algorithms FCFS

  #include<stdio.h>

#include<conio.h>
void main()
{
int n,i,bt[10],wt[10],tt[10],totalwt=0,totaltt=tt[0];
 float avgwt,avgtt;
 clrscr();
 printf("\nEnter No.of Processers:");
 scanf("%d",&n);
 printf("\nEnter Elements into Burst Time:");
 for (i=0;i<n;i++){
 scanf("%d",&bt[i]);
 }
 wt[0]=0;
 tt[0]=bt[0];
 for(i=1;i<n;i++)
 {      // wt[0]=0;
        // tt[0]=bt[0];
 wt[i]=wt[i-1]+bt[i-1];
 tt[i]=wt[i]+bt[i];
 totaltt+=tt[i];
 totalwt+=wt[i];
 }
 printf("BT\t\tWT\t\tTT\n");
 for(i=0;i<n;i++){
 printf("%d\t\t%d\t\t%d\n",bt[i],wt[i],tt[i]);
 }
avgtt=totaltt/n;
 avgwt=totalwt/n;
 printf("\nAverage Waiting Time is %f\n",avgwt);
 printf("\nAverage Turnaround Time is %f\n",avgtt);
 getch();
}

Comments

Post a Comment

Popular posts from this blog

CLOOK DISK SCHEDULING

 #include <stdio.h> #include <stdlib.h> int main() {     int queue[20], n, head, i, j, seek_time = 0, diff, max, min, temp, range;     float avg_seek_time;     printf("Enter the number of requests: ");     scanf("%d", &n);     printf("Enter the queue of disk requests: ");     for(i = 0; i < n; i++)         scanf("%d", &queue[i]);     printf("Enter the initial head position: ");     scanf("%d", &head);     queue[n] = head;     n++;     for(i = 0; i < n; i++)     {         for(j = i; j < n; j++)         {             if(queue[i] > queue[j])             {                 temp = queue[i];                 queue[i] = queue[j];   ...
Read more

LOOK Disk Scheduling

#include <stdio.h> #include <stdlib.h> int main() {     int n, i, j, head, seek_time = 0, prev, curr;     printf("Enter the number of requests: ");     scanf("%d", &n);     int requests[n];     printf("Enter the requests: ");     for(i = 0; i < n; i++) {         scanf("%d", &requests[i]);     }     printf("Enter the initial head position: ");     scanf("%d", &head);     prev = head;     for(i = 0; i < n; i++) {         int closest = 999999;         for(j = 0; j < n; j++) {             if(abs(requests[j] - prev) < closest) {                 closest = abs(requests[j] - prev);                 curr = requests[j];             }       ...
Read more