fresh

Author: nalladev

s2/c/00.hello_world.c

@@ -0,0 +1,12 @@
+#include <stdio.h>
+
+int main() {
+    printf("Hello world\n");
+    return 0;
+}
+
+/* Algorithm
+Step 1: Start
+Step 2: Display "Hello world" to the console.
+Step 3: Stop
+*/

s2/c/01.sum_2_num.c

@@ -0,0 +1,25 @@
+#include <stdio.h>
+
+int main() {
+    int num1, num2;
+
+    printf("Enter the 1st number: ");
+    scanf("%d", &num1);
+    printf("Enter the 2nd number: ");
+    scanf("%d", &num2);
+
+    printf("%d + %d = %d\n", num1, num2, num1 + num2);
+
+    return 0;
+}
+
+
+/*Algorithm
+Step 1: Start
+Step 2: Declare variables num1, num2 and sum. 
+Step 3: Read values num1 and num2. 
+Step 4: Add num1 and num2 and assign the result to sum.
+        sum ← num1+num2 
+Step 5: Display sum 
+Step 6: Stop
+*/

s2/c/02.area_circle.c

@@ -0,0 +1,24 @@
+#include <stdio.h>
+#define PI 3.14
+
+int main() {
+    float r, area;
+
+    printf("Enter radius of the circle: ");
+    scanf("%f", &r);
+    area = PI * r * r;
+    printf("The area of the circle is %f\n", area);
+
+    return 0;
+}
+
+/*Algorithm
+Step 1: Start
+Step 2: Define constant PI = 3.14.
+Step 3: Declare variables r and area.
+Step 4: Read value of r.
+Step 5: Calculate area (PI * r * r) and assign the value to area.
+        area ← PI * r * r
+Step 6: Display the area
+Step 7: Stop
+*/

s2/c/03.expression.c

