moguljak/r305_dm
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Ajout exo 5 TP3

Browse Source
This commit is contained in:
Tom MOGULJAK 2023-09-28 23:10:20 +02:00
parent 13c0155c74
commit 7376474b67
3 changed files with 188 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

57
TP3/Exo5/exo5_1.c Normal file
View File

@ -0,0 +1,57 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <math.h>
#define SIZE 1000
int search(const unsigned char *t, int start, int end)
{
pid_t p;
int i, status, moitie = ceil((start + end) / 2);
p = fork();
switch (p)
{
case -1:
exit(1);
case 0:
for (i = 0; i < moitie; i++)
{
if (t[i] == 0)
exit(1);
}
exit(0);
default:
for (i = moitie; i <= end; i++)
{
if (t[i] == 0)
return 1;
}
wait(&status);
return WEXITSTATUS(status);
}
}
int main(int argc, char *argv[])
{
int i;
unsigned char arr[SIZE];
srandom(time(NULL));
for (i = 0; i < SIZE; i++)
arr[i] = (unsigned char)(random() % 255) + 1;
printf("Enter a number between 0 and %d: ", SIZE);
scanf(" %d", &i);
if (i >= 0 && i < SIZE)
arr[i] = 0;
if (search(arr, 0, SIZE - 1))
printf("Found !\n");
else
printf("Not found !\n");
return EXIT_SUCCES;
}

63
TP3/Exo5/exo5_2.c Normal file
View File

@ -0,0 +1,63 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <math.h>
#define SIZE 1000
int search(const unsigned char *t, int start, int end, int n)
{
pid_t p;
int i, proc, res = 0, status, partition = ceil((start + end) / n);
for (proc = 1; proc <= n, proc++)
{
p = fork();
if (p == 0)
{
for (i = 0 + partition * proc; i < partition * (proc + 1); i++)
{
if (t[i] == 0)
exit(1);
}
exit(0);
}
}
for (i = 0; i < n; i++)
{
wait(&status);
if (WEXITSTATUS(status))
res = 1;
}
return res;
}
int main(int argc, char *argv[])
{
int i, n;
unsigned char arr[SIZE];
if (argc != 2)
{
printf("Usage: %s <number of children is between 1 and 100>\n", argv[0]);
return EXIT_FAILURE;
}
n = (int)strtod(argv[1], NULL);
srandom(time(NULL));
for (i = 0; i < SIZE; i++)
arr[i] = (unsigned char)(random() % 255) + 1;
printf("Enter a number between 0 and %d: ", SIZE);
scanf(" %d", &i);
if (i >= 0 && i < SIZE)
arr[i] = 0;
if (search(arr, 0, SIZE - 1, n))
printf("Found !\n");
else
printf("Not found !\n");
return EXIT_SUCCESS;
}

68
TP3/Exo5/exo5_3.c Normal file
View File

@ -0,0 +1,68 @@
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <unistd.h>
#include <math.h>
#define SIZE 1000
int search(const unsigned char *t, int start, int end, int n)
{
pid_t p;
int i, proc, res = 0, status, partition = ceil((start + end) / n);
for (proc = 1; proc <= n; proc++)
{
p = fork();
if (p == 0)
{
for (i = 0 + partition * proc; i < partition * (proc + 1); i++)
{
if (t[i] == 0)
{
exit(1);
kill(0, SIGTERM);
}
}
exit(0);
}
}
for (i = 0; i < n; i++)
{
wait(&status);
if (WEXITSTATUS(status))
res = 1;
}
return res;
}
int main(int argc, char *argv[])
{
int i, n;
unsigned char arr[SIZE];
if (argc != 2)
{
printf("Usage: %s <number of children is between 1 and 100>\n", argv[0]);
return EXIT_FAILURE;
}
n = (int)strtod(argv[1], NULL);
srandom(time(NULL));
for (i = 0; i < SIZE; i++)
arr[i] = (unsigned char)(random() % 255) + 1;
printf("Enter a number between 0 and %d: ", SIZE);
scanf(" %d", &i);
if (i >= 0 && i < SIZE)
arr[i] = 0;
if (search(arr, 0, SIZE - 1, n))
printf("Found !\n");
else
printf("Not found !\n");
return EXIT_SUCCESS;
}