osslip21

Q1
#include <stdio.h>
#include <unistd.h>

int main() {
pid_t pid;

// Fork a child process
pid = fork();

if (pid < 0) {
    // Error handling
    fprintf(stderr, "Fork failed\n");
    return 1;
} else if (pid == 0) {
    // Child process
    printf("I am Child Process. My PID is %d\n", getpid());
} else {
    // Parent process
    printf("I am Parent Process. My PID is %d\n", getpid());
}

return 0;

}

/*Write the program to simulate Non preemptive priority scheduling. The
arrival time and first CPU-burst of different jobs should be input to the
system. Accept no. of Processes, arrival time and burst time. The output
should give Gantt chart, turnaround time and waiting time for each process.
Also find the average waiting time and turnaround time.
*/

#include<stdio.h>
#include<stdlib.h>
#define MAX 10

typedef struct PROCESS
{
char name[20] ;
int at,bt,ct,tat,wt,tbt,priority ;
}PROCESS ;

PROCESS p[MAX] ;
int time=0,processCount;
float totaltat,totalwt,avgtat,avgwt ;

void sort()
{
PROCESS p1 ;
int i,j;
for(i=0;i<processCount;i++)
{
for(j=i+1;j<processCount;j++)
{
if(p[j].at < p[i].at)
{
p1 = p[i] ;
p[i] = p[j] ;
p[j] = p1 ;
}
}
}
}

void readProcess()
{
int i ;
printf("\nEnter the number of processes: ") ;
scanf("%d",&processCount) ;
for(i=0;i<processCount;i++)
{
printf("\nEnter the process name: ") ;
scanf("%s",p[i].name) ;
printf("Enter the CPU Burst time: ") ;
scanf("%d",&p[i].bt) ;
printf("Enter the Arrival time: ") ;
scanf("%d",&p[i].at) ;
p[i].tbt = p[i].bt ;//extra line from fcfs
printf("Enter priority: ");
scanf("%d",&p[i].priority);
}
sort() ;
}

int getProcess()
{
int i , priority = 999 , p1 ;
for(i=0;i<processCount;i++)
{
if(p[i].at <= time && p[i].tbt!=0)
{
if(p[i].priority < priority)
{
priority = p[i].priority ;
p1 = i ;
}
}
}
return p1 ;
}

void scheduleProcess()
{
int i,count = 0 ;
printf("\n\n GanttChart:\n") ;
printf("________________________________________________\n") ;
printf("|%d ",time) ;
while(1)
{
i = getProcess() ; //extra line from fcfs
p[i].wt = time - p[i].at ;//currenttime-arrival time
time = time + p[i].bt ;
p[i].tbt = 0 ; //extra line from fcfs
p[i].ct = time ;
//p[i].tat=p[i].bt+p[i].wt;//workingtime+waiting time
p[i].tat = p[i].ct - p[i].at; //finishtime-arrival time

   totaltat+=p[i].tat ;
   totalwt+=p[i].wt ;
   count++ ;
   printf("%s  ",p[i].name) ;
   printf("%d|%d   ",time,time) ;
   if(count==processCount)
		break ;
  }

printf("\n________________________________________________\n") ;
avgtat = totaltat / processCount ;
avgwt = totalwt / processCount ;
}

void display()
{
int i;
printf("\n--------------------------------------------------------------------------------\n") ;
printf("Process ArrivalTime BurstTime CPUTime TurnAroundtime WaitTime\n");
printf("--------------------------------------------------------------------------------\n");
for(i=0 ; i<processCount ; i++)
printf("%s\t %d\t\t%d\t %d\t %d\t\t %d\n",p[i].name,p[i].at,p[i].bt,p[i].ct,p[i].tat,p[i].wt) ;
printf("--------------------------------------------------------------------------------") ;
printf("\n\nTotal Turn Around Time: %f",totaltat) ;
printf("\nTotal Wait Time: %f",totalwt) ;
printf("\n\nAverage Turn Around Time: %f",avgtat) ;
printf("\nAverage Wait Time: %f\n",avgwt) ;
}

int main()
{
//clrscr();
readProcess();
scheduleProcess();
display();
//getch();
return 0;
}