Hassan Muavia

Hassan_Muavia/Day01/Day01_experiment1.c

@@ -0,0 +1,363 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<string.h>
+#include<math.h>
+#include<time.h>
+
+// size of the data types
+void task01_datatypes(){
+    int a = 11;
+    float b = 1.567;
+    double c = 2.111344;
+    char g = 'A';
+    printf("size: %d bytes\n",sizeof(a));   //size of int
+    printf("size: %d bytes\n",sizeof(b));   //size of float
+    printf("size: %d bytes\n",sizeof(c));   //size of double
+    printf("size: %d bytes\n",sizeof(g));   //size of char
+
+    int m = (int)(a/b);                     //type casting
+    printf("value of m: %d",m);
+    float n = (float)a/b;
+    printf("\nvalue of n: %f",n);          // type casting
+}
+
+
+// calculator
+void task02_calculator(){
+    int num1,num2;
+    char p;
+    printf("Enter the integers: ");
+    scanf("%d %c %d",&num1,&p,&num2);
+
+
+    switch(p){
+        case '+':
+            printf("sum is: %d",num1+num2);     //addition
+            break;
+        case '-':
+            printf("difference is: %d",num1-num2);  //subtraction
+            break;
+        case '*':
+            printf("multiplication is: %d",num1*num2);  //multiplication
+            break;
+        case '/':
+            printf("division is: %d",num1/num2);        //division
+            break;
+        case '%':
+            printf("modulus is: %d",num1%num2);     //modulus
+            break;
+        default:
+            printf("Invalid operator!");            //invalid operator
+    }
+}
+
+
+// fibonacci sequence
+
+void task03_fibonacci(){
+    int a = 0;
+    int b = 1;
+    int next = 0;
+    int n;
+    printf("Enter the number of terms: ");          //number of fibonacci terms
+    scanf("%d",&n);
+    printf("The numbers are:0 1 ");
+    for (int i=2;i<n;i++){
+        next = a + b;                               //next term
+        printf("%d ",next);
+        a = b;                                      //update a and b
+        b = next;
+
+    }
+}
+
+
+//guessing game
+
+void task03_guessing_game() {
+    srand(time(0));                         //ensures different random number each time
+    int randomNum = (rand() % 100) + 1;     //numbers between 1 and 100
+
+    int a;                                  //user number
+
+    printf("Guess a number between 1 and 100: ");
+    scanf("%d", &a);
+
+    while (a != randomNum) {
+        if (a > randomNum && a - randomNum > 30) {
+            printf("Too high! Try again: ");
+        } 
+        else if (a < randomNum && randomNum - a > 30) {
+            printf("Too low! Try again: ");
+        } 
+        else if (a > randomNum) {
+            printf("High, but close! Try again: ");
+        } 
+        else {
+            printf("Low, but close! Try again: ");
+        }
+
+        scanf("%d", &a);
+    }
+
+    printf(" Congratulations! You guessed the number %d correctly!\n", randomNum);
+}
+
+
+// prime numbers between 1 and 100
+
+int isPrime(int n) {
+    int divisors = 0;                   //divisors, how many divisors the number have
+    if (n == 1 || n == 2){
+        return 1;
+    }
+    else{
+        for(int i = 1;i<=n;i++){
+            if((n%i) == 0){
+                divisors += 1;
+            }
+            else{
+                divisors = divisors;
+            }
+        }
+        if (divisors > 2){
+            return 0;
+        }
+        else{
+            return 1;
+        }
+    }
+}
+
+
+//prime numbers between 1 and 100
+
+void task04_prime_numbers() {
+    printf("Prime numbers between 1 and 100:\n");
+    for (int i = 1; i <= 100; i++) {
+        if (isPrime(i)) {
+            printf("%d ", i);
+        }
+    }
+    printf("\n");
+}
+
+
+//factorial of a number using recursive method
+
+int factorial(int n) {
+    if (n == 0 || n == 1) 
+        return 1;
+    return n * factorial(n - 1);
+}
+
+
+//reverse string problem
+
+void task05_reverse_string() {
+    char str[100];
+    int len = 0;
+
+    printf("Enter a string: ");
+    scanf("%s", str);  
+
+
+    while (str[len] != '\0') {
+        len++;
+    }
+
+
+    for (int i = 0; i < len / 2; i++) {
+        char temp = str[i];                 //string 1st character to a temp variable
+        str[i] = str[len - i - 1];          //giving last character to 1st index of string
+        str[len - i - 1] = temp;            //1st character will go to last index
+    }
+
+    printf("Reversed string: %s\n", str);   // printing reversed string
+}
+
+
+//second largest element in array
+
+void task05_second_largest() {
+    int arr[] = {5, 12, 7, 20, 9}; 
+    int n = sizeof(arr) / sizeof(arr[0]);     // number of elements in array
+
+    int max1 = arr[0], max2 = arr[0];
+
+    for (int i = 1; i < n; i++) {
+        if (arr[i] > max1) {                // i-th element is greater than max1,arr[0]?
+            max2 = max1;
+            max1 = arr[i];
+        } else if (arr[i] > max2 && arr[i] != max1) {     // check if arr[i] > max2 and it is less than max1, max2 = arr[i]
+            max2 = arr[i];
+        }
+    }
+
+    printf("Second largest = %d\n", max2);
+}
+
+
+//text file processing
+
+void task06_file_io() {
+    int num[5];
+    FILE *file;                                             // file is of type FILE, it will point to a doc file
+
+    file = fopen("example.txt", "w");                       //open that file to write something  'w'
+    if (file == NULL) {
+        printf("Error opening file for writing\n");
+        return;
+    }
+
+    for (int i = 0; i < 5; i++) {
+        fprintf(file, "%d\n", i);                           //fprintf is to write in file
+    }
+    fclose(file);                                           //close the file
+
+    // READ FILE
+
+    file = fopen("example.txt", "r");                       // open file to read the content 'r'
+    if (file == NULL) {
+        printf("Error opening file for reading\n");
+        return;
+    }
+
+    printf("Numbers read from file:\n");
+    for (int j = 0; j < 5; j++) {
+        fscanf(file, "%d", &num[j]);                        //fscanf is to read the content
+        printf("%d\n", num[j]);
+    }
+    fclose(file);                                           //close file
+}
+
+
+// manipulation of bit-wise operators
+
+void task07_bitwise_ops() {
+    // TODO: Demonstrate AND, OR, XOR, NOT, shifts
+    // Bonus: Check if number is power of 2
+    int a=7;
+    int b=4;
+
+    printf("a&b: %d\n",a&b);        //AND operation
+    printf("a|b: %d\n",a|b);        //OR operation
+    printf("a^b: %d\n",a^b);        //XOR operation
+    printf("~a: %d\n",~a);          //NOT operation
+    printf("a<<1: %d\n",a<<1);      //left shift
+    printf("a>>1: %d\n",a>>1);      //right shift
+
+}
+
+
+// check whether number is power of 2 or not using bitwise operators
+
+void power(int n){
+    if ((n & (n-1))==0){
+        printf("number is power of 2");
+    }
+    else{
+        printf("number is not power of 2");
+    }
+}
+
+
+// Enumerations
+
+void task08_enum_weekday() {
+    // TODO: Map number (1–7) to day of week using enum
+    enum weekday{MONDAY=1,TUESDAY,WEDNESDAY,THURSDAY,FRIDAY,SATURDAY,SUNDAY};
+    int num;
+    printf("Enter the number: ");
+    scanf("%d",&num);
+    if (num>=1 && num<=7){
+        enum weekday day = num;             // day is of type enum , num is user input 
+        switch (day)
+        {
+        case MONDAY:
+            printf(" MONDAY");
+            break;
+        case TUESDAY:
+            printf(" TUESDAY");
+            break;
+        case WEDNESDAY:
+            printf(" WEDNESDAY");
+            break;
+        case THURSDAY:
+            printf(" THURSDAY");
+            break;
+        case FRIDAY:
+            printf(" FRIDAY");
+            break;
+        case SATURDAY:
+            printf(" SATURDAY");
+            break;
+        case SUNDAY:
+            printf(" SUNDAY");
+            break;
+        default:
+            break;
+        }
+    }
+}
+
+
+// Euclidean distance between two points
+
+struct Point {
+    int x;
+    int y;
+};
+
+void task09_struct_distance() {
+    // TODO: Take two points and calculate Euclidean distance
+    struct Point p1;
+    struct Point p2;
+    float distance;
+
+    printf("enter 1st point: ");
+    scanf("%d %d",&p1.x,&p1.y);             // taking x and y value of p1 point
+    printf("enter 2nd point: ");
+    scanf("%d %d",&p2.x,&p2.y);             // taking x and y value of p2 point
+
+    distance = sqrt((p2.x-p1.x)*(p2.x-p1.x)+(p2.y-p1.y)*(p2.y-p1.y));  // distance formula
+
+    printf("distance: %f",distance);
+}
+
+// ======================= Task 0.10 =======================
+void task10_cmd_args(int argc, char *argv[]) {
+    // TODO: Take 2 integers as command line args and print sum
+
+    // argc is number of arguments
+    // argv is array of strings
+
+    if (argc == 3){
+        int num1 = atoi(argv[1]);        // ASCII to integer of argument 1 arg[0] is file name
+        int num2 = atoi(argv[2]);
+        int sum = num1+num2;
+        printf("sum is %d",sum);
+    }
+    else {
+        printf("arguments are not complete");
+    }
+}
+int main(int argc, char *argv[]){
+
+    //task01_datatypes();
+    //task02_calculator();
+    //task03_fibonacci();
+    //task03_guessing_game();
+    //task04_prime_numbers();
+    //task05_second_largest();
+    //task05_reverse_string();
+    //task06_file_io();
+    //task07_bitwise_ops();
+    //task08_enum_weekday();
+    //task09_struct_distance();
+    task10_cmd_args(argc,argv);
+    //power(12);
+    //isPrime(23);
+
+    return 0;
+}