@@ -0,0 +1,23 @@
+#include <stdio.h>
+
+int main() {
+    int a, b, c, d, e, f, g, result;
+
+    printf("Enter the values of a, b, c, d, e, f and g :");
+    scanf("%d%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f, &g);
+
+    result = ((a-b/c*d+e)*(f+g));
+    
+    printf("Result of ((a-b/c+d+e)*(f+g)) = %d\n", result);
+    return 0;
+}
+
+/*Algorithm
+Step 1: Start
+Step 2: Declare variables a, b, c, d, e, f, g and result.
+Step 3: Read values of a, b, c, d, e, f and g.
+Step 4: Calculate expression ((a-b/c*d+e)*(f+g)) and assign the value to result.
+        result ← ((a-b/c*d+e)*(f+g))
+Step 5: Display the result
+Step 6: Stop
+*/

s2/c/04.largest_of_3.c

@@ -0,0 +1,34 @@
+#include <stdio.h>
+
+int main() {
+    int a, b, c, largest;
+
+    printf("Enter 3 numbers: ");
+    scanf("%d%d%d", &a, &b, &c);
+
+    if (a >= b && a >= c) {
+        largest = a;
+    } else if (b >= a && b >= c) {
+        largest = b;
+    } else {
+        largest = c;
+    }
+
+    printf("The largest number is %d\n", largest);
+
+    return 0;
+}
+
+/*Algorithm
+Step 1: Start
+Step 2: Declare variables a, b, c and largest.
+Step 3: Read values of a, b and c.
+Step 4: if a >= b && a >= c 
+          largest ← a;
+        else if b >= a && b >= c
+          largest ← b;
+        else 
+          largest ← c;
+Step 5: Display the largest
+Step 6: Stop
+*/

s2/c/05.prime_check.c

@@ -0,0 +1,48 @@
+#include <stdio.h>
+#include <math.h>
+
+int main()
+{
+    int num, i, isPrime = 1;
+
+    printf("Enter a number: ");
+    scanf("%d", &num);
+
+    if (num <= 1)
+        isPrime = 0;
+    else
+        for (i = 2; i <= sqrt(num); i++)
+        {
+            if (num % i == 0)
+            {
+                isPrime = 0;
+                break;
+            }
+        }
+
+    if (isPrime)
+        printf("%d is a prime number\n", num);
+    else
+        printf("%d is not a prime number\n", num);
+
+    return 0;
+}
+
+/*Algorithm
+Step 1: Start
+Step 2: Declare variables num, i and isPrime.
+Step 3: Initialize variables
+        isPrime ← 1
+        i ← 2
+Step 4: Read num from the user.
+Step 5: Repeat the steps until i<=sqrt(num)
+     5.1 If remainder of num÷i equals 0
+            isPrime ← 0
+            Go to step 6
+     5.2 i ← i+1
+Step 6: If isPrime = 0
+           Display num is not prime
+        else
+           Display num is prime
+Step 7: Stop
+*/

s2/c/06.armstrong_check.c

@@ -0,0 +1,54 @@
+#include <stdio.h>
+#include <math.h>
+
+int main() {
+    int num, tempNum, remainder, result = 0, d = 0;
+
+    printf("Enter an integer: ");
+    scanf("%d", &num);
+
+    tempNum = num;
+
+    while (tempNum != 0) {
+        tempNum /= 10;
+        d++;
+    }
+
+    tempNum = num;
+
+    while (tempNum != 0) {
+        remainder = tempNum % 10;
+        result += pow(remainder, d);
+        tempNum /= 10;
+    }
+
+    if (result == num) printf("%d is an Armstrong number.\n", num);
+    else printf("%d is not an Armstrong number.\n", num);
+
+    return 0;
+}
+
+
+
+/*Algorithm
+Step 1: Start
+Step 2: Declare variables num, tempNum, remainder, d and result.
+Step 3: Initialize variables
+        result ← 0
+        d ← 0  
+Step 4: Read num from the user.
+Step 5: tempNum  num
+Step 6: Repeat the steps until tempNum != 0
+     6.1 tempNum ← tempNum/10
+     6.2 d ← d+1
+Step 7: tempNum ← num
+Step 8: Repeat the steps until tempNum != 0
+     8.1 remainder ← tempNum%10
+     8.2 result ← result + pow(remainder, d);
+     8.3 tempNum ← tempNum/10
+Step 9: If result == num
+           Display num is an Armstrong number.
+        else
+           Display num is not an Armstrong number.
+Step 10: Stop 
+*/

s2/c/07.arr_sum_avg.c

@@ -0,0 +1,41 @@
+#include <stdio.h>
+
+int main() {
+    int n, i;
+    float sum = 0, average;
+
+    printf("Enter the size of the array: ");
+    scanf("%d", &n);
+
+    int arr[n];
+
+    printf("Enter array elements:\n");
+    for (i = 0; i < n; i++) {
+        printf("%d : ", i + 1);
+        scanf("%d", &arr[i]);
+        sum += arr[i];
+    }
+
+    average = sum / n;
+
+    printf("Sum of the numbers: %f\n", sum);
+    printf("Average of the numbers: %f\n", average);
+
+    return 0;
+}
+
+/*Algorithm
+Step 1: Start
+Step 2: Declare variables n, i, sum and average.
+Step 3: Initialize variables
+        sum ← 0
+Step 4: Read n from the user.
+Step 5: Declare array arr with size n
+Step 6: Read elements of arr from the user.
+Step 7: Repeat the steps until i < n
+     7.1 sum ← sum + arr[i]
+     7.2 i ← i+1
+Step 8: average ← sum / n
+Step 9: Display sum and average.
+Step 10: Stop 
+*/

s2/c/08.arr_linear_search.c

@@ -0,0 +1,52 @@
+#include <stdio.h>
+
+int main() {
+    int n, key, found, index;
+
+    printf("Enter the size of array: ");
+    scanf("%d", &n);
+
+    int arr[n];
+
+    printf("Enter array elements:\n");
+    for (int i = 0; i < n; i++) {
+        printf("%d : ", i + 1);
+        scanf("%d", &arr[i]);
+    }
+
+    printf("Enter the element to search: ");
+    scanf("%d", &key);
+
+    for (int i = 0; i < n; i++) {
+        if (arr[i] == key) {
+            found = 1;
+            index = i;
+            break;
+        }
+    }
+
+    if (found) printf("Element %d found at index %d\n", key, index);
+    else printf("Element %d not found in the array\n", key);
+
+    return 0;
+}
+
+/*Algorithm
+Step 1: Start
+Step 2: Declare variables n, i = 0, key, found and index.
+Step 3: Read n from the user.
+Step 4: Declare array arr with size n.
+Step 5: Read elements of arr from the user.
+Step 6: Read key from the user.
+Step 7: Repeat the steps until i < n
+     7.1 If arr[i] == key
+            found ← 1
+            index ← i
+            Go to step 8
+     7.2 i ← i+1
+Step 8: If found
+           Display Element found
+        else
+           Display Element not found
+Step 9: Stop 
+*/

s2/c/09.arr_bubble_sort.c

@@ -0,0 +1,54 @@
+#include <stdio.h>
+
+int main() {
+    int n, i, j;
+
+    printf("Enter the size of array: ");
+    scanf("%d", &n);
+
+    int arr[n];
+
+    printf("Enter array elements:\n");
+    for (int i = 0; i < n; i++) {
+        printf("%d : ", i + 1);
+        scanf("%d", &arr[i]);
+    }
+
+    for (i = 0; i < n - 1; i++) {
+        for (j = 0; j < n - i - 1; j++) {
+            if (arr[j] > arr[j + 1]) {
+                int temp = arr[j];
+                arr[j] = arr[j + 1];
+                arr[j + 1] = temp;
+            }
+        }
+    }
+
+    printf("Sorted array in ascending order: ");
+    for (int i = 0; i < n; i++) {
+        printf("%d, ", arr[i]);
+    }
+    printf("\n");
+
+    return 0;
+}
+
+/*Algorithm
+Step 1: Start
+Step 2: Declare variable n, temp, i and j.
+Step 3: Initialize variables
+        i, j ← 0
+Step 4: Read n from the user.
+Step 5: Declare array arr with size n
+Step 6: Read elements of arr from the user.
+Step 7: Repeat the steps until i < n-1
+     7.1 Repeat the steps until j < n-i-1
+     7.1.1 If arr[j] > arr[j + 1]
+            temp ← arr[j]
+            arr[j] ← arr[j + 1]
+            arr[j + 1] ← temp
+     7.1.2 j ← j+1
+     7.2 i ← i+1
+Step 8: Display sorted arr.
+Step 9: Stop 
+*/