Scribd
Upload
48 views5 pages

Os Program 2)

Uploaded by

Komal Rathod
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
48 views5 pages

Os Program 2)

Uploaded by

Komal Rathod
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 5

OS PROGRAM 2)

#include<stdio.h>
#include<string.h>

int n,m,i,j,k,flag,safe;
int a[50][50],av[15],max[50][50],finish[10],need[50][50],req[10];
char s[50],str[5];

void get_data()
{
printf("\nEnter number of processes : ");
scanf("%d",&n);
printf("\nEnter number of resources : ");
scanf("%d",&m);
printf("\nEnter allocation matrix : \n");
for (i=0;i<n;i++)
{
for (j=0;j<m;j++)
{
scanf("%d",&a[i][j]);
}
}
printf("\nEnter MAX matrix : \n");
for (i=0;i<n;i++)
{
for (j=0;j<m;j++)
{
scanf("%d",&max[i][j]);
}
}

printf("\nEnter Available Array : \n");


for (i=0;i<m;i++)
scanf("%d",&av[i]);
for (i=0;i<n;i++)
finish[i]=0;
}

void put_data()
{
printf("\n\nAllocation matrix is : \n");
for (i=0;i<n;i++)
{
for (j=0;j<m;j++)
{
printf("%d\t",a[i][j]);
}
printf("\n");
}
printf("\n\nMax Matrix is : \n");
for (i=0;i<n;i++)
{
for (j=0;j<m;j++)
{
printf("%d\t",max[i][j]);
}
printf("\n");
}
printf("\n\nAvailable Array is : \n");
for (i=0;i<m;i++)
printf("%d\t",av[i]);

void calc_need()
{
for (i=0;i<n;i++)
{
for (j=0;j<m;j++)
{
need[i][j] = max[i][j] - a[i][j];
}
}
printf("\n\nNeed Array is : \n");
for (i=0;i<n;i++)
{
for (j=0;j<m;j++)
{
printf("%d\t",need[i][j]);
}
printf("\n");
}
}

int check_need(int i)
{
flag=0;
for (j=0;j<m;j++)
{
if (need[i][j]>av[j])
{
flag = 1;
break;
}
}
return flag;
}

void safe_state()
{
printf("\n\n");
for (i=0;i<n;i++)
finish[i]=0;
strcpy (s,"\0");
for (i=0;i<n;i++)
{
if (check_need(i)==0)
{
for (k=0;k<m;k++)
av[k]=av[k]+a[i][k];
sprintf(str,"%d",i);
strcat(s,"P");
strcat(s,str);
strcat(s," ");
puts(s);
}
else
finish[i]=1;
}
}

void res_req()
{
safe = 0;
printf("Enter the process number : ");
scanf("%d",&i);
printf("\nEnter the request : ");
for (k=0;k<m;k++)
scanf("%d",&req[k]);
printf("\nEnter available array : ");
for (j=0;j<m;j++)
scanf("%d",&av[j]);
for (k=0;k<m;k++)
{
if (req[k]>need[i][k] || req[k]>av[k])
{
safe = 1;
break;
}
}

if (safe == 0)
{
for (k=0;k<m;k++)
{
av[k] = av[k] - req[k];
a[i][k] = a[i][k] + req[k];
need[i][k] = need[i][k] - req[k];
}
printf("\nNeed array is : \n");
for (i=0;i<n;i++)
{
for (j=0;j<m;j++)
{
printf("%d\t",need[i][j]);
}
printf("\n");
}
put_data();
printf("The request can be granted.....\n");
}
else
printf("\nThe request can not be granted....\n");
}

void main()
{
int p,f;
f=0;
get_data();
put_data();
calc_need();
safe_state();

for (k=0;k<m;k++)
{
if (finish[k]==1)
{
if (check_need(k)==0)
{
for (p=0;p<m;p++)
av[p] = av[p] + a[k][p];
sprintf(str,"%d",k);
strcat(s,"P");
strcat(s,str);
strcat(s," ");
finish[k]=0;
}
f=1;
else
}
}
if (f==0)
{
printf("System is in safe state.....\n");
printf("\nSafe Sequence\n");
puts(s);
}
else
printf("System is not in safe state\n");
res_req();
}

/*
Output:

ty28@pc56:~/TY28/SEM-6/OS-2/ASSIGNEMENT_01$ cc slot2.c
ty28@pc56:~/TY28/SEM-6/OS-2/ASSIGNEMENT_01$ ./a.out

Enter number of processes : 5

Enter number of resources : 4

Enter allocation matrix :


0 0 1 2
1 0 0 0
1 3 5 4
0 6 3 2
0 0 1 4

Enter MAX matrix :


0 0 1 2
1 7 5 0
2 3 5 6
0 6 5 2
0 6 5 6

Enter Available Array :


1 5 2 0

Allocation matrix is :
0 0 1 2
1 0 0 0
1 3 5 4
0 6 3 2
0 0 1 4

Max Matrix is :
0 0 1 2
1 7 5 0
2 3 5 6
0 6 5 2
0 6 5 6

Available Array is :
1 5 2 0

Need Array is :
0 0 0 0
0 7 5 0
1 0 0 2
0 0 2 0
0 6 4 2

P0
P0 P2
P0 P2 P3
P0 P2 P3 P4
System is in safe state.....

Safe Sequence
P0 P2 P3 P4 P1
Enter the process number :

*/

You might also like