Hassan_Muavia/Day01/README.md

@@ -0,0 +1,33 @@
+# Day 1 – C Language Experiments  
+
+This directory contains my **Day 1 experiments in C programming**, covering basics like data types, operators, control structures, recursion, file handling, bitwise operations, enums, structs, and command-line arguments.  
+
+## Contents  
+
+All tasks are implemented in a **single C file**. You can comment/uncomment function calls in `main()` to run a specific task.  
+
+### Implemented Tasks  
+
+1. **Data Types & Type Casting** – Print sizes of types and demonstrate type casting.  
+2. **Calculator** – Basic calculator using `switch-case`.  
+3. **Fibonacci Sequence** – Generate Fibonacci numbers.  
+4. **Guessing Game** – Random number guessing with hints.  
+5. **Prime Numbers (1–100)** – Print all primes between 1 and 100.  
+6. **Factorial (Recursion)** – Recursive factorial function.  
+7. **Reverse String** – Reverse user input string.  
+8. **Second Largest Element in Array** – Find second largest element.  
+9. **File I/O** – Write and read integers from a file.  
+10. **Bitwise Operators** – AND, OR, XOR, NOT, shifts.  
+11. **Check Power of 2** – Using bitwise trick `n & (n-1)`.  
+12. **Enum – Days of Week** – Map number to weekday.  
+13. **Struct – Euclidean Distance** – Calculate distance between two points.  
+14. **Command-Line Arguments** – Sum two integers passed via command line.  
+
+---
+
+##  How to Compile and Run  
+
+### Compile
+```bash
+gcc Day01_experiment1.c -o day1
+./day1 5 7