diff --git a/Headers_Fcts/dlistHeader.h b/Headers_Fcts/dlistHeader.h
new file mode 100644
index 0000000..3a1dd4a
--- /dev/null
+++ b/Headers_Fcts/dlistHeader.h
@@ -0,0 +1,33 @@
+#ifndef HEADER
+#define HEADER
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+struct celluleDouble
+{
+    int element;
+    struct celluleDouble * suivant;
+    struct celluleDouble * precedent;
+};
+typedef struct celluleDouble celluleDouble;
+
+struct listeDouble
+{
+    celluleDouble * debut;
+    celluleDouble * fin;
+    unsigned longueur;
+};
+typedef struct listeDouble listeDouble;
+
+
+#endif
+
+int listeDoubleVide(listeDouble);
+void affichageListeDouble(listeDouble);
+void ajoutDebut(int, listeDouble *);
+void ajoutFin(int,listeDouble *);
+void suppressionDebut(listeDouble *);
+void suppressionFin(listeDouble *);
+void libererListeDouble(listeDouble);
diff --git a/Headers_Fcts/dlistHeader.h.gch b/Headers_Fcts/dlistHeader.h.gch
new file mode 100644
index 0000000..76019ab
Binary files /dev/null and b/Headers_Fcts/dlistHeader.h.gch differ
diff --git a/Headers_Fcts/dlistfcts.c b/Headers_Fcts/dlistfcts.c
new file mode 100644
index 0000000..19510fa
--- /dev/null
+++ b/Headers_Fcts/dlistfcts.c
@@ -0,0 +1,118 @@
+#include "dlistHeader.h"
+
+
+int listeDoubleVide(listeDouble L)
+{
+    if(L.debut==NULL)
+        return 1;
+    return 0;
+}
+
+
+void affichageListeDouble(listeDouble L)
+{
+    if(listeDoubleVide(L)==1)
+    {
+        printf("[]\n");
+        return;
+    }
+    celluleDouble *temp=L.debut;
+    printf("[");
+    while(temp->suivant!=NULL)
+    {
+        printf("%d, ",temp->element);
+        temp=temp->suivant;
+    }
+    if(temp!=NULL)
+        printf("%d",temp->element);
+    printf("]\n");
+}
+
+
+
+void ajoutDebut(int x,listeDouble * L)
+{
+    celluleDouble * C=(celluleDouble *)malloc(sizeof(celluleDouble));
+    C->element=x;
+    C->suivant=L->debut;
+    C->precedent=NULL;
+    
+    if(listeDoubleVide(*L)==1)
+    {
+        L->debut=C;
+        L->fin=C;
+        L->longueur=1;
+        return;
+    }
+    L->debut->precedent=C;
+    L->debut=C;
+    L->longueur+=1;
+    return;
+}
+
+
+void ajoutFin(int x,listeDouble *L)
+{
+    celluleDouble * C=(celluleDouble *)malloc(sizeof(celluleDouble));
+    C->element=x;
+    C->precedent=L->fin;
+    C->suivant=NULL;
+    
+    if(listeDoubleVide(*L)==1)
+    {
+        ajoutDebut(x,L);
+        return;
+    }
+    L->fin->suivant=C;
+    L->fin=C;
+    L->longueur+=1;
+    return;
+}
+
+void suppressionDebut(listeDouble * L)
+{
+    if(listeDoubleVide(*L)==1)
+        return;
+    if(L->longueur==1)
+    {
+        L->longueur=0;
+        if(L->debut!=NULL)
+            free(L->debut);
+        L->debut=NULL;
+        return;
+    }
+    celluleDouble * temp=L->debut;
+    L->debut=L->debut->suivant;
+    L->longueur-=1;
+    free(temp);
+    return;
+}
+
+
+void suppressionFin(listeDouble * L)
+{
+    if(listeDoubleVide(*L)==1)
+        return;
+    if(L->longueur==1)
+    {
+        suppressionDebut(L);
+        return;
+    }
+    celluleDouble * temp=L->fin;
+    L->fin=L->fin->precedent;
+    L->fin->suivant=NULL;
+    L->longueur-=1;
+    free(temp);
+    return;
+}
+
+
+void libererListeDouble(listeDouble L)
+{
+    while(L.debut!=NULL)
+    {
+        celluleDouble * temp=L.debut;
+        L.debut=L.debut->suivant;
+        free(temp);
+    }
+}
diff --git a/Headers_Fcts/listHeader.h b/Headers_Fcts/listHeader.h
new file mode 100644
index 0000000..2464def
--- /dev/null
+++ b/Headers_Fcts/listHeader.h
@@ -0,0 +1,26 @@
+#ifndef HEADER
+#define HEADER
+
+#include<stdio.h>
+#include<stdlib.h>
+//#include "liste_simple.h"
+
+struct cellule
+{
+    int element;
+    struct cellule * suivant;
+
+};
+typedef struct cellule cellule;
+typedef struct cellule * liste;
+
+#endif
+
+int testVide(liste);
+unsigned longueur(liste);
+void affichageListe(liste);
+void ajoutDebut(int,liste *);
+void ajoutFin(int,liste *);
+void suppressionDebut(liste *);
+void suppressionFin(liste *);
+void liberer(liste);
diff --git a/Headers_Fcts/listfcts.c b/Headers_Fcts/listfcts.c
new file mode 100644
index 0000000..885379e
--- /dev/null
+++ b/Headers_Fcts/listfcts.c
@@ -0,0 +1,116 @@
+#include "listHeader.h"
+
+
+int testVide(liste L)
+{
+    if(L==NULL)
+        return 1;
+    return 0;
+}
+
+unsigned longueur(liste L)
+{
+    unsigned l=0;
+    if(testVide(L)==0)
+    {
+        liste temp=L;
+        while(temp!=NULL)
+        {
+            l+=1;
+            temp=temp->suivant;
+        }
+    }
+    return l;
+}
+
+void affichageListe(liste L)
+{
+    if(L==NULL)
+        printf("[ ]");
+    else
+    {
+        printf("[");
+        liste temp=L;
+        while(temp->suivant!=NULL)
+        {
+            printf("%d, ",temp->element);
+            temp=temp->suivant;
+        }
+        if(temp!=NULL)
+            printf("%d",temp->element);
+        printf("]\n");
+    }
+}
+
+void ajoutDebut(int x,liste * L)
+{
+    cellule * C=(cellule *)malloc(sizeof(cellule));
+    C->element=x;
+    C->suivant=*L;
+    *L=C;
+    return;
+}
+
+void ajoutFin(int x,liste * L)
+{
+    liste C=(liste)malloc(sizeof(cellule));
+    C->element=x;
+    C->suivant=NULL;
+    if(*L==NULL)
+        *L=C;
+    else
+    {
+        liste temp=*L;
+        while(temp->suivant!=NULL)
+            temp=temp->suivant;
+        temp->suivant=C;
+    }
+    return;
+}
+
+void suppressionDebut(liste * L)
+{
+    if(L!=NULL)
+    {
+        liste temp=*L;
+        *L=(*L)->suivant;
+        free(temp);
+    }
+    return;
+}
+
+void suppressionFin(liste * L)
+{
+    if(L==NULL)
+    {
+        return;
+    }
+    if((*L)->suivant==NULL)
+    {
+        free(*L);
+        *L=NULL;
+    }
+    else
+    {
+        liste temp=*L;
+        liste temp_1=*L;
+        while(temp->suivant!=NULL)
+        {
+            temp_1=temp;
+            temp=temp->suivant;
+        }
+        temp_1->suivant=NULL;
+        free(temp);
+    }
+    return;
+}
+
+void liberer(liste L)
+{
+    while(L!=NULL)
+    {
+        liste temp=L;
+        L=L->suivant;
+        free(temp);
+    }
+}
diff --git a/TP1/EX1/iterative_fibo.c b/TP1/EX1/iterative_fibo.c
index 348f646..79ad64c 100644
--- a/TP1/EX1/iterative_fibo.c
+++ b/TP1/EX1/iterative_fibo.c
@@ -2,5 +2,11 @@
 
 int iterative_fibo(int n)
 {
-    // write your iterative_fibo code here
+    int f1=0,f2=1,s=0;
+        for(int i=1;i<n;i++){
+            s=f1+f2;
+            f1=f2;
+            f2=s;
+        }
+    return s;
 }
diff --git a/TP1/EX1/recursive_fibo.c b/TP1/EX1/recursive_fibo.c
index a8f01b1..2ac785f 100644
--- a/TP1/EX1/recursive_fibo.c
+++ b/TP1/EX1/recursive_fibo.c
@@ -2,5 +2,7 @@
 
 int recursive_fibo(int n)
 {
-    // write your recursive fibo code here
+    if(n<=1)
+        return n;
+    return recursive_fibo(n-1)+recursive_fibo(n-2);
 }
diff --git a/TP1/EX2/get_third_largest.c b/TP1/EX2/get_third_largest.c
index ebada8c..574b763 100644
--- a/TP1/EX2/get_third_largest.c
+++ b/TP1/EX2/get_third_largest.c
@@ -7,5 +7,20 @@
 */
 int     get_third_largest(int *tab, int size)
 {
-        // write your algo here
+    int p=0,q=0,r=0;
+    for(int i=0;i<size;i++){
+        if (tab[i]>p){
+            r=q;
+            q=p;
+            p=tab[i];
+        }
+        if (tab[i]>q && tab[i]<p){
+            r=q;
+            q=tab[i];
+        }
+        if (tab[i]>r && tab[i]<q){
+            r=tab[i];
+        }
+    }
+    return r;
 }
