Pappula Sarala

  Cycle-2: simulate the following CPU scheduling algorithms ------------------------------------------------------------------------   a)    write a C program for simulating the FCFS (First Come First Serve) CPU scheduling algorithm         Aim: To write a C program for simulating FCFS (first come first serve) CPU Scheduling Algorithm Program: #include<stdio.h> #include<conio.h>  void main() { int arrival[10],burst[10],start[10],finish[10],wait[10],turn[10]; int i,j,n,sum=0; float totalwait=0.0,totalturn=0.0; float avgwait=0.0,avgturn=0.0; start[0]=0; printf("Enter number of Process:"); scanf("%d",&n); for(i=0;i<n;i++) { printf("\n Enter process %d Arrival and Burst time \n",(i+1)); scanf("%d %d",&arrival[i],&burst[i]); } for(i=0;i<n;i++) { sum=0; for(j=0;j<i;j++) { sum=sum+burst[j]; } start[i]=sum; }   for(i=0;i<n;i++) { f...

  List of programs Cycle-1: Execute various UNIX system calls 1. Process Management 2. File Management 3. Input/Output System Calls   Cycle-2: Simulate the following CPU scheduling algorithms. a) FCFS     b) SJF     c) Round Robin     d) Priority.   Cycle-3: Simulate the file allocation strategies: a)     Sequential   b) indexed   c)   Linked   Cycle-4: Simulate MVT and MFT simulate contiguous memory allocation techniques a)     Worst-fit b) Best fit c) First fit   Cycle-5: Simulate all File Organization techniques A) Single level directory b) Two level c)Hierarchical d)DAG             Cycle-6:         Simulate Bankers Algorithm for Deadlock Avoidance            Simulate Bankers algorithm f...