🧪 Practice Problems Answer Day 2 DSA with C

 

---

✅ 1. Find Maximum and Minimum in an Array

#include <stdio.h>

int main() {
    int n, i;
    int arr[100], max, min;

    printf("Enter number of elements: ");
    scanf("%d", &n);

    printf("Enter %d elements:\n", n);
    for (i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    max = min = arr[0];

    for (i = 1; i < n; i++) {
        if (arr[i] > max)
            max = arr[i];
        if (arr[i] < min)
            min = arr[i];
    }

    printf("Maximum: %d\n", max);
    printf("Minimum: %d\n", min);

    return 0;
}

---

✅ 2. Count Occurrences of a Given Number

#include <stdio.h>

int main() {
    int n, x, count = 0;
    int arr[100];

    printf("Enter number of elements: ");
    scanf("%d", &n);

    printf("Enter %d elements:\n", n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    printf("Enter number to count: ");
    scanf("%d", &x);

    for (int i = 0; i < n; i++) {
        if (arr[i] == x)
            count++;
    }

    printf("Number %d appears %d time(s).\n", x, count);

    return 0;
}

---

✅ 3. Reverse an Array

#include <stdio.h>

int main() {
    int n, arr[100];

    printf("Enter number of elements: ");
    scanf("%d", &n);

    printf("Enter %d elements:\n", n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    printf("Reversed array:\n");
    for (int i = n - 1; i >= 0; i--) {
        printf("%d ", arr[i]);
    }

    return 0;
}

---

📘 Homework

---

✅ 4. Copy One Array to Another

#include <stdio.h>

int main() {
    int n, arr1[100], arr2[100];

    printf("Enter number of elements: ");
    scanf("%d", &n);

    printf("Enter %d elements for arr1:\n", n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr1[i]);
        arr2[i] = arr1[i];  // Copying
    }

    printf("Copied array (arr2):\n");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr2[i]);
    }

    return 0;
}

---

✅ 5. Merge Two Arrays

#include <stdio.h>

int main() {
    int arr1[50], arr2[50], merged[100];
    int n1, n2, i;

    printf("Enter number of elements in arr1: ");
    scanf("%d", &n1);
    printf("Enter %d elements for arr1:\n", n1);
    for (i = 0; i < n1; i++)
        scanf("%d", &arr1[i]);

    printf("Enter number of elements in arr2: ");
    scanf("%d", &n2);
    printf("Enter %d elements for arr2:\n", n2);
    for (i = 0; i < n2; i++)
        scanf("%d", &arr2[i]);

    for (i = 0; i < n1; i++)
        merged[i] = arr1[i];
    for (i = 0; i < n2; i++)
        merged[n1 + i] = arr2[i];

    printf("Merged array:\n");
    for (i = 0; i < n1 + n2; i++)
        printf("%d ", merged[i]);

    return 0;
}