diff --git a/TP1/EX2/header.h b/TP1/EX2/header.h
index bd7686a..dedaf48 100644
--- a/TP1/EX2/header.h
+++ b/TP1/EX2/header.h
@@ -13,6 +13,7 @@
 
 #include <stdio.h>
 #include <stdlib.h> // for rand and srand functions
+#include <time.h>
 
 void    print_table(int *tab, int size);
 void    rand_fill_table(int *tab, int size);
diff --git a/TP1/EX2/print_table.c b/TP1/EX2/print_table.c
index 3700f0a..73390c0 100644
--- a/TP1/EX2/print_table.c
+++ b/TP1/EX2/print_table.c
@@ -5,5 +5,10 @@
 */
 void    print_table(int *tab, int size)
 {
-    // iterate the array tab and print its elements
+    printf("Here is the array:\n");
+    for ( int i = 0; i < size; i++)
+    {
+        printf("%d ",tab[i]);
+    }
+    return ;
 }
diff --git a/TP1/EX2/rand_fill_table.c b/TP1/EX2/rand_fill_table.c
index 873f5fe..7687405 100644
--- a/TP1/EX2/rand_fill_table.c
+++ b/TP1/EX2/rand_fill_table.c
@@ -8,5 +8,9 @@
 */
 void rand_fill_table(int *tab, int size)
 {
-    // fill up your table here with randome elements between 10 and 100
+    srand(time(0));
+    for(int i=0;i<size;i++){
+        tab[i]=rand();
+    }
+    return ;
 }
diff --git a/TP1/EX3/primes.c b/TP1/EX3/primes.c
index 8d02f3b..9298349 100644
--- a/TP1/EX3/primes.c
+++ b/TP1/EX3/primes.c
@@ -6,14 +6,30 @@
 // A function can be declared as static function by placing the static keyword
 // before the function name
 
-static bool    is_prime(int n)
+static bool is_prime(int n)
 {
-    // write is_prime function code here
-}
+    if (n==2)
+    {
+        return 1;
+    }
 
+    for (int i = 2; i < n; i++)
+    {
+        if(n%i==0){
+            return 0;
+        }
+    }
+    return 1;
+}
 
 void    get_primes(int n)
 {
-    // write get_primes function code here that use is_prime function
+    for (int i = 2; i < n; i++)
+    {
+        if(is_prime(i)==1){
+            printf("%d\n",i);
+        }
+    }
+    return;
 }
 
diff --git a/TP1/EX3/primes_opt.c b/TP1/EX3/primes_opt.c
index 542b004..c4ebf33 100644
--- a/TP1/EX3/primes_opt.c
+++ b/TP1/EX3/primes_opt.c
@@ -8,11 +8,26 @@
 
 static bool    is_prime_opt(int n)
 {
-    // write is_prime function code here
+    int i=2;
+    while (i<=sqrt((double)n))
+    {
+        if(n%i==0){
+            return false;
+        }
+        i++;
+        
+    }
+    return true;
 }
 
 
 void    get_primes_opt(int n)
 {
-    // write get_primes_opt function code here that use is_prime_opt function
+    for (int i = 2; i < n; i++)
+    {
+        if(is_prime_opt(i)==true){
+            printf("%d\n",i);
+        }
+    }
+    return;
 }
