Posts

Showing posts from September, 2016

FIRST COME FIRST SERVE PROGRAM USING C

#include<stdio.h> void swap(int *arr,int i,int j) { int temp=arr[i]; arr[i]=arr[j]; arr[j]=temp; } void sort(int at[],int bt[],int n) { int i,j; for(i=0;i<n-1;i++) { for(j=0;j<n-i-1;j++) { if(at[j]>at[j+1]) { swap(at,j,j+1); swap(bt,j,j+1); } } } } void main() { int n; int i; int at[10],bt[10],ct[10],tat[10],wt[10]; printf("enter number of process : "); scanf("%d",&n); for(i=0;i<n;i++) { printf("enter at and bt of process [%d]: ",i+1); scanf("%d %d",&at[i],&bt[i]); } sort(at,bt,n); for(i=0;i<n;i++) { if(i==0) { ct[i]=at[i]+bt[i]; tat[i]=ct[i]-at[i]; wt[i]=tat[i]-bt[i]; } else { if(ct[i-1]<at[i]) { ct[i]=at[i]+bt[i]; } else { ct[i]=ct[i-1]+bt[i]; } tat[i]=ct[i]-at[i]; wt[i]=tat[i]-bt[i]; } } printf("ct tat wt\n"); for(i=0;i<n;i++) { printf("%d %d %d\n",ct[i],tat[i

Non Preemptive sortest job first CPU scheduling algorithm program using C

#include<stdio.h> struct pr {    char name[10];    int arr_time;    int burst_time;    int com_time;    int tat_time;    int wt_time;     int flag; }; int main() { struct pr p[10],temp; int n,i,t=0,j,tat=0,wt=0,compt=0,temp1; printf("\n how many process \t"); scanf("%d",&n); for(i=0;i<n;i++) { printf("\n enter process_name arrival_time and burst_time for process  "); scanf("%s",&p[i].name); scanf("%d",&p[i].arr_time); scanf("%d",&p[i].burst_time); } for(i=0;i<n;i++) { printf("\n process name %s: arrival=%d burst=%d",p[i].name,p[i].arr_time,p[i].burst_time);       } printf("\n"); for(i=0;i<n;i++) {      temp1=p[i].arr_time; for(j=i+1;j<n;j++) {           if(p[j].arr_time<=compt&&p[j].burst_time<p[i].burst_time)  {      temp=p[i]; p[i]=p[j];