-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlab22.c
120 lines (92 loc) · 1.87 KB
/
lab22.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <stdio.h>
#include <sys/types.h>
#include <unistd.h>
void main()
{
int n;
printf("enter the arr size:");
scanf("%d",&n);
int a[n];
int i;
for(i=0;i<n;++i)
{
scanf("%d",&a[i]);
}
pid_t p1=fork();
waitpid(p1,0,0);
if(p1==0)
{
pid_t p2=fork();
waitpid(p2,0,0);
if(p2==0)
{
pid_t p3=fork();
waitpid(p3,0,0);
if(p3==0)
{
int c=0,k;
for(k=0;k<n;++k)
{
if(a[k]%2==0)
c++;
}
printf("pid:%d-> no.of even nos:%d\n",getpid(),c);
}
else
{
int b[20],t=0;
int k;
for(k=0;k<n;++k)
{
if(a[k]%2==0)
{
b[t]=a[k];
t++;
}
}
printf("pid:%d-> ",getpid());
for(k=0;k<t;++k)
a[k]=b[k];
for(k=t;k<n;++k)
a[k]=0;
for(k=0;k<t;++k)
printf("%d ",a[k]);
printf("\n");
}
}
else
{
int m;
m=a[0];
int p;
for(p=1;p<n;++p)
{
if(a[p]>m)
m=a[p];
}
printf("pid:%d-> max:%d \n",getpid(),m);
}
}
else
{
int u,v;
for(u=0;u<n-1;++u)
{
for(v=u+1;v<n;++v)
{
if(a[v]<a[u])
{
int t=a[v];
a[v]=a[u];
a[u]=t;
}
}
}
printf("pid:%d-> ",getpid());
for(u=0;u<n;++u)
{
printf("%d ",a[u]);
}
printf("\n");
}
}