TYBcs OS-Syspro Slip 2-2 | IProgramX

by - IProgram X on - January 25, 2019
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

typedef struct process_info
{
char pname[20];
int at,bt,ct,bt1;
struct process_info *next;
}NODE;

int n,ts;
NODE *first,*last;

void accept_info()
{
NODE *p;
int i;

printf("Enter no.of process:");
scanf("%d",&n);

for(i=0;i<n;i++)
{
p = (NODE*)malloc(sizeof(NODE));

printf("Enter process name:");
scanf("%s",p->pname);

printf("Enter arrival time:");
scanf("%d",&p->at);

printf("Enter first CPU burst time:");
scanf("%d",&p->bt);

p->bt1 = p->bt;

p->next = NULL;

if(first==NULL)
first=p;
else
last->next=p;

last = p;
}

printf("Enter time slice:");
scanf("%d",&ts);
}

void print_output()
{
NODE *p;
float avg_tat=0,avg_wt=0;

printf("pname\tat\tbt\tct\ttat\twt\n");

p = first;
while(p!=NULL)
{
int tat = p->ct-p->at;
int wt = tat-p->bt;

avg_tat+=tat;
avg_wt+=wt;

printf("%s\t%d\t%d\t%d\t%d\t%d\n",
p->pname,p->at,p->bt,p->ct,tat,wt);

p=p->next;
}

printf("Avg TAT=%f\tAvg WT=%f\n",
avg_tat/n,avg_wt/n);
}

void print_input()
{
NODE *p;

p = first;

printf("pname\tat\tbt\n");
while(p!=NULL)
{
printf("%s\t%d\t%d\n",
p->pname,p->at,p->bt1);
p = p->next;
}
}

void sort()
{
NODE *p,*q;
int t;
char name[20];

p = first;
while(p->next!=NULL)
{
q=p->next;
while(q!=NULL)
{
if(p->at > q->at)
{
strcpy(name,p->pname);
strcpy(p->pname,q->pname);
strcpy(q->pname,name);

t = p->at;
p->at = q->at;
q->at = t;

t = p->bt;
p->bt = q->bt;
q->bt = t;

t = p->ct;
p->ct = q->ct;
q->ct = t;

t = p->bt1;
p->bt1 = q->bt1;
q->bt1 = t;
}

q=q->next;
}

p=p->next;
}
}

int time;

int is_arrived()
{
NODE *p;

p = first;
while(p!=NULL)
{
if(p->at<=time && p->bt1!=0)
return 1;

p=p->next;
}

return 0;
}

NODE * delq()
{
NODE *t;

t = first;
first = first->next;
t->next=NULL;

return t;
}

void addq(NODE *t)
{
last->next = t;
last = t;
}

struct gantt_chart
{
int start;
char pname[30];
int end;
}s[100],s1[100];

int k;

void rr()
{
int prev=0,n1=0;
NODE *p;

while(n1!=n)
{
if(!is_arrived())
{
time++;
s[k].start = prev;
strcpy(s[k].pname,"*");
s[k].end = time;
k++;
prev=time;
}
else
{
p = first;
while(1)
{
if(p->at<=time && p->bt1!=0)
break;

p = delq();
addq(p);
p = first;
}

if(p->bt1<=ts)
{
time+=p->bt1;
p->bt1=0;
}
else
{
time+=ts;
p->bt1-=ts;
}

p->ct = time;

s[k].start = prev;
strcpy(s[k].pname,p->pname);
s[k].end = time;

k++;
prev = time;

if(p->bt1==0) n1++;

p = delq();
addq(p);
}

print_input();
}
}

void print_gantt_chart()
{
int i,j,m;

s1[0] = s[0];

for(i=1,j=0;i<k;i++)
{
if(strcmp(s[i].pname,s1[j].pname)==0)
s1[j].end = s[i].end;
else
s1[++j] = s[i];
}

printf("%d",s1[0].start);
for(i=0;i<=j;i++)
{
m = (s1[i].end - s1[i].start);

for(k=0;k<m/2;k++)
printf("-");

printf("%s",s1[i].pname);

for(k=0;k<(m+1)/2;k++)
printf("-");

printf("%d",s1[i].end);
}
}

int main()
{
accept_info();
sort();
rr();
print_output();
print_gantt_chart();

return 0;
}

Reactions

Post a Comment

2 Comments

  1. AnonymousDecember 30, 2022 at 12:58 PM

    process, which runs concurrently with the process that makes the fork() call (parent process). After a new child process is created, both processes will execute the next instruction following the fork() system call. A child process uses the same pc(program counter), same CPU registers, same open files which use in the parent process.
    It takes no parameters and returns an integer value. Below are different values returned by fork().
    Negative Value: creation of a child process was unsuccessful.
    Zero: Returned to the newly created child process.
    Positive value: Returned to parent or caller. The value contains process ID of newly created child process.
    #include
    #include
    #include
    void forkexample()
    {
        // child process because return value zero
        if (fork() == 0)
            printf("Hello from Child!\n");
      
        // parent process because return value non-zero.
        else
            printf("Hello from Parent!\n");
    }
    int main()
    {
        forkexample();
        return 0;
    }
    Output:
    1.
    Hello from Child!
    Hello from Parent!
    (or)
    2.
    Hello from Parent!
    Hello from Child!

    ReplyDelete
  2. AnonymousDecember 30, 2022 at 12:59 PM

    Implement the C Program to create a child process using fork(), display parent and child process id. Child process will display the message “I am Child Process” and the parent process should display “I am Parent Process” | Write a program that demonstrates the use of nice() system call. After a child process is started using fork(), assign higher priority to the child using nice() system call

    #include
    #include
    #include

    int main()
    {
    // fork() Create a child process

    int pid = fork();
    if (pid > 0) {
    printf("I am Parent process\n");
    printf("ID : %d\n\n", getpid());
    }
    else if (pid == 0) {
    printf("I am Child process\n");
    // getpid() will return process id of child process
    printf("ID: %d\n", getpid());

    }
    else {
    printf("Failed to create child process");
    }

    return 0;
    }

    Output :

    @kali-linux:~/Desktop/Ty$ ./a.out
    I am Parent process
    ID : 3698

    I am Child process
    ID: 3699

    ReplyDelete