diff --git a/TP2/Ex1/Fcts.c b/TP2/Ex1/Fcts.c
new file mode 100644
index 0000000..8e8fa2a
--- /dev/null
+++ b/TP2/Ex1/Fcts.c
@@ -0,0 +1,81 @@
+#include "header.h"
+
+
+
+void input(t_point * T){
+    scanf("%d %d",&T->base,&T->height);
+    return ;
+}
+
+void output(t_point T){
+    printf("( %d , %d )\n",T.base,T.height);
+    return ;
+}
+
+char** array(t_point T)
+{
+    char** arr = malloc(T.base*sizeof(char*));
+    for (int i=0; i<T.base; i++)
+    {
+        arr[i] = malloc(T.height* sizeof(char)) ;
+    }
+    return arr;
+}
+
+char** array_input(t_point T,char ** p){
+    for (int i = 0; i < T.base; i++)
+    {
+        for (int j = 0; j < T.height; j++)
+        {
+            scanf(" %c",&p[i][j]);
+        }
+        
+    }
+    return p;
+}
+
+void array_output(t_point T,char** p){
+	for (int i = 0; i < T.base; i++)
+	{
+        	for (int j = 0; j < T.height; j++)
+        	{
+            		printf("%c ",p[i][j]);
+        	}
+        	printf("\n");
+        
+	}
+}
+
+t_point get_position(){
+    t_point T;
+    input(&T);
+    return T;
+}
+
+
+void flood_fill(char** p,t_point T,t_point D,char c, char d){
+    if(T.base<0 || T.base>=D.base || T.height<0 || T.height>=D.height)
+        return;
+    if(p[T.base][T.height]==c){
+        p[T.base][T.height]=d;
+        flood_fill(p , (t_point){T.base+1,T.height} , D, c , d);
+        flood_fill(p , (t_point){T.base-1,T.height} , D, c , d);
+        flood_fill(p , (t_point){T.base,T.height+1} , D, c , d);
+        flood_fill(p , (t_point){T.base,T.height-1} , D, c , d);
+        
+    }
+}
+
+
+
+
+
+void free_array(t_point T,char** arr)
+{
+    for (int i=0; i<T.base; i++)
+    {
+        free(arr[i]);
+    };
+    free(arr);
+    return ;
+}
diff --git a/TP2/Ex1/Makefile b/TP2/Ex1/Makefile
new file mode 100644
index 0000000..dd0a235
--- /dev/null
+++ b/TP2/Ex1/Makefile
@@ -0,0 +1,9 @@
+SRC = main.c Fcts.c
+PRO_NAME = prog
+
+all:
+
+	gcc $(SRC) -o $(PRO_NAME)
+	./prog
+	rm prog
+
diff --git a/TP2/Ex1/header.h b/TP2/Ex1/header.h
new file mode 100644
index 0000000..fdc654c
--- /dev/null
+++ b/TP2/Ex1/header.h
@@ -0,0 +1,24 @@
+#ifndef HEADER
+#define HEADER
+
+#include <stdio.h>
+#include <stdlib.h>
+
+struct t_point
+{
+    int base;
+    int height;
+};
+typedef struct t_point t_point;
+
+
+void input(t_point*);
+void output(t_point);
+char ** array(t_point);
+void free_array(t_point,char**);
+char** array_input(t_point,char **);
+void array_output(t_point,char**);
+t_point get_position();
+void flood_fill(char**,t_point,t_point,char,char);
+
+#endif
diff --git a/TP2/Ex1/main.c b/TP2/Ex1/main.c
new file mode 100644
index 0000000..b690207
--- /dev/null
+++ b/TP2/Ex1/main.c
@@ -0,0 +1,23 @@
+#include "header.h"
+
+int main(){
+    t_point T,S;
+    printf("Please enter the dimensions of the array:\n");
+    input(&T);
+    output(T);
+    char **p;
+    p=array(T);
+    printf("Please input the array values (Note that '0' will be changed to '8' in case the position is correct):\n");
+    array_input(T,p);
+    printf("Here is what it looks like:\n");
+    array_output(T,p);
+    printf("Now please input the initial positon to apply the flood fill algorithm:\n");
+    S=get_position();
+    flood_fill(p,S,T,'0','8');
+    printf("Here is the result:\n");
+    array_output(T,p);
+    printf("\n");
+    free_array(T,p);
+
+    return 0;
+}
diff --git a/TP2/Ex2/Fcts.c b/TP2/Ex2/Fcts.c
new file mode 100644
index 0000000..252289e
--- /dev/null
+++ b/TP2/Ex2/Fcts.c
@@ -0,0 +1,112 @@
+#include "header.h"
+
+t_list create_node(int value){
+    t_list c=(t_list)malloc(sizeof(node));
+    c->value=value;
+    c->next=NULL;
+    return c;
+}
+
+void add_node(t_list L,int value){
+    t_list n=create_node(value);
+    t_list p=L;
+    if(p==NULL){
+        L=n;
+    }
+    else{
+        while(p->next!=NULL){
+            p=p->next;
+        }
+        p->next=n;
+    }
+    return;
+}
+
+t_list create_list(int n){
+    t_list L;
+    int value;
+    printf("Please enter the values: ");
+    scanf("%d",&value);
+    L=create_node(value);
+    for(int i=1;i<n;i++){
+        scanf("%d",&value);
+        add_node(L,value);
+    }
+    return L;
+}
+
+t_list array_to_list(int* T,int size){
+    t_list L;
+    if(size==0)
+        return L;
+    L=create_node(T[0]);
+    for (int i = 1; i < size ; i++)
+    {
+        add_node(L,T[i]);
+    }
+    return L;
+}
+
+void print_list(t_list L){
+    t_list p=L;
+    if(p==NULL)
+        printf("[ ]\n");
+    else{
+        printf("[ ");
+        while (p->next!=NULL)
+        {
+            printf("%d , ",p->value);
+            p=p->next;
+        }
+        printf("%d ]\n",p->value);
+    }
+    return ;
+}
+
+void remove_node(t_list * L,int n){
+    t_list p=*L,t=*L;
+    int i=0,j=0;
+    if(p==NULL){
+        printf("There is nothing to remove.\n");
+        return ;
+    }
+    while (p->next!=NULL)
+    {
+        p=p->next;
+        i++;
+    }
+    p=*L;
+    if(n<=i && n>0){
+        while (j<n)
+        {
+            p=t;
+            t=t->next;
+            j++;
+        }
+        p->next=t->next;
+        free(t);
+        return ;
+    }
+    else{
+        if(n==0){
+            *L=(*L)->next;
+            free(t);
+            return ;
+        }
+        else{
+            printf("The adress you have chosen is outside the range of the list and nothing changes.\n");
+            return ;
+        }
+    }
+}
+
+void free_node(t_list L){
+    while(L!=NULL){
+        t_list p=L;
+        L=L->next;
+        free(p);
+    }
+    return ;
+}
+
+
diff --git a/TP2/Ex2/Makefile b/TP2/Ex2/Makefile
new file mode 100644
index 0000000..dd0a235
--- /dev/null
+++ b/TP2/Ex2/Makefile
@@ -0,0 +1,9 @@
+SRC = main.c Fcts.c
+PRO_NAME = prog
+
+all:
+
+	gcc $(SRC) -o $(PRO_NAME)
+	./prog
+	rm prog
+
diff --git a/TP2/Ex2/header.h b/TP2/Ex2/header.h
new file mode 100644
index 0000000..3e95fe1
--- /dev/null
+++ b/TP2/Ex2/header.h
@@ -0,0 +1,23 @@
+#ifndef HEADER
+#define HEADER
+
+#include <stdio.h>
+#include <stdlib.h>
+
+struct node
+{
+    int value;
+    struct node* next;
+};
+typedef struct node node;
+typedef node* t_list;
+
+t_list create_node(int);         //Creating a node
+void add_node(t_list,int value); //Adding a node to an existing one
+t_list array_to_list(int* ,int); //Creating a list based on the array values
+void print_list(t_list);         //Printing the list values
+void remove_node(t_list*,int);  //Removing a node from the overall list
+void free_node(t_list);          //Freeing the allocated nodes in the overall list
+t_list create_list(int n);       //(Not required from the exercice) Creating an overall list 
+
+#endif
diff --git a/TP2/Ex2/main.c b/TP2/Ex2/main.c
new file mode 100644
index 0000000..bbe511a
--- /dev/null
+++ b/TP2/Ex2/main.c
@@ -0,0 +1,26 @@
+#include "header.h"
+
+int main(){
+    t_list c;
+    t_list* k=&c;
+    int n,T[n],m;
+    printf("Enter the desired array length: ");
+    scanf("%d",&n);
+    if(n>0){
+        printf("Please start typing the array values:\n");
+        for(int i=0;i<n;i++){
+            scanf("%d",&T[i]);
+        }
+        c=array_to_list(T,n);
+        print_list(c);
+        printf("Remove a node by typing it int address: ");
+        scanf("%d",&m);
+        remove_node(k,m);
+    }
+    else{
+        c=array_to_list(T,n);
+    }
+    print_list(c);
+    free_node(c);
+    return 0;
+}
diff --git a/TP3/.vscode/settings.json b/TP3/.vscode/settings.json
new file mode 100644
index 0000000..0f06797
--- /dev/null
+++ b/TP3/.vscode/settings.json
@@ -0,0 +1,5 @@
+{
+    "files.associations": {
+        "stdio.h": "c"
+    }
+}
\ No newline at end of file
diff --git a/TP3/Ex1/Ex1.c b/TP3/Ex1/Ex1.c
new file mode 100644
index 0000000..fabc7d3
--- /dev/null
+++ b/TP3/Ex1/Ex1.c
@@ -0,0 +1,35 @@
+#include "double.h"
+
+listeDouble string_to_list(char** C){
+    int l=strlen(C[1]);
+    listeDouble P={NULL,NULL,0};
+    for(int i=0;i<l;i++){
+        ajoutDebut(C[1][l-1-i],&P);
+    }
+    return P;
+}
+
+bool palindrome(listeDouble P){
+    unsigned l=P.longueur/2;
+    listeDouble d=P,f=P;
+    for(int i=0;i<l;i++){
+        if(d.debut->element!=f.fin->element){
+            return false;
+        }
+        d.debut=d.debut->suivant;
+        f.fin=f.fin->precedent;
+    }
+    return true;
+}
+
+int main(int ac, char** av){
+    listeDouble P = {NULL, NULL, 0};
+    P=string_to_list(av);
+    affichageListeDouble(P);
+    if (palindrome(P)==true)
+        printf("True\n");
+    else
+        printf("False\n");
+    libererListeDouble(P);
+    return 0;
+}
\ No newline at end of file
diff --git a/TP3/Ex1/Makefile b/TP3/Ex1/Makefile
new file mode 100644
index 0000000..0617ac2
--- /dev/null
+++ b/TP3/Ex1/Makefile
@@ -0,0 +1,8 @@
+CC = gcc
+SRC = *.c
+DEPS = *.h
+
+all : $(DEPS)
+	$(CC) -o Ex1 $(SRC)
+clear :
+	rm Ex1
\ No newline at end of file
diff --git a/TP3/Ex1/double.c b/TP3/Ex1/double.c
new file mode 100644
index 0000000..076625e
--- /dev/null
+++ b/TP3/Ex1/double.c
@@ -0,0 +1,119 @@
+#include "double.h"
+
+
+
+int listeDoubleVide(listeDouble L)
+{
+    if(L.debut==NULL)
+        return 1;
+    return 0;
+}
+
+
+void affichageListeDouble(listeDouble L)
+{
+    if(listeDoubleVide(L)==1)
+    {
+        printf("[]\n");
+        return;
+    }
+    celluleDouble *temp=L.debut;
+    printf("[");
+    while(temp->suivant!=NULL)
+    {
+        printf("%c, ",temp->element);
+        temp=temp->suivant;
+    }
+    if(temp!=NULL)
+        printf("%c",temp->element);
+    printf("]\n");
+}
+
+
+
+void ajoutDebut(char x,listeDouble * L)
+{
+    celluleDouble * C=(celluleDouble *)malloc(sizeof(celluleDouble));
+    C->element=x;
+    C->suivant=L->debut;
+    C->precedent=NULL;
+    
+    if(listeDoubleVide(*L)==1)
+    {
+        L->debut=C;
+        L->fin=C;
+        L->longueur=1;
+        return;
+    }
+    L->debut->precedent=C;
+    L->debut=C;
+    L->longueur+=1;
+    return;
+}
+
+
+void ajoutFin(int x,listeDouble *L)
+{
+    celluleDouble * C=(celluleDouble *)malloc(sizeof(celluleDouble));
+    C->element=x;
+    C->precedent=L->fin;
+    C->suivant=NULL;
+    
+    if(listeDoubleVide(*L)==1)
+    {
+        ajoutDebut(x,L);
+        return;
+    }
+    L->fin->suivant=C;
+    L->fin=C;
+    L->longueur+=1;
+    return;
+}
+
+void suppressionDebut(listeDouble * L)
+{
+    if(listeDoubleVide(*L)==1)
+        return;
+    if(L->longueur==1)
+    {
+        L->longueur=0;
+        if(L->debut!=NULL)
+            free(L->debut);
+        L->debut=NULL;
+        return;
+    }
+    celluleDouble * temp=L->debut;
+    L->debut=L->debut->suivant;
+    L->longueur-=1;
+    free(temp);
+    return;
+}
+
+
+void suppressionFin(listeDouble * L)
+{
+    if(listeDoubleVide(*L)==1)
+        return;
+    if(L->longueur==1)
+    {
+        suppressionDebut(L);
+        return;
+    }
+    celluleDouble * temp=L->fin;
+    L->fin=L->fin->precedent;
+    L->fin->suivant=NULL;
+    L->longueur-=1;
+    free(temp);
+    return;
+}
+
+
+void libererListeDouble(listeDouble L)
+{
+    while(L.debut!=NULL)
+    {
+        celluleDouble * temp=L.debut;
+        L.debut=L.debut->suivant;
+        free(temp);
+    }
+}
\ No newline at end of file
diff --git a/TP3/Ex1/double.h b/TP3/Ex1/double.h
new file mode 100644
index 0000000..85e361d
--- /dev/null
+++ b/TP3/Ex1/double.h
@@ -0,0 +1,32 @@
+#ifndef DOUBLE_H
+#define DOUBLE_H
+
+#include<stdlib.h>
+#include<stdio.h>
+#include<string.h>
+#include<stdbool.h>
+struct celluleDouble
+{
+    int element;
+    struct celluleDouble * suivant;
+    struct celluleDouble * precedent;
+};
+typedef struct celluleDouble celluleDouble;
+
+struct listeDouble
+{
+    celluleDouble * debut;
+    celluleDouble * fin;
+    unsigned longueur;
+};
+typedef struct listeDouble listeDouble;
+
+int listeDoubleVide(listeDouble);
+void affichageListeDouble(listeDouble);
+void ajoutDebut(char, listeDouble *);
+void ajoutFin(int,listeDouble *);
+void suppressionDebut(listeDouble *);
+void suppressionFin(listeDouble *);
+void libererListeDouble(listeDouble);
+
+#endif
\ No newline at end of file
diff --git a/TP3/Ex2/Ex2.c b/TP3/Ex2/Ex2.c
new file mode 100644
index 0000000..a98ed8f
--- /dev/null
+++ b/TP3/Ex2/Ex2.c
@@ -0,0 +1,85 @@
+#include "double.h"
+
+void sort_list(listeDouble* P){
+    int i,j,k;
+    listeDouble temp=*P, temp2=*P;
+    while(temp.debut->suivant!=NULL){
+        while(temp2.debut->suivant!=NULL){
+            if(temp.debut->element>temp2.debut->suivant->element){
+                k=temp.debut->element;
+                temp.debut->element=temp2.debut->suivant->element;
+                temp2.debut->suivant->element=k;
+            }
+            temp2.debut=temp2.debut->suivant;
+        }
+        temp.debut=temp.debut->suivant;
+        temp2=temp;
+    }
+    return;
+}
+
+void merge_lists(listeDouble* P,listeDouble * L){
+    listeDouble temp=*P;
+    temp.fin->suivant=(*L).debut;
+    return;
+}
+
+void remove_duplicated(listeDouble* L){
+    listeDouble temp=*L;
+    listeDouble temp2=*L;
+    while(temp.debut->suivant!=NULL){
+        if(temp.debut->element==temp.debut->suivant->element){
+            if(temp.debut->suivant->suivant==NULL){
+                temp2.debut=temp.debut;
+                temp.debut->suivant=NULL;
+                temp2.debut=temp2.debut->suivant;
+                free(temp2.debut);
+                return;
+            }
+            else{
+                temp2.debut=temp.debut;
+                temp2.debut=temp2.debut->suivant;
+                temp.debut->suivant=temp.debut->suivant->suivant;
+                temp2.debut->suivant=NULL;
+                free(temp2.debut);
+            }
+        }
+        else{
+            temp.debut=temp.debut->suivant;
+        }
+    }
+}
+
+int Randoms(int lower, int upper)
+{
+    int num = (rand() % (upper - lower + 1)) + lower;
+    return num;
+}
+  
+
+int main(){
+    listeDouble P={NULL,NULL,0};
+    listeDouble L={NULL,NULL,0};
+    srand(time(0));
+    for (int i=0;i<100;i++){
+        ajoutDebut(Randoms(0,40),&P);
+    }
+    printf("List P: ");
+    affichageListeDouble(P);
+    for (int i=0;i<30;i++){
+        ajoutDebut(Randoms(0,40),&L);
+    }
+    printf("List L: ");
+    affichageListeDouble(L);
+    merge_lists(&P,&L);
+    printf("List P merged with L: ");
+    affichageListeDouble(P);
+    sort_list(&P);
+    printf("List P: ");
+    affichageListeDouble(P);
+    remove_duplicated(&P);
+    printf("List P without doubles: ");
+    affichageListeDouble(P);
+    libererListeDouble(P);
+    return 0;
+}
\ No newline at end of file
diff --git a/TP3/Ex2/Makefile b/TP3/Ex2/Makefile
new file mode 100644
index 0000000..f694038
--- /dev/null
+++ b/TP3/Ex2/Makefile
@@ -0,0 +1,8 @@
+CC = gcc
+SRC = *.c
+DEPS = *.h
+
+all : $(DEPS)
+	$(CC) -o Ex2 $(SRC)
+	./Ex2
+	rm Ex2
\ No newline at end of file
diff --git a/TP3/Ex2/double.c b/TP3/Ex2/double.c
new file mode 100644
index 0000000..3bb5b37
--- /dev/null
+++ b/TP3/Ex2/double.c
@@ -0,0 +1,118 @@
+#include "double.h"
+
+
+int listeDoubleVide(listeDouble L)
+{
+    if(L.debut==NULL)
+        return 1;
+    return 0;
+}
+
+
+void affichageListeDouble(listeDouble L)
+{
+    if(listeDoubleVide(L)==1)
+    {
+        printf("[]\n");
+        return;
+    }
+    celluleDouble *temp=L.debut;
+    printf("[");
+    while(temp->suivant!=NULL)
+    {
+        printf("%d, ",temp->element);
+        temp=temp->suivant;
+    }
+    if(temp!=NULL)
+        printf("%d",temp->element);
+    printf("]\n");
+}
+
+
+
+void ajoutDebut(char x,listeDouble * L)
+{
+    celluleDouble * C=(celluleDouble *)malloc(sizeof(celluleDouble));
+    C->element=x;
+    C->suivant=L->debut;
+    C->precedent=NULL;
+    
+    if(listeDoubleVide(*L)==1)
+    {
+        L->debut=C;
+        L->fin=C;
+        L->longueur=1;
+        return;
+    }
+    L->debut->precedent=C;
+    L->debut=C;
+    L->longueur+=1;
+    return;
+}
+
+
+void ajoutFin(int x,listeDouble *L)
+{
+    celluleDouble * C=(celluleDouble *)malloc(sizeof(celluleDouble));
+    C->element=x;
+    C->precedent=L->fin;
+    C->suivant=NULL;
+    
+    if(listeDoubleVide(*L)==1)
+    {
+        ajoutDebut(x,L);
+        return;
+    }
+    L->fin->suivant=C;
+    L->fin=C;
+    L->longueur+=1;
+    return;
+}
+
+void suppressionDebut(listeDouble * L)
+{
+    if(listeDoubleVide(*L)==1)
+        return;
+    if(L->longueur==1)
+    {
+        L->longueur=0;
+        if(L->debut!=NULL)
+            free(L->debut);
+        L->debut=NULL;
+        return;
+    }
+    celluleDouble * temp=L->debut;
+    L->debut=L->debut->suivant;
+    L->longueur-=1;
+    free(temp);
+    return;
+}
+
+
+void suppressionFin(listeDouble * L)
+{
+    if(listeDoubleVide(*L)==1)
+        return;
+    if(L->longueur==1)
+    {
+        suppressionDebut(L);
+        return;
+    }
+    celluleDouble * temp=L->fin;
+    L->fin=L->fin->precedent;
+    L->fin->suivant=NULL;
+    L->longueur-=1;
+    free(temp);
+    return;
+}
+
+
+void libererListeDouble(listeDouble L)
+{
+    while(L.debut!=NULL)
+    {
+        celluleDouble * temp=L.debut;
+        L.debut=L.debut->suivant;
+        free(temp);
+    }
+}
\ No newline at end of file
diff --git a/TP3/Ex2/double.h b/TP3/Ex2/double.h
new file mode 100644
index 0000000..85d1997
--- /dev/null
+++ b/TP3/Ex2/double.h
@@ -0,0 +1,33 @@
+#ifndef DOUBLE_H
+#define DOUBLE_H
+
+#include<stdlib.h>
+#include<stdio.h>
+#include<string.h>
+#include<stdbool.h>
+#include<time.h>
+struct celluleDouble
+{
+    int element;
+    struct celluleDouble * suivant;
+    struct celluleDouble * precedent;
+};
+typedef struct celluleDouble celluleDouble;
+
+struct listeDouble
+{
+    celluleDouble * debut;
+    celluleDouble * fin;
+    unsigned longueur;
+};
+typedef struct listeDouble listeDouble;
+
+int listeDoubleVide(listeDouble);
+void affichageListeDouble(listeDouble);
+void ajoutDebut(char, listeDouble *);
+void ajoutFin(int,listeDouble *);
+void suppressionDebut(listeDouble *);
+void suppressionFin(listeDouble *);
+void libererListeDouble(listeDouble);
+
+#endif
\ No newline at end of file
diff --git a/TP3/Ex2Arr/Ex2Arr.c b/TP3/Ex2Arr/Ex2Arr.c
new file mode 100644
index 0000000..218a08c
--- /dev/null
+++ b/TP3/Ex2Arr/Ex2Arr.c
@@ -0,0 +1,66 @@
+#include "Ex2Arr.h"
+
+void printArray(int arr[],int n){
+    printf("[ ");
+    for(int i=0;i<n;i++){
+        printf("%d ",arr[i]);
+    }
+    printf("]\n");
+}
+
+int Randoms(int lower, int upper)
+{
+    int num = (rand() % (upper - lower + 1)) + lower;
+    return num;
+}
+
+void sortArray(int arr[], int n){
+    int s;
+    for(int i=0;i<n-1;i++){
+        for(int j=0;j<n-i-1;j++){
+            if(arr[j]>arr[j+1]){
+                s=arr[j];
+                arr[j]=arr[j+1];
+                arr[j+1]=s;
+            }
+        }
+    }
+    return ;
+}
+
+int NotDuplicates(int arr[], int n){
+    int c=0,i=0;
+    while(i<n){
+        if(arr[i]!=arr[i+1]){
+            c++;
+            i++;
+        }
+        else{
+            i++;
+        }
+    }
+    return c;
+}
+
+int* removeDuplicates(int arr[],int n, int c){
+    int* Arr=(int*)malloc(c*sizeof(int));
+    int m=0;
+    for(int i=0;i<n;i++){
+        if(arr[i]!=arr[i+1]){
+            Arr[m]=arr[i];
+            m+=1;
+        }
+    }
+    return Arr;
+}
+
+int* mergeArray(int arr1[], int n1, int arr2[], int n2){
+    int* Arr=(int*)malloc((n1+n2)*sizeof(int));
+    for(int i=0;i<n1+n2;i++){
+        if(i<n1)
+            Arr[i]=arr1[i];
+        else
+            Arr[i]=arr2[i-n1];
+    }
+    return Arr;
+}
\ No newline at end of file
diff --git a/TP3/Ex2Arr/Ex2Arr.h b/TP3/Ex2Arr/Ex2Arr.h
new file mode 100644
index 0000000..9428295
--- /dev/null
+++ b/TP3/Ex2Arr/Ex2Arr.h
@@ -0,0 +1,15 @@
+#ifndef EX2ARR_H
+#define EX2ARR_H
+
+#include<stdio.h>
+#include<stdlib.h>
+#include<time.h>
+
+void printArray(int arr[],int n);
+int Randoms(int lower, int upper);
+void sortArray(int arr[], int n);
+int NotDuplicates(int arr[], int n);
+int* removeDuplicates(int arr[],int n, int c);
+int* mergeArray(int arr1[], int n1, int arr2[], int n2);
+
+#endif
\ No newline at end of file
diff --git a/TP3/Ex2Arr/Makefile b/TP3/Ex2Arr/Makefile
new file mode 100644
index 0000000..f694038
--- /dev/null
+++ b/TP3/Ex2Arr/Makefile
@@ -0,0 +1,8 @@
+CC = gcc
+SRC = *.c
+DEPS = *.h
+
+all : $(DEPS)
+	$(CC) -o Ex2 $(SRC)
+	./Ex2
+	rm Ex2
\ No newline at end of file
diff --git a/TP3/Ex2Arr/main.c b/TP3/Ex2Arr/main.c
new file mode 100644
index 0000000..ce67016
--- /dev/null
+++ b/TP3/Ex2Arr/main.c
@@ -0,0 +1,28 @@
+#include "Ex2Arr.h"
+
+int main(){
+    int Arr1[100], Arr2[30];
+    srand(time(0));
+    for(int i=0;i<100;i++){
+        Arr1[i]=Randoms(0,10);
+    }
+    printf("Arr1= ");
+    printArray(Arr1,100);
+    for(int i=0;i<30;i++){
+        Arr2[i]=Randoms(0,20);
+    }
+    printf("Arr2= ");
+    printArray(Arr2,30);
+    int* Arr=mergeArray(Arr1,100,Arr2,30);
+    printf("Merged arrays : ");
+    printArray(Arr,130);
+    sortArray(Arr,130);
+    printf("Sorted Array :");
+    printArray(Arr,130);
+    int n=NotDuplicates(Arr,130);
+    int* Arr3=removeDuplicates(Arr,130,n);
+    printf("Array without duplicates : ");
+    printArray(Arr3,n);
+    free(Arr3);
+    return 0;
+}
\ No newline at end of file
diff --git a/TP3/RPN/Makefile b/TP3/RPN/Makefile
new file mode 100644
index 0000000..04de95f
--- /dev/null
+++ b/TP3/RPN/Makefile
@@ -0,0 +1,8 @@
+CC = gcc
+SRC = *.c
+DEPS = *.h
+
+all : $(DEPS)
+	$(CC) -o RPN $(SRC)
+clear :
+	rm RPN
\ No newline at end of file
diff --git a/TP3/RPN/RPN.c b/TP3/RPN/RPN.c
new file mode 100644
index 0000000..aab600d
--- /dev/null
+++ b/TP3/RPN/RPN.c
@@ -0,0 +1,150 @@
+#include "stack.h"
+
+int add(int x, int y){
+    return x+y;
+}
+
+int sub(int x, int y){
+    return x-y;
+}
+
+int mul(int x, int y){
+    return x*y;
+}
+
+int divd(int x, int y){
+    if(y==0){
+        printf("Division by zero.\n");
+        exit(EXIT_FAILURE);
+    }
+    return x/y;
+}
+
+int mod(int x, int y){
+    if(y==0){
+        printf("Modulo Op by zero.\n");
+        exit(EXIT_FAILURE);
+    }
+    return x%y;
+}
+
+char** form(char* s){
+	char delim[] = " ";
+
+    char str[strlen(s)];
+    int j=0;
+
+    for(int i=0;i<strlen(s);i++){
+        str[i]=s[i];
+    }
+	char *ptr = strtok(str, delim);
+
+	while(ptr != NULL)
+	{
+		ptr = strtok(NULL, delim);
+        j++;
+	}
+    char** expr=(char**)malloc(j*sizeof(char*));
+
+    char *ptr_2 = strtok(s, delim);
+
+    int i=0;
+
+    while(ptr_2 != NULL)
+	{
+        expr[i]=ptr_2;
+		ptr_2 = strtok(NULL, delim);
+        i++;
+	}
+    return expr;
+}
+
+
+
+int number(char* string){
+    int s=0;
+    for(int j=0;j<strlen(string);j++){
+        s = s * 10 + (string[j] - '0');
+    }
+    return s;
+}
+
+void stack_error(t_stack* head){
+    if(is_empty(head) || stack_len(head)==2){
+            printf("Error.\n");
+            exit(EXIT_FAILURE);
+        }
+}
+
+int size(char* s){
+    char delim[] = " ";
+
+    char str[strlen(s)];
+    int j=0;
+
+    for(int i=0;i<strlen(s);i++){
+        str[i]=s[i];
+    }
+	char *ptr = strtok(str, delim);
+
+	while(ptr != NULL)
+	{
+		ptr = strtok(NULL, delim);
+        j++;
+	}
+    return j;
+}
+
+void operation(t_stack** head, int n){
+    int r;
+    int (*ops[])(int,int)={add,sub,mul,divd,mod};
+    stack_error(*head);
+    r=(ops[n])(pop(head),pop(head));
+    push(head,r);
+    return;
+}
+
+void formula(char** n, int j){
+    t_stack P={0,NULL};
+    t_stack* head=&P;
+    int r;
+    int (*ops[])(int,int)={add,sub,mul,divd,mod};
+
+    for(int i=0;i<j;i++){
+        switch (n[i][0])
+        {
+        case '+':
+            operation(&head,0);
+            break;
+        case '-':
+            operation(&head,1);
+            break;
+        case '*':
+            operation(&head,2);
+            break;
+        case '/':
+            operation(&head,3);
+            break;
+        case '%':
+            operation(&head,4);
+            break;
+        default:
+            push(&head,number(n[i]));
+            break;
+        }
+    }
+    if(stack_len(head)==2){
+        printf("The result is : %d\n",pop(&head));
+    }
+    else{
+        printf("Error in formula.\n");
+    }
+    return;
+}
+
+int main(int ac, char** av){
+    char* s=av[1];
+    formula(form(s),size(s));
+    free(form(s));
+    return 0;
+}
\ No newline at end of file
diff --git a/TP3/RPN/stack.c b/TP3/RPN/stack.c
new file mode 100644
index 0000000..82ca96b
--- /dev/null
+++ b/TP3/RPN/stack.c
@@ -0,0 +1,70 @@
+#include "stack.h"
+
+t_stack* new_stack(int data){
+    t_stack* P=(t_stack*)malloc(sizeof(t_stack));
+    P->data=data;
+    P->next=NULL;
+    return P;
+}
+
+int is_empty(t_stack* head){
+    if(head==NULL){
+        return 1;
+    }
+    return 0;
+}
+
+void push(t_stack** head, int data){
+    t_stack* P=new_stack(data);
+    P->next=*head;
+    *head=P;
+    return;
+}
+
+int pop(t_stack** head){
+    if(is_empty(*head)){
+        return INT_MIN;
+    }
+    int data=(*head)->data;
+    t_stack* L=*head;
+    *head=(*head)->next;
+    free(L);
+    return data;
+}
+
+int stack_len(t_stack* head){
+    t_stack* temp=head;
+    int n=0;
+    while(temp!=NULL){
+        n++;
+        temp=temp->next;
+    }
+    return n;
+}
+
+int peek_stack(t_stack* head){
+    if(is_empty(head)){
+        return INT_MIN;
+    }
+    return head->data;
+}
+
+void print_stack(t_stack* head){
+    t_stack* temp=head;
+    printf("[ ");
+    while(temp!=NULL){
+        printf("%d ",temp->data);
+        temp=temp->next;
+    }
+    printf("]\n");
+    return;
+}
+
+void free_stack(t_stack* head){
+    while(head!=NULL){
+        t_stack* temp=head;
+        head=head->next;
+        free(temp);
+    }
+    return;
+}
\ No newline at end of file
diff --git a/TP3/RPN/stack.h b/TP3/RPN/stack.h
new file mode 100644
index 0000000..b835ba2
--- /dev/null
+++ b/TP3/RPN/stack.h
@@ -0,0 +1,29 @@
+#ifndef STACK_H
+#define STACK_H
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <limits.h>
+#include <ctype.h>
+#include <string.h>
+
+typedef struct			s_stack
+{
+	int			data;
+	struct s_stack		*next;
+}				t_stack;
+
+/* ************************************************************************** */
+/*                        STACK FUNCTIONS                                     */
+/* ************************************************************************** */
+t_stack                	*new_stack(int data);
+int			is_empty(t_stack *head);
+void        push(t_stack **head, int data);
+int			pop(t_stack **head);
+int         stack_len(t_stack *head);
+int			peek_stack(t_stack *head);
+void		print_stack(t_stack *head);
+void		free_stack(t_stack*);
+
+#endif
\ No newline at end of file
diff --git a/TP4/.vscode/configurationCache.log b/TP4/.vscode/configurationCache.log
new file mode 100644
index 0000000..d7689fc
--- /dev/null
+++ b/TP4/.vscode/configurationCache.log
@@ -0,0 +1 @@
+{"buildTargets":["TP"],"launchTargets":["/home/ayoub/Work/Info/TP4>TP()"],"customConfigurationProvider":{"workspaceBrowse":{"browsePath":["/home/ayoub/Work/Info/TP4"],"compilerArgs":["-c","TP.c","Tree.c","-c","TP.c","Tree.c","-c","-o","TP.o","TP.c","-c","-o","TP.o","TP.c","-o","TP","TP.c","Tree.c"],"compilerPath":"/usr/bin/gcc","standard":"c11","windowsSdkVersion":""},"fileIndex":[["/home/ayoub/Work/Info/TP4/*.c",{"uri":{"$mid":1,"path":"/home/ayoub/Work/Info/TP4/*.c","scheme":"file"},"configuration":{"defines":[],"standard":"c11","includePath":[],"forcedInclude":[],"intelliSenseMode":"gcc-x64","compilerPath":"/usr/bin/gcc","compilerArgs":["-o","TP","TP.c","Tree.c"],"windowsSdkVersion":""}}],["/home/ayoub/Work/Info/TP4/Tree.c",{"uri":{"$mid":1,"external":"file:///home/ayoub/Work/Info/TP4/Tree.c","path":"/home/ayoub/Work/Info/TP4/Tree.c","scheme":"file"},"configuration":{"defines":[],"standard":"c11","includePath":[],"forcedInclude":[],"intelliSenseMode":"gcc-x64","compilerPath":"/usr/bin/gcc","compilerArgs":["-c","-o","Tree.o","Tree.c"],"windowsSdkVersion":""}}],["/home/ayoub/Work/Info/TP4/TP.c",{"uri":{"$mid":1,"path":"/home/ayoub/Work/Info/TP4/TP.c","scheme":"file"},"configuration":{"defines":[],"standard":"c11","includePath":[],"forcedInclude":[],"intelliSenseMode":"gcc-x64","compilerPath":"/usr/bin/gcc","compilerArgs":["-c","-o","TP.o","TP.c"],"windowsSdkVersion":""}}]]}}
\ No newline at end of file
diff --git a/TP4/.vscode/dryrun.log b/TP4/.vscode/dryrun.log
new file mode 100644
index 0000000..f95b262
--- /dev/null
+++ b/TP4/.vscode/dryrun.log
@@ -0,0 +1,8 @@
+make --dry-run --always-make --keep-going --print-directory
+make: Entering directory '/home/ayoub/Work/Info/TP4'
+gcc -c *.c
+gcc -o TP *.c
+./TP
+rm TP *.o
+make: Leaving directory '/home/ayoub/Work/Info/TP4'
+ 
diff --git a/TP4/.vscode/settings.json b/TP4/.vscode/settings.json
new file mode 100644
index 0000000..65e1ec0
--- /dev/null
+++ b/TP4/.vscode/settings.json
@@ -0,0 +1,3 @@
+{
+    "makefile.extensionOutputFolder": "./.vscode"
+}
\ No newline at end of file
diff --git a/TP4/.vscode/targets.log b/TP4/.vscode/targets.log
new file mode 100644
index 0000000..9f8fa6e
--- /dev/null
+++ b/TP4/.vscode/targets.log
@@ -0,0 +1,376 @@
+make all --print-data-base --no-builtin-variables --no-builtin-rules --question
+make: *** No rule to make target 'all'.  Stop.
+ 
+# GNU Make 4.2.1
+# Built for x86_64-pc-linux-gnu
+# Copyright (C) 1988-2016 Free Software Foundation, Inc.
+# License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>
+# This is free software: you are free to change and redistribute it.
+# There is NO WARRANTY, to the extent permitted by law.
+
+# Make data base, printed on Fri Jun  4 14:19:01 2021
+
+# Variables
+
+# 'override' directive
+GNUMAKEFLAGS := 
+# automatic
+<D = $(patsubst %/,%,$(dir $<))
+# automatic
+?F = $(notdir $?)
+# environment
+DESKTOP_SESSION = ubuntu
+# default
+.SHELLFLAGS := -c
+# makefile (from 'Makefile', line 4)
+OBJ = *.o
+# environment
+XDG_SESSION_CLASS = user
+# makefile (from 'Makefile', line 2)
+SRC = *.c
+# environment
+SNAP_COMMON = /var/snap/code/common
+# environment
+XDG_SESSION_TYPE = x11
+# environment
+VSCODE_LOG_NATIVE = false
+# automatic
+?D = $(patsubst %/,%,$(dir $?))
+# environment
+IM_CONFIG_PHASE = 1
+# automatic
+@D = $(patsubst %/,%,$(dir $@))
+# environment
+XAUTHORITY = /run/user/1000/gdm/Xauthority
+# environment
+GDMSESSION = ubuntu
+# environment
+XMODIFIERS = @im=ibus
+# makefile
+CURDIR := /home/ayoub/Work/Info/TP4
+# makefile
+SHELL = /bin/sh
+# environment
+SNAP_DATA = /var/snap/code/65
+# environment
+VSCODE_NLS_CONFIG = {"locale":"en-us","availableLanguages":{},"_languagePackSupport":true}
+# environment
+JOURNAL_STREAM = 8:44433
+# environment
+XDG_CONFIG_DIRS = /etc/xdg/xdg-ubuntu:/etc/xdg
+# environment
+SNAP_INSTANCE_NAME = code
+# environment
+SNAP_ARCH = amd64
+# makefile (from 'Makefile', line 1)
+MAKEFILE_LIST :=  Makefile
+# automatic
+@F = $(notdir $@)
+# environment
+GIO_LAUNCHED_DESKTOP_FILE = /var/lib/snapd/desktop/applications/code_code.desktop
+# environment
+USERNAME = ayoub
+# environment
+MAKELEVEL := 0
+# environment
+XDG_DATA_DIRS = /usr/share/ubuntu:/usr/local/share/:/usr/share/:/var/lib/snapd/desktop
+# environment
+DBUS_SESSION_BUS_ADDRESS = unix:path=/run/user/1000/bus
+# environment
+VSCODE_VERBOSE_LOGGING = true
+# environment
+_ = /snap/code/65/usr/share/code/code
+# environment
+MANAGERPID = 1497
+# environment
+LESSOPEN = | /usr/bin/lesspipe %s
+# environment
+LC_NAME = ar_MA.UTF-8
+# environment
+VSCODE_CWD = /home/ayoub
+# environment
+GSETTINGS_SCHEMA_DIR = /snap/code/65/usr/share/glib-2.0/schemas
+# default
+MAKE_HOST := x86_64-pc-linux-gnu
+# environment
+PATH = /home/ayoub/.local/bin:/home/ayoub/anaconda3/bin:/home/ayoub/anaconda3/condabin:/home/ayoub/.local/bin:/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin
+# environment
+GPG_AGENT_INFO = /run/user/1000/gnupg/S.gpg-agent:0:1
+# environment
+SESSION_MANAGER = local/Ayoub:@/tmp/.ICE-unix/1718,unix/Ayoub:/tmp/.ICE-unix/1718
+# environment
+XDG_RUNTIME_DIR = /run/user/1000
+# environment
+GDK_PIXBUF_MODULE_FILE = /home/ayoub/snap/code/common/.cache/gdk-pixbuf-loaders.cache
+# environment
+SNAP = /snap/code/65
+# environment
+SNAP_VERSION = 054a9295
+# environment
+CONDA_PREFIX = /home/ayoub/anaconda3
+# environment
+XDG_MENU_PREFIX = gnome-
+# environment
+VSCODE_LOG_STACK = false
+# environment
+DISABLE_WAYLAND = 1
+# environment
+VSCODE_CRASH_REPORTER_START_OPTIONS = {"companyName":"Microsoft","productName":"VSCode","submitURL":"appcenter://code?aid=fba07a4d-84bd-4fc8-a125-9640fc8ce171&uid=a17fc131-3eba-40cd-8f30-18374b0e8607&iid=a17fc131-3eba-40cd-8f30-18374b0e8607&sid=a17fc131-3eba-40cd-8f30-18374b0e8607","uploadToServer":true}
+# environment
+INVOCATION_ID = bc734c65495048df874cd0a55cdcddeb
+# environment
+GDK_PIXBUF_MODULEDIR = /snap/code/65/usr/lib/x86_64-linux-gnu/gdk-pixbuf-2.0/2.10.0/loaders
+# default
+.FEATURES := target-specific order-only second-expansion else-if shortest-stem undefine oneshell archives jobserver output-sync check-symlink load
+# environment
+LS_COLORS = 
+# environment
+XDG_SESSION_DESKTOP = ubuntu
+# environment
+SSH_AUTH_SOCK = /run/user/1000/keyring/ssh
+# environment
+GIO_LAUNCHED_DESKTOP_FILE_PID = 18307
+# automatic
+%F = $(notdir $%)
+# environment
+DISPLAY = :0
+# environment
+CONDA_EXE = /home/ayoub/anaconda3/bin/conda
+# environment
+VSCODE_PIPE_LOGGING = true
+# environment
+SNAP_INSTANCE_KEY = 
+# environment
+PWD = /home/ayoub/Work/Info/TP4
+# default
+.LOADED := 
+# environment
+SSH_AGENT_PID = 1675
+# environment
+ORIGINAL_XDG_CURRENT_DESKTOP = ubuntu:GNOME
+# environment
+GTK_MODULES = gail:atk-bridge
+# environment
+VSCODE_AMD_ENTRYPOINT = vs/workbench/services/extensions/node/extensionHostProcess
+# environment
+HOME = /home/ayoub
+# environment
+LESSCLOSE = /usr/bin/lesspipe %s %s
+# environment
+VSCODE_CLI = 1
+# environment
+LOGNAME = ayoub
+# environment
+APPLICATION_INSIGHTS_NO_DIAGNOSTIC_CHANNEL = true
+# environment
+SNAP_LIBRARY_PATH = /var/lib/snapd/lib/gl:/var/lib/snapd/lib/gl32:/var/lib/snapd/void
+# environment
+SNAP_CONTEXT = q6TrmfKD2th0chNXiAoekUgbsUQ9ZVFVYVGQA3cdIltlZNEhuBLX
+# environment
+CONDA_PROMPT_MODIFIER = (base) 
+# automatic
++F = $(notdir $+)
+# environment
+ELECTRON_NO_ATTACH_CONSOLE = 1
+# environment
+SNAP_USER_COMMON = /home/ayoub/snap/code/common
+# environment
+VSCODE_HANDLES_UNCAUGHT_ERRORS = true
+# environment
+GNOME_DESKTOP_SESSION_ID = this-is-deprecated
+# automatic
+^D = $(patsubst %/,%,$(dir $^))
+# environment
+LC_TIME = ar_MA.UTF-8
+# environment
+SNAP_REAL_HOME = /home/ayoub
+# environment
+CONDA_DEFAULT_ENV = base
+# default
+MAKE = $(MAKE_COMMAND)
+# default
+MAKECMDGOALS := all
+# environment
+QT_IM_MODULE = ibus
+# environment
+SNAP_USER_DATA = /home/ayoub/snap/code/65
+# environment
+SHLVL = 0
+# makefile (from 'Makefile', line 1)
+CC = gcc
+# environment
+GNOME_SHELL_SESSION_MODE = ubuntu
+# environment
+VSCODE_IPC_HOOK_EXTHOST = /run/user/1000/vscode-ipc-7d2454ae-a1e5-455c-98d3-8ca04181c451.sock
+# default
+MAKE_VERSION := 4.2.1
+# environment
+USER = ayoub
+# environment
+SNAP_REVISION = 65
+# environment
+LC_MONETARY = ar_MA.UTF-8
+# makefile
+.DEFAULT_GOAL := TP
+# environment
+XDG_CURRENT_DESKTOP = Unity
+# automatic
+%D = $(patsubst %/,%,$(dir $%))
+# environment
+LC_TELEPHONE = ar_MA.UTF-8
+# environment
+CONDA_SHLVL = 1
+# default
+MAKE_COMMAND := make
+# environment
+VSCODE_NODE_CACHED_DATA_DIR = /home/ayoub/.config/Code/CachedData/054a9295330880ed74ceaedda236253b4f39a335
+# default
+.VARIABLES := 
+# automatic
+*F = $(notdir $*)
+# environment
+VSCODE_IPC_HOOK = /run/user/1000/vscode-6e623045-1.56.2-main.sock
+# environment
+BAMF_DESKTOP_FILE_HINT = /var/lib/snapd/desktop/applications/code_code.desktop
+# makefile
+MAKEFLAGS = pqrR
+# environment
+MFLAGS = -pqrR
+# automatic
+*D = $(patsubst %/,%,$(dir $*))
+# environment
+BREAKPAD_DUMP_LOCATION = /home/ayoub/.config/Code/exthost Crash Reports
+# automatic
++D = $(patsubst %/,%,$(dir $+))
+# environment
+GDK_BACKEND = x11
+# environment
+LC_PAPER = ar_MA.UTF-8
+# environment
+LC_IDENTIFICATION = ar_MA.UTF-8
+# environment
+QT_ACCESSIBILITY = 1
+# default
+MAKEFILES := 
+# environment
+SNAP_COOKIE = q6TrmfKD2th0chNXiAoekUgbsUQ9ZVFVYVGQA3cdIltlZNEhuBLX
+# environment
+LC_NUMERIC = ar_MA.UTF-8
+# automatic
+<F = $(notdir $<)
+# environment
+ELECTRON_RUN_AS_NODE = 1
+# environment
+LC_MEASUREMENT = ar_MA.UTF-8
+# environment
+SNAP_NAME = code
+# environment
+LC_ALL = C
+# environment
+CONDA_PYTHON_EXE = /home/ayoub/anaconda3/bin/python
+# environment
+GJS_DEBUG_TOPICS = JS ERROR;JS LOG
+# automatic
+^F = $(notdir $^)
+# makefile (from 'Makefile', line 3)
+DEPS = *.h
+# default
+SUFFIXES := 
+# environment
+SNAP_REEXEC = 
+# environment
+_CE_M = 
+# environment
+CHROME_DESKTOP = code-url-handler.desktop
+# environment
+WINDOWPATH = 2
+# default
+.INCLUDE_DIRS = /usr/include /usr/local/include /usr/include
+# environment
+GJS_DEBUG_OUTPUT = stderr
+# default
+.RECIPEPREFIX := 
+# environment
+LC_ADDRESS = ar_MA.UTF-8
+# environment
+LANG = C
+# environment
+ 
+VSCODE_PID = 18350
+# environment
+_CE_CONDA = 
+# variable set hash-table stats:
+# Load=143/1024=14%, Rehash=0, Collisions=28/170=16%
+
+# Pattern-specific Variable Values
+
+# No pattern-specific variable values.
+
+# Directories
+
+# . (device 2054, inode 558265): 8 files, no impossibilities.
+
+# 8 files, no impossibilities in 1 directories.
+
+# Implicit Rules
+
+%.o: %.c Tree.h
+#  recipe to execute (from 'Makefile', line 7):
+	$(CC) -c $(SRC)
+
+# 1 implicit rules, 0 (0.0%) terminal.
+
+# Files
+
+# Not a target:
+all:
+#  Command line target.
+#  Implicit rule search has been done.
+#  File does not exist.
+#  File has not been updated.
+
+# Not a target:
+*.o:
+#  Implicit rule search has not been done.
+#  Modification time never checked.
+#  File has not been updated.
+
+TP: *.o
+#  Implicit rule search has not been done.
+#  Modification time never checked.
+#  File has not been updated.
+#  recipe to execute (from 'Makefile', line 10):
+	$(CC) -o TP $(SRC)
+	./TP
+	rm TP $(OBJ)
+
+# Not a target:
+Makefile:
+#  Implicit rule search has been done.
+#  Last modified 2021-06-04 14:18:03.166078133
+#  File has been updated.
+#  Successfully updated.
+
+# Not a target:
+.DEFAULT:
+#  Implicit rule search has not been done.
+#  Modification time never checked.
+#  File has not been updated.
+
+# files hash-table stats:
+# Load=6/1024=1%, Rehash=0, Collisions=0/17=0%
+# VPATH Search Paths
+
+# No 'vpath' search paths.
+
+# No general ('VPATH' variable) search path.
+
+# strcache buffers: 1 (0) / strings = 17 / storage = 119 B / avg = 7 B
+# current buf: size = 8162 B / used = 119 B / count = 17 / avg = 7 B
+
+# strcache performance: lookups = 23 / hit rate = 26%
+# hash-table stats:
+# Load=17/8192=0%, Rehash=0, Collisions=2/23=9%
+# Finished Make data base on Fri Jun  4 14:19:01 2021
+
+ 
diff --git a/TP4/Makefile b/TP4/Makefile
new file mode 100644
index 0000000..ef20bbd
--- /dev/null
+++ b/TP4/Makefile
@@ -0,0 +1,12 @@
+CC = gcc
+SRC = *.c
+DEPS = *.h
+OBJ = *.o
+
+%.o: %.c $(DEPS)
+	$(CC) -c $(SRC)
+
+TP : $(OBJ)
+	$(CC) -o TP $(SRC)
+	./TP
+	rm TP $(OBJ)
\ No newline at end of file
diff --git a/TP4/TP.c b/TP4/TP.c
new file mode 100644
index 0000000..59dd86d
--- /dev/null
+++ b/TP4/TP.c
@@ -0,0 +1,185 @@
+#include "Tree.h"
+
+void print_tree(Tree* T){
+    if(T==NULL){
+        printf("[ ]\n");
+        return ;
+    }
+    printf("[ ");
+    Tree_stack P={NULL,0};
+    Tree* temp=T;
+    unsigned s = 0;
+    while(testNullTS(P)==0 || temp!=NULL)
+    {
+        if(temp!=NULL)
+        {
+            push(temp,&P);
+            temp=temp->left;
+        }
+        else
+        {
+            temp=pop(&P);
+            printf("%d ",temp->data);
+            temp=temp->right;
+        }
+    }
+    printf("]\n");
+    return;
+}
+
+//Ex1
+
+int max(int x, int y){
+    if(x>y)
+        return x;
+    return y;
+}
+
+int max_nodes(Tree* T){
+    if(testNull(T)){
+        return 0;
+    }
+    int lmax = max_nodes(left(T));
+    int rmax = max_nodes(right(T));
+    return max(lmax , rmax) + 1 ;
+}
+
+int tree_depth(Tree* T){
+    return max_nodes(T) - 1 ;
+}
+
+int tree_diameter(Tree* T){
+    if(testNull(T))
+        return 0;
+    int ltree = tree_diameter(left(T));
+    int rtree = tree_diameter(right(T));
+    return max(max_nodes(left(T)) + max_nodes(right(T)) + 1, max(ltree,rtree));
+}
+
+int leaf_sum(Tree* T){
+    if(T==NULL)
+        return 0;
+    Tree_stack P={NULL,0};
+    Tree* temp=T;
+    unsigned s = 0;
+    while(testNullTS(P)==0 || temp!=NULL)
+    {
+        if(temp!=NULL)
+        {
+            push(temp,&P);
+            temp=temp->left;
+        }
+        else
+        {
+            temp=pop(&P);
+            if(testNull(left(temp)) && testNull(right(temp)))
+                s+=temp->data;
+            temp=temp->right;
+        }
+    }
+    return s;
+}
+
+int leaf_sum_2(Tree* T){
+    if(testNull(T))
+        return 0;
+    if(testNull(left(T)) && testNull(right(T)))
+        return T->data;
+    return leaf_sum_2(left(T)) + leaf_sum_2(right(T));
+}
+
+//Ex2
+
+void insert_node(int x,Tree* T){
+    if(testNull(T)){
+        buildTree(x,NULL,NULL);
+        return;
+    }
+    Tree* temp = T;
+    while(!(testNull(left(temp))) || !(testNull(right(temp)))){
+        if(x<temp->data){
+            if(!testNull(left(temp)))
+                temp = temp->left;
+            else 
+                break;
+        }
+        else{
+            if(x>temp->data){
+                if(!testNull(right(temp)))
+                    temp = temp->right;
+                else 
+                    break;
+            }
+            else
+                return;
+        }
+    }
+    Tree* P=buildTree(x,NULL,NULL);
+    if(x<temp->data){
+        fixLeft(P,&temp);
+        return;
+    }
+    else{
+        if(x>temp->data){
+            fixRight(P,&temp);
+            return;
+        }
+        else{
+            return;
+        }
+    }
+}
+
+void search_Tree_IN(int x,Tree* T){
+    if(testNull(T)){
+        printf("The value %d doesn't exist\n",T->data);
+        return;
+    }
+    if(T->data == x){
+        printf("The value %d exists\n",T->data);
+        return;
+    }
+    if(T->data < x){
+        return search_Tree_IN(x,right(T));
+    }
+    if(T->data > x){
+        return search_Tree_IN(x,left(T));
+    }
+}
+
+int max_depth(Tree* T){
+    return tree_depth(T);
+}
+
+int tree_size(Tree* T){
+    if(testNull(T))
+        return 0;
+    return 1 + tree_size(left(T)) + tree_size(right(T));
+}
+
+int main(){
+    Tree* T1=NULL;
+    Tree* T2=NULL;
+    T1=buildTree(3,NULL,NULL);
+    T2=buildTree(7,NULL,NULL);
+    Tree* T=buildTree(5,T1,T2);
+    Tree* T3=NULL;
+    Tree* T4=NULL;
+    Tree* T5=buildTree(11,NULL,NULL);
+    Tree* T6=buildTree(15,NULL,NULL);
+    Tree* T7=buildTree(13,T5,T6);
+    T3=buildTree(0,NULL,T);
+    T4=buildTree(10,T3,T7);
+    printf("\n\n");
+    print_tree(T4);
+    //Ex1 
+    printf("The depth of the tree is %d\n",tree_depth(T4));
+    printf("The diameter of the tree is %d\n",tree_diameter(T4));
+    printf("The sum of the leaves in the tree is %d\n",leaf_sum_2(T4));
+    //Ex2
+    insert_node(4,T4);
+    print_tree(T4);
+    search_Tree_IN(15,T4);
+    printf("The tree size is %d\n",tree_size(T4));
+    return 0;
+}
\ No newline at end of file
diff --git a/TP4/Tree.c b/TP4/Tree.c
new file mode 100644
index 0000000..9271bc6
--- /dev/null
+++ b/TP4/Tree.c
@@ -0,0 +1,114 @@
+#include "Tree.h"
+
+Tree*  treeNull()
+{
+    Tree*  T=NULL;
+    return T;
+}
+
+bool testNull(Tree*  T)
+{
+    if(T==NULL)
+        return true;
+    return false;
+}
+
+ int root(Tree*  T)
+{
+    if(testNull(T))
+       exit(EXIT_FAILURE);
+    return T->data;
+}
+
+Tree* left(Tree*  T)
+{
+    if(testNull(T))
+        return NULL;
+    return T->left;
+}
+
+Tree* right(Tree*  T)
+{
+    if(testNull(T))
+        return NULL;
+    return T->right;
+}
+
+Tree*  buildTree(int x,Tree*  T_1,Tree*  T_2)
+{
+    Tree*  T=(Tree* )malloc(sizeof(Tree));
+    T->data=x;
+    T->left=T_1;
+    T->right=T_2;
+    return T;
+}
+
+void fixData(int x,Tree ** P)
+{
+    if(testNull(*P))
+        exit(EXIT_FAILURE);
+    else
+    {
+        (*P)->data=x;
+    }
+}
+
+void fixLeft(Tree * G, Tree ** P)
+{
+    if(testNull(*P))
+        exit(EXIT_FAILURE);
+    else
+    {
+        (*P)->left=G;
+    }
+}
+
+void fixRight(Tree * D, Tree ** P)
+{
+    if(testNull(*P))
+        exit(EXIT_FAILURE);
+    else
+    {
+        (*P)->right=D;
+    }
+}
+
+void freeTree(Tree ** T)
+{
+    Tree* temp=*T;
+    if(temp==NULL)
+        return;
+    if(temp->left!=NULL)
+        freeTree(&temp->left);
+    if(temp->right!=NULL)
+        freeTree(&temp->right);
+    free(temp);
+    *T=NULL;
+}
+
+bool testNullTS(Tree_stack P)
+{
+    if (P.length ==0)
+        return true;
+    return false;
+}
+
+void push(Tree* T,Tree_stack * P)
+{
+    if(P->length==N)
+    {
+        printf("Stack is empty.\n");
+        return;
+    }
+    P->head[P->length]=T;
+    P->length+=1;
+}
+
+Tree* pop(Tree_stack * P)
+{
+    if(testNullTS(*P))
+        return NULL;
+    Tree* T=P->head[P->length-1];
+    P->length-=1;
+    return T;
+}
\ No newline at end of file
diff --git a/TP4/Tree.h b/TP4/Tree.h
new file mode 100644
index 0000000..31c29eb
--- /dev/null
+++ b/TP4/Tree.h
@@ -0,0 +1,40 @@
+#ifndef TREE_H
+#define TREE_H
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdbool.h>
+
+typedef struct TreeNode {
+    int data;
+    struct TreeNode * left;
+    struct TreeNode * right;
+} Tree ;
+
+#define N 200
+
+typedef struct Tree_stack
+{
+    Tree* head[N];
+    unsigned length;
+} Tree_stack;
+
+
+//Tree functions
+Tree* treeNull();
+bool testNull(Tree*); /*Test if a tree is NULL*/
+int root(Tree*); /*Extract the root of the tree*/
+Tree* left(Tree*);/*Extract the left sub-tree*/
+Tree* right(Tree*); /*Extract the right sub-tree*/
+Tree* buildTree(int, Tree*,Tree*); /* Build a tree with a root data and two trees left and right*/
+void fixData(int, Tree **); /*Modify the root of the tree*/
+void fixLeft(Tree*, Tree **); /*Modify the left sub-tree*/
+void fixRight(Tree*, Tree **); /*Modify the right sub-tree*/
+void freeTree(Tree **); /*free the allocated memory for the tree*/
+
+//Tree_stack functions
+bool testNullTS(Tree_stack P);
+void push(Tree* T,Tree_stack* P);
+Tree* pop(Tree_stack* P);
+
+#endif
\ No newline at end of file