Code2earn

1.Write a C program to implement First-Come-First-Serve Algorithm. #include<stdio.h> #include<conio.h> void main() { clrscr(); int pr,i,t=0,avg=0; printf("Enter The Number Of Process\n"); scanf("%d",&pr); char p[10]; int brst[10],Wt[10]; brst[0]=0;Wt[0]=0; for(i=0;i<pr;i++) { printf("Enter The Name Of The Process\n"); scanf("%s",&p[i]); printf("Enter The Burst Time Of The Process\n"); scanf("%d",&brst[i]); } t=Wt[0]; for(i=1;i<pr;i++) { Wt[i]=Wt[i-1]+brst[i-1]; t=t+Wt[i]; } printf("\nProcess\tBurst Time\tWaiting Time\n"); for(i=0;i<pr;i++) { printf("p%d\t%d\t\t%d\t\n",i+1,brst[i],Wt[i]); } avg=t/pr; printf("Total Waiting Time Is=%d\n",t); printf("Average Waiting Time Is=%d\n",avg); getch(); }   Program 2 Write a C program to implement non pre-emptive SJF scheduling algorithm. #include<stdio.h> #include<conio.h> void main()                   ...