Rajan

1.  ROUND ROBIN CPU SCHEDULING ALGORITHM   #include<stdio.h>   int main() {        int i, limit, total = 0 , x, counter = 0 , time_quantum;        int wait_time = 0 , turnaround_time = 0 , arrival_time[ 10 ], burst_time[ 10 ], temp[ 10 ];        float average_wait_time, average_turnaround_time;        printf( "nEnter Total Number of Processes:t" );        scanf( "%d" , &limit);        x = limit;        for (i = 0 ; i < limit; i++)        {              printf( "nEnter Details of Process[%d]n" , i + 1 );                printf( "Arrival Tim...

1. FCFS CPU SCHEDULING ALGORITHM #include<stdio.h> #include<conio.h> int fr[3];   void main() { void display(); int i,j,page[12]={2,3,2,1,5,2,4,5,3,2,5,2}; int flag1=0,flag2=0,pf=0,frame_size=3,top=0;   for(i=0;i<3;i++) { fr[i]=-1; } for(j=0;j<12;j++) { flag1=0; flag2=0; for(i=0;i<12;i++) { if(fr[i]==page[j]) { flag1=1; flag2=1; break; } } if(flag1==0) { for(i=0;i<frame_size;i++) { if(fr[i]==-1) { fr[i]=page[j]; flag2=1; break; } } } if(flag2==0) { fr[top]=page[j];     top++; pf++; if(top>=frame_size) top=0; } display(); } printf("\n\nNumber of page faults : %d ",pf); } void display() { int i; printf("\n"); for(i=0;i<3;i++) printf("%d\t",fr[i]); }     2. SJF CPU SCHEDULING ALGORITHM #include<stdio.h> #include<conio.h> int fr[3];...