C:\Users\Atul\Desktop\pract.

c 10 December 2016 AM 02:57

#include<stdio.h>
void main()
{
int i,j,k,r,p,l,flagn=0,flag=0;
int alloc[10][10]={{0,0,1,2},{1,0,0,0},{1,3,5,4},{0,6,3,2},{0,0,
1,4}},
max[10][10]={{0,0,1,2},{1,7,5,0},{2,3,5,6},{0,6,5,2},{0,6,5,
6}},
avail[10]={1,5,2,0},need[10][10],finish[10]={0},safe[10],
work[10];

printf("\nEnter process :");

scanf("%d",&p);
printf("\nEnter Resource :");
scanf("%d",&r);
printf("\n-: ALLOCATION MATRIX :-\n");
for(i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
printf(" %d ",alloc[i][j]);
}
printf("\n");
}
printf("\n-: MAX MATRIX :-\n");
for(i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
printf(" %d ",max[i][j]);
}
printf("\n");
}
printf("\n-: AVAILABLE MATRIX :-\n");
for(i=0;i<r;i++)
{
printf(" %d ",avail[i]);
}
printf("\n");
printf("\n-: NEED MATRIX :-\n");
for(i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
need[i][j]=max[i][j] - alloc[i][j];
printf(" %d ",need[i][j]);
}
-1-
C:\Users\Atul\Desktop\pract.c 10 December 2016 AM 02:57

printf("\n");
}

for(i=0;i<r;i++) //WORK MATRIX

{
work[i]=avail[i];
}

printf("\n-: FINISH MATRIX :-\n");

for(i=0;i<p;i++)
{
printf(" %d ",finish[i]);
}printf("\n");
i=0;
k=0;//stores the count of safe sequesnce
while(1)
{
flag=0;

for(i=0;i<p;i++)
{
flagn=0;
if(finish[i] == 0)
{

for(j=0;j<r;j++)
{
if(need[i][j] > work[j])// if need is greater
set the flag
{
flagn=1;
}
}
if(flagn == 0)// if need is less than work
{
flag=1;
printf("\n need is less %d",i);
safe[k++]=i;
finish[i]=1;
printf("\n need is less %d,finish[%d]=%d",i,i,
finish[i]);
for(j=0;j<r;j++)
{
work[j]=work[j] + alloc[i][j];
}
}
}
-2-
C:\Users\Atul\Desktop\pract.c 10 December 2016 AM 02:57

}
if(flag == 0)
break;
}
printf("\nFinish\n");
for(j=0;j<p;j++)
{
printf(" %d ",finish[j]);
}
printf("\nSAFE SEQUENCE :- { ");
for(i=0;i<k-1;i++)
{
printf("P%d,",safe[i]);
}
printf("P%d }",safe[i]);
}

// java Program

import java.io.*;
import java.lang.*;
class numtest
{
int arr[]=new int[10];
int no,i,max=arr[0];
int min=arr[0];
float avg,sum=0;
BufferedReader br=new BufferedReader(new InputStreamReader(System.
in));
void acc()throws Exception
{
System.out.println("Enter 10 elements ");
for(i=0;i<10;i++)
{
arr[i]=Integer.parseInt(br.readLine());
}
}
void getsumavg()
{
for(i=0;i<10;i++)
{
sum=sum+arr[i];
}
//return sum;
System.out.println("Total sum :- "+sum);
avg=sum/10;
-3-
C:\Users\Atul\Desktop\pract.c 10 December 2016 AM 02:57

System.out.println("Average :- "+avg);
}
void maxmin()
{
for(i=0;i<10;i++)
{
if(arr[i]>max)
{
max=arr[i];
}
if(arr[i]<min)
{
min=arr[i];
}
}
System.out.println("Max no is "+max);
System.out.println("Min no is "+min);
}
void oddeven()
{
int cnt1=0,cnt2=0;
for(i=0;i<10;i++)
{
if(arr[i]%2==0)
cnt1++;
else
cnt2++;
}
System.out.println("Total Even no's are "+cnt1);
System.out.println("Total Odd no's are "+cnt2);
}
}
class slip11
{
public static void main(String args[])throws Exception
{
int total;
numtest nm=new numtest();
nm.acc();
nm.getsumavg();
nm.maxmin();
nm.oddeven();
}
}

-4-