Create testfile

big2.c

@@ -0,0 +1,22 @@
+#include <stdio.h>
+
+// int main()
+void big2()
+{
+    int num1, num2;
+
+    printf("\n Enter two integers :\n");
+    scanf("%d%d", &num1, &num2);
+
+    if (num1 > num2)
+    {
+        printf("Largest number is %d.", num1);
+    }
+    else
+    {
+        printf("Largest number is %d.", num2);
+    }
+
+  //  return 0;
+}
+

big3.c

@@ -0,0 +1,21 @@
+#include <stdio.h>
+// int main() {
+void big3() {
+    double n1, n2, n3;
+    printf("\n Enter three different numbers\n: ");
+    scanf("%lf %lf %lf", &n1, &n2, &n3);
+
+    // if n1 is greater than both n2 and n3, n1 is the largest
+    if (n1 >= n2 && n1 >= n3)
+        printf("%.2f is the largest number.", n1);
+
+    // if n2 is greater than both n1 and n3, n2 is the largest
+    if (n2 >= n1 && n2 >= n3)
+        printf("%.2f is the largest number.", n2);
+
+    // if n3 is greater than both n1 and n2, n3 is the largest
+    if (n3 >= n1 && n3 >= n2)
+        printf("%.2f is the largest number.", n3);
+
+  //  return 0;
+}

factorial.c

@@ -0,0 +1,20 @@
+#include <stdio.h>
+// int main() {
+void fact() {
+    int n, i;
+    unsigned long long fact = 1;
+    printf("\n Enter an integer:\n");
+    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;
+}

main.c

@@ -0,0 +1,11 @@
+#include<stdio.h>
+#include<string.h>
+main(){
+big2();
+big3();
+fact();
+pali();
+prime();
+rev();
+}
+

makefile

@@ -0,0 +1,18 @@
+XYZ.exe:main.o big2.o big3.o factorial.o pali.o prime.o reverse.o
+	gcc -o XYZ.exe main.o big2.o big3.o factorial.o pali.o prime.o reverse.o
+main.o:main.c
+	gcc -c main.c
+big2.o:big2.c
+	gcc -c big2.c
+big3.o:big3.c
+	gcc -c big3.c
+factorial.o:factorial.c
+	gcc -c factorial.c
+pali.o:pali.c
+	gcc -c pali.c
+prime.o:prime.c
+	gcc -c prime.c
+reverse.o:reverse.c
+	gcc -c reverse.c
+
+

pali.c

@@ -0,0 +1,23 @@
+#include <stdio.h>
+// int main() {
+void pali() {
+    int n, reversedN = 0, remainder, originalN;
+    printf("\n Enter an integer: \n");
+    scanf("%d", &n);
+    originalN = n;
+
+    // reversed integer is stored in reversedN
+    while (n != 0) {
+        remainder = n % 10;
+        reversedN = reversedN * 10 + remainder;
+        n /= 10;
+    }
+
+    // palindrome if orignalN and reversedN are equal
+    if (originalN == reversedN)
+        printf("%d is a palindrome.", originalN);
+    else
+        printf("%d is not a palindrome.", originalN);
+
+  //  return 0;
+}

prime.c

@@ -0,0 +1,28 @@
+#include <stdio.h>
+// int main() {
+void prime() {
+    int n, i, flag = 0;
+    printf("\n Enter a positive integer: \n");
+    scanf("%d", &n);
+
+    for (i = 2; i <= n / 2; ++i) {
+
+        // condition for non-prime
+        if (n % i == 0) {
+            flag = 1;
+            break;
+        }
+    }
+
+    if (n == 1) {
+        printf("1 is neither prime nor composite.");
+    }
+    else {
+        if (flag == 0)
+            printf("%d is a prime number.", n);
+        else
+            printf("%d is not a prime number.", n);
+    }
+
+ //   return 0;
+}

reverse.c

@@ -0,0 +1,21 @@
+#include<stdio.h>
+void  rev()
+{
+    int i, j, k;
+    char str[100];
+    char rev[100];
+    printf("\n Enter a string:\t");
+    scanf("%s", str);
+    printf("The original string is %s\n", str);
+    for(i = 0; str[i] != '\0'; i++);
+    {
+        k = i-1;
+    }
+    for(j = 0; j <= i-1; j++)
+    {
+        rev[j] = str[k];
+        k--;
+    }
+    printf("The reverse string is %s\n", rev);
+//    getch();
+}

testfile

@@ -0,0 +1 @@
+hi