diff --git a/Makefile b/Makefile
new file mode 100644
index 0000000..946de2c
--- /dev/null
+++ b/Makefile
@@ -0,0 +1,18 @@
+ABC.exe:main.o big2.o fact.o rev.o pal.o add.o fib.o
+        gcc -o ABC.exe main.o big2.o fact.o rev.o pal.o add.o fib.o
+main.o:main.c
+        gcc -c main.c
+big2.o:big2.c
+        gcc -c big2.c
+fact.o:fact.c
+        gcc -c fact.c
+rev.o:rev.c
+        gcc -c rev.c
+pal.o:pal.c
+        gcc -c pal.c
+add.o:add.c
+        gcc -c add.c
+fib.o:fib.c
+        gcc -c fib.c
+clean:
+        rm -rf *.o ABC.exe
diff --git a/add.c b/add.c
new file mode 100644
index 0000000..c00b340
--- /dev/null
+++ b/add.c
@@ -0,0 +1,14 @@
+#include <stdio.h>
+addition() {
+
+    int number1, number2, sum;
+
+    printf("Enter two integers: ");
+    scanf("%d %d", &number1, &number2);
+
+    // calculate the sum
+    sum = number1 + number2;
+
+    printf("%d + %d = %d", number1, number2, sum);
+   //  return 0;
+}
diff --git a/big2.c b/big2.c
new file mode 100644
index 0000000..30bec31
--- /dev/null
+++ b/big2.c
@@ -0,0 +1,22 @@
+#include <stdio.h>
+biggest()
+{
+    int num1, num2;
+    // Ask user to enter the two numbers
+    printf("Please Enter Two different values\n");
+    // Read two numbers from the user
+    scanf("%d %d", &num1, &num2);
+    if(num1 > num2)
+    {
+        printf("%d is Largest\n", num1);
+    }
+    else if (num2 > num1)
+    {
+        printf("%d is Largest\n", num2);
+    }
+    else
+    {
+        printf("Both are Equal\n");
+    }
+   // return 0;
+}
diff --git a/fact.c b/fact.c
new file mode 100644
index 0000000..f4a44e5
--- /dev/null
+++ b/fact.c
@@ -0,0 +1,19 @@
+#include <stdio.h>
+ factorial() {
+    int n, i;
+    unsigned long long fact = 1;
+    printf("Enter an integer: ");
+    scanf("%d", &n);
+
+    // shows error if the user enters a negative integer
+    if (n < 0)
+        printf("Error! Factorial of a negative number doesn't exist.");
+    else {
+        for (i = 1; i <= n; ++i) {
+            fact *= i;
+        }
+        printf("Factorial of %d = %llu", n, fact);
+    }
+
+   // return 0;
+}
diff --git a/fib.c b/fib.c
new file mode 100644
index 0000000..c249e05
--- /dev/null
+++ b/fib.c
@@ -0,0 +1,28 @@
+#include <stdio.h>
+fibonacci() {
+
+  int i, n;
+
+  // initialize first and second terms
+  int t1 = 0, t2 = 1;
+
+  // initialize the next term (3rd term)
+  int nextTerm = t1 + t2;
+
+  // get no. of terms from user
+  printf("Enter the number of terms: ");
+  scanf("%d", &n);
+
+  // print the first two terms t1 and t2
+  printf("Fibonacci Series: %d, %d, ", t1, t2);
+
+  // print 3rd to nth terms
+  for (i = 3; i <= n; ++i) {
+    printf("%d, ", nextTerm);
+    t1 = t2;
+    t2 = nextTerm;
+    nextTerm = t1 + t2;
+  }
+
+ // return 0;
+}
diff --git a/main.c b/main.c
new file mode 100644
index 0000000..d43dc1d
--- /dev/null
+++ b/main.c
@@ -0,0 +1,8 @@
+main() {
+        biggest();
+        factorial();
+        reverse();
+        palindrome();
+        addition();
+        fibonacci();
+        }
diff --git a/pal.c b/pal.c
new file mode 100644
index 0000000..e96b5b3
--- /dev/null
+++ b/pal.c
@@ -0,0 +1,22 @@
+#include <stdio.h>
+palindrome() {
+  int n, reversed = 0, remainder, original;
+    printf("Enter an integer: ");
+    scanf("%d", &n);
+    original = n;
+
+    // reversed integer is stored in reversed variable
+    while (n != 0) {
+        remainder = n % 10;
+        reversed = reversed * 10 + remainder;
+        n /= 10;
+    }
+
+    // palindrome if orignal and reversed are equal
+    if (original == reversed)
+        printf("%d is a palindrome.", original);
+    else
+        printf("%d is not a palindrome.", original);
+
+    //  return 0;
+}
diff --git a/rev.c b/rev.c
new file mode 100644
index 0000000..c4e5a0b
--- /dev/null
+++ b/rev.c
@@ -0,0 +1,23 @@
+#include <stdio.h>
+reverse()
+{
+  char str[1000], rev[1000];
+  int i, j, count = 0;
+printf("\nEnter string to reverse");
+  scanf("%s", str);
+  printf("\nString Before Reverse: %s", str);
+  //finding the length of the string
+  while (str[count] != '\0')
+  {
+    count++;
+  }
+  j = count - 1;
+
+  //reversing the string by swapping
+  for (i = 0; i < count; i++)
+  {
+    rev[i] = str[j];
+    j--;
+  }
+
+  printf("\nString After Reverse: %s\n", rev);