A looping statement, also known as an iteration statement, enables a block of code to be executed repeatedly based on a specified condition. Its primary function is to automate repetitive tasks, process collections of data, and reduce code redundancy by controlling the flow of execution to re-run instructions multiple times until a termination condition is met.

Different looping statements are utilized based on specific requirements, such as whether the number of iterations is known in advance or if the loop must execute at least once.

Different Looping Statements

1. for loop

   • Description: The for loop is typically used when the number of iterations is known or can be determined before the loop begins. It integrates the initialization, condition check, and iteration update (increment/decrement) into a single line, making it concise for count-controlled loops or iterating over sequences.
   • Execution Flow:
     1. Initialization: Executed once at the beginning of the loop.
     2. Condition: Evaluated before each iteration. If true, the loop body executes; otherwise, the loop terminates.
     3. Body Execution: The statements within the loop body are executed.
     4. Update: The iteration variable is updated (incremented or decremented).
     5. Steps 2-4 repeat until the condition becomes false.
   • General Syntax (C-like):

     for (initialization; condition; increment/decrement) {
         // statements to be executed
     }
     

   • Example (Printing numbers from 1 to 5):

     #include <stdio.h>
     
     int main() {
         for (int i = 1; i <= 5; i++) {
             printf("%d\n", i);
         }
         return 0;
     }
     

     Output:
     1
     2
     3
     4
     5

2. while loop

   • Description: The while loop is used when the number of iterations is not known in advance, and the loop continues as long as a specified condition remains true. The condition is evaluated before each execution of the loop body. If the condition is initially false, the loop body will not execute even once.
   • Execution Flow:
     1. Condition: Evaluated at the start of each iteration.
     2. If the condition is true, the loop body executes.
     3. If the condition is false, the loop terminates.
     4. It is crucial to include a statement within the loop body that eventually makes the condition false to prevent an infinite loop.
   • General Syntax (C-like):

     while (condition) {
         // statements to be executed
         // update statement to affect the condition
     }
     

   • Example (Printing numbers from 1 to 5):

     #include <stdio.h>
     
     int main() {
         int i = 1; // Initialization
         while (i <= 5) { // Condition
             printf("%d\n", i);
             i++; // Update statement
         }
         return 0;
     }
     

     Output:
     1
     2
     3
     4
     5

3. do-while loop

   • Description: The do-while loop is similar to the while loop, but with one key difference: the loop body is guaranteed to execute at least once. This is because the condition is evaluated after the first execution of the loop body. It is suitable for scenarios where an action must be performed regardless of the initial state of the condition, such as user input validation.
   • Execution Flow:
     1. Body Execution: The statements within the loop body are executed for the first time.
     2. Condition: Evaluated after the first execution.
     3. If the condition is true, the loop iterates again (steps 1-2 repeat).
     4. If the condition is false, the loop terminates.
   • General Syntax (C-like):

     do {
         // statements to be executed
         // update statement to affect the condition
     } while (condition);
     

   • Example (Printing numbers from 1 to 5):

     #include <stdio.h>
     
     int main() {
         int i = 1; // Initialization
         do {
             printf("%d\n", i);
             i++; // Update statement
         } while (i <= 5); // Condition
         return 0;
     }
     

     Output:
     1
     2
     3
     4
     5
   • Example (Demonstrating at least one execution):

     #include <stdio.h>
     
     int main() {
         int x = 10;
         do {
             printf("This message prints at least once. Current x: %d\n", x);
             x++;
         } while (x < 10); // Condition is false (11 < 10 is false)
         return 0;
     }
     

     Output:
     This message prints at least once. Current x: 10

An array is a collection of homogeneous (same type) data items stored at contiguous memory locations. It is a fundamental data structure where elements are accessed directly using an index or subscript.

Benefits of using arrays:

• Efficient Storage of Multiple Values: Arrays allow storing a large number of values of the same data type under a single variable name, simplifying data management.
• Random Access: Elements can be accessed directly using their index, providing constant time complexity (O(1)) for retrieval or modification of any element.
• Memory Locality: Since elements are stored contiguously in memory, arrays often exhibit good cache performance, which can lead to faster program execution.
• Ease of Traversal: Iterating through all elements in an array is straightforward using loops, making operations like searching, sorting, and processing entire datasets simpler.
• Foundation for Other Data Structures: Arrays serve as the building blocks for more complex data structures like stacks, queues, hash tables, heaps, and matrices.
• Code Readability and Maintainability: Using arrays reduces the need for declaring numerous individual variables, making code cleaner and easier to understand.

Program to add two matrices using array:

#include <stdio.h>

int main() {
    int rows, cols;

    // Get dimensions of matrices from the user
    printf("Enter the number of rows for the matrices: ");
    scanf("%d", &rows);
    printf("Enter the number of columns for the matrices: ");
    scanf("%d", &cols);

    // Declare three 2D arrays (matrices)
    // matrixA and matrixB for input, matrixC for the result
    int matrixA[rows][cols];
    int matrixB[rows][cols];
    int matrixC[rows][cols];

    // Input elements for Matrix A
    printf("\nEnter elements for Matrix A:\n");
    for (int i = 0; i < rows; i++) {
        for (int j = 0; j < cols; j++) {
            printf("Enter element A[%d][%d]: ", i, j);
            scanf("%d", &matrixA[i][j]);
        }
    }

    // Input elements for Matrix B
    printf("\nEnter elements for Matrix B:\n");
    for (int i = 0; i < rows; i++) {
        for (int j = 0; j < cols; j++) {
            printf("Enter element B[%d][%d]: ", i, j);
            scanf("%d", &matrixB[i][j]);
        }
    }

    // Perform matrix addition
    // Each element of matrixC is the sum of corresponding elements from matrixA and matrixB
    for (int i = 0; i < rows; i++) {
        for (int j = 0; j < cols; j++) {
            matrixC[i][j] = matrixA[i][j] + matrixB[i][j];
        }
    }

    // Display the resultant matrix
    printf("\nResultant Matrix (A + B):\n");
    for (int i = 0; i < rows; i++) {
        for (int j = 0; j < cols; j++) {
            printf("%d\t", matrixC[i][j]); // Print element followed by a tab
        }
        printf("\n"); // Move to the next line after printing all columns of a row
    }

    return 0; // Indicate successful program execution
}

Need for Data Files

Data files are essential for several reasons in computing and programming:

• Persistence: Variables and data structures stored in a program's memory are transient and are lost once the program terminates. Data files provide a mechanism for persistent storage, allowing data to be saved to a non-volatile medium (like a hard drive or SSD) and retrieved later, even after the program has closed.
• Data Sharing: Files enable data to be shared among different programs or users. One program can write data to a file, and another program (or even the same program at a different time) can read that data, facilitating inter-process communication and collaboration.
• Handling Large Datasets: For datasets too large to fit entirely into a computer's RAM, files allow programs to process data in chunks, reading and writing portions as needed. This is crucial for applications dealing with big data.
• Backup and Recovery: Data stored in files can be easily backed up, copied, and restored, providing a layer of protection against data loss due to system failures or accidental deletions.
• Configuration and Settings: Programs often store configuration settings, user preferences, or application states in files, allowing them to maintain consistent behavior across sessions without requiring user input every time.
• Input/Output Operations: Files serve as a fundamental interface for input and output operations, enabling programs to interact with external data sources and sinks, such as user-generated content, sensor readings, or database exports.

File Opening Modes

When working with files in most programming languages, a file must first be "opened" with a specific mode that dictates how the file can be accessed and manipulated. The common file opening modes are:

• 'r' (Read Mode):
  • Opens a file for reading.
  • The file pointer is placed at the beginning of the file.
  • Raises FileNotFoundError if the file does not exist.
  • This is the default mode if no mode is specified.
• 'w' (Write Mode):
  • Opens a file for writing.
  • If the file already exists, its contents are truncated (emptied).
  • If the file does not exist, a new empty file is created.
  • The file pointer is placed at the beginning.
• 'a' (Append Mode):
  • Opens a file for appending.
  • If the file exists, the file pointer is moved to the end of the file, allowing new data to be added without overwriting existing content.
  • If the file does not exist, a new empty file is created.
• 'x' (Exclusive Creation Mode):
  • Opens a file for exclusive creation.
  • If the file already exists, the operation fails and raises a FileExistsError.
  • If the file does not exist, a new empty file is created for writing.
• 'b' (Binary Mode):
  • Used in conjunction with other modes (e.g., 'rb', 'wb', 'ab').
  • Opens the file in binary mode, which means data is read/written as bytes without any encoding/decoding. This is suitable for non-text files like images, audio, or compiled executables.
• 't' (Text Mode):
  • Used in conjunction with other modes (e.g., 'rt', 'wt', 'at').
  • Opens the file in text mode, which means data is read/written as strings using a specified encoding (usually UTF-8 by default). Newline characters are handled appropriately for the operating system. This is the default mode if 'b' is not specified.
• '+' (Update Mode):
  • Used in conjunction with other modes (e.g., 'r+', 'w+', 'a+').
  • Allows both reading and writing to the file.
    • 'r+': Opens a file for both reading and writing. The file must exist. The pointer is at the beginning.
    • 'w+': Opens a file for both reading and writing. Creates the file if it doesn't exist, otherwise truncates it. The pointer is at the beginning.
    • 'a+': Opens a file for both reading and appending. Creates the file if it doesn't exist. The pointer is at the end for writing, but can be moved for reading.

Program to Read from "input.txt" and Write to "output.txt"

#include <stdio.h>

int main() {
    FILE *inputFile, *outputFile;
    char ch;

    inputFile = fopen("input.txt", "r");

    if (inputFile == NULL) {
        printf("Cannot open input file\n");
        return 1;
    }

    outputFile = fopen("output.txt", "w");

    if (outputFile == NULL) {
        printf("Cannot create output file\n");
        fclose(inputFile);
        return 1;
    }

    while ((ch = fgetc(inputFile)) != EOF) {
        fputc(ch, outputFile);
    }

    printf("File copied successfully\n");

    fclose(inputFile);
    fclose(outputFile);

    return 0;
}

Logical operations are fundamental operations that evaluate one or more input values (operands) and produce a single output value, typically either true (1) or false (0). These operations are crucial in digital logic, programming, and mathematics.

• AND (Conjunction)

  • Produces a true output only if all its inputs are true.
  • Symbol: $\land$ or *.
  • Example: A AND B is true if and only if A is true and B is true.

• OR (Disjunction)

  • Produces a true output if at least one of its inputs is true.
  • Symbol: $\lor$ or +.
  • Example: A OR B is true if A is true, or B is true, or both are true.

• NOT (Negation)

  • A unary operation that inverts the logical state of its input. If the input is true, the output is false; if the input is false, the output is true.
  • Symbol: $\neg$ or ~.
  • Example: NOT A is true if A is false.

• XOR (Exclusive OR)

  • Produces a true output if its inputs are different (one true, one false). It produces a false output if its inputs are the same.
  • Symbol: $\oplus$.
  • Example: A XOR B is true if A is true and B is false, or if A is false and B is true.

• NAND (NOT AND)

  • Produces a false output only if all its inputs are true. It is the logical complement of the AND operation.
  • Symbol: $\uparrow$ or $\overline{AB}$.
  • Example: A NAND B is false only if A is true and B is true.

• NOR (NOT OR)

  • Produces a true output only if all its inputs are false. It is the logical complement of the OR operation.
  • Symbol: $\downarrow$ or $\overline{A+B}$.
  • Example: A NOR B is true only if A is false and B is false.

Break Statement

The break statement is a control flow statement used to terminate the execution of the innermost for, while, do-while, or switch statement immediately. When a break statement is encountered, the program control transfers to the statement immediately following the terminated loop or switch block.

Example:

#include <iostream>

int main() {
    for (int i = 1; i <= 10; ++i) {
        if (i == 5) {
            break; // Exit the loop when i is 5
        }
        std::cout << i << " ";
    }
    // Output: 1 2 3 4
    return 0;
}

In this example, the for loop is intended to iterate from 1 to 10. However, when i becomes 5, the break statement is executed, causing the loop to terminate prematurely. The output shows numbers from 1 to 4, as the loop exits before i reaches 5.

Difference from Continue Statement:

• break statement:

  • Terminates the entire loop or switch statement in which it is nested.
  • Program control moves to the statement immediately after the loop/switch.
  • Effectively "breaks out" of the loop entirely.

• continue statement:

  • Skips the rest of the current iteration of the loop and proceeds to the next iteration.
  • It does not terminate the loop itself; rather, it just skips the current cycle.
  • Program control goes to the loop's condition check (for while/do-while) or update expression (for for).

#include <stdio.h>

int main() {
    int num;

    // Get input from the user
    printf("Enter an integer: ");

    // Check if input is valid
    if (scanf("%d", &num) != 1) {
        printf("Invalid input. Please enter an integer.\n");
        return 1;
    }

    // Check if the number is even or odd
    if ((num % 2) == 0) {
        printf("%d is an Even number.\n", num);
    } else {
        printf("%d is an Odd number.\n", num);
    }

    return 0;
}

#include <stdio.h>

int main() {
    int sum = 0;
    int i;
    int count = 0;
    int num = 1;

    // Loop until we get 10 odd numbers
    while (count < 10) {

        if (num % 2 != 0) {
            sum += num;
            count++;
        }

        num++;
    }

    printf("Sum of first 10 odd numbers = %d\n", sum);

    return 0;
}

Preprocessor directives are instructions given to the preprocessor, a program that processes the source code before compilation. They modify the source code textually, perform macro substitutions, or include other files, preparing the code for the compiler. These directives begin with a hash symbol (#).

The #define directive is used to define macros. Macros are essentially text substitutions that the preprocessor performs. There are two main types:

• Object-like macros: Used to define symbolic constants or replace a token with a sequence of tokens.
• Function-like macros: Used to define simple functions that are expanded inline by the preprocessor, avoiding function call overhead.

Example of #define:

#include <stdio.h>

// Object-like macro: Defining a symbolic constant
#define MAX_VALUE 100

// Function-like macro: Defining a simple squaring function
#define SQUARE(x) ((x) * (x))

int main() {
    int a = 5;
    int b = MAX_VALUE; // MAX_VALUE is replaced by 100 by the preprocessor

    printf("The maximum value is: %d\n", b);
    printf("Square of %d is: %d\n", a, SQUARE(a)); // SQUARE(a) is replaced by ((a) * (a))

    return 0;
}

• strlen(const char *str): Calculates the length of the string str, excluding the null terminator (\0). Returns an integer value representing the number of characters.

• strcpy(char *destination, const char *source): Copies the string pointed to by source (including the null terminator) to the buffer pointed to by destination. It is crucial to ensure destination has sufficient memory to prevent buffer overflow.

• strcat(char *destination, const char *source): Appends the string pointed to by source to the end of the string pointed to by destination. The null terminator of destination is overwritten, and source's null terminator is also copied. destination must have enough capacity.

• strcmp(const char *str1, const char *str2): Compares two strings, str1 and str2, lexicographically. It returns 0 if the strings are identical, a negative value if str1 comes before str2, and a positive value if str1 comes after str2.

• strchr(const char *str, int character): Locates the first occurrence of the character character (converted to char) in the string pointed to by str. Returns a pointer to the first occurrence of character in str, or NULL if character is not found.

• Dynamic Memory Allocation
  Dynamic memory allocation is the process of allocating memory during program execution (runtime) rather than at compile time. This allows programs to manage memory more flexibly, especially when the exact memory requirements are unknown beforehand, such as handling user inputs of varying sizes or dynamic data structures like linked lists. Memory is allocated from the heap segment of the computer's memory.

• Use of malloc()
malloc() (memory allocation) is a standard library function in C used for dynamic memory allocation. It requests a block of memory of a specified size in bytes from the heap.

  • Syntax: void* malloc(size_t size);
  • Functionality:
    • It takes a single argument, size, which is the number of bytes to be allocated.
    • Upon successful allocation, malloc() returns a void* pointer to the beginning of the allocated memory block. This pointer can then be cast to the desired data type.
    • If the memory allocation fails (e.g., due to insufficient memory), malloc() returns a NULL pointer.
  • Importance: malloc() allows programs to create data structures or arrays whose size is determined at runtime, preventing memory wastage or stack overflow issues that might arise from fixed-size compile-time allocations. The allocated memory persists until explicitly freed using free().

• Example of malloc()

  #include <stdio.h>
  #include <stdlib.h> // Required for malloc and free
  
  int main() {
      int *ptr;
      int n = 5; // Size determined at runtime or by user input
  
      // Allocate memory for 5 integers
      ptr = (int*) malloc(n * sizeof(int));
  
      // Check if malloc was successful
      if (ptr == NULL) {
          printf("Memory allocation failed!\n");
          return 1; // Indicate an error
      }
  
      // Initialize and print the allocated memory
      printf("Allocated integers:\n");
      for (int i = 0; i < n; i++) {
          ptr[i] = i + 1; // Assign values
          printf("%d ", ptr[i]);
      }
      printf("\n");
  
      // Free the allocated memory to prevent memory leaks
      free(ptr);
      ptr = NULL; // Good practice to set pointer to NULL after freeing
  
      return 0;
  }
  

A structure is a user-defined data type that groups related data items of different data types under a single name. It allows for the representation of a record, where each member of the structure represents a field of the record.

• Key Characteristics:
  • Aggregates heterogeneous data types.
  • Members are accessed using a dot (.) operator.
  • Provides a way to create complex data types.

Structure Rectangle Definition:

struct rectangle {
    float length;
    float breadth;
};

Benefits of Data Files

• Persistence: Data stored in files remains available even after a program terminates, allowing information to be retrieved and reused in subsequent executions or by other applications.
• Data Sharing: Files provide a standardized mechanism to share data among different programs, users, or systems, facilitating interoperability and collaboration.
• Large Datasets: They enable the handling and storage of data volumes that exceed the available main memory, allowing programs to process vast amounts of information.
• Input/Output Flexibility: Data can be easily loaded from files for processing and results can be saved back to files, offering flexible input and output options for applications.
• Data Backup and Recovery: Files can be duplicated and stored in multiple locations, serving as backups and enabling data recovery in case of system failures or accidental loss.

Graphics Functions

• Definition: Graphics functions are programming constructs (routines, methods, or APIs) that allow software applications to render and manipulate visual elements on a display device.
• Basic Primitives: They provide capabilities to draw fundamental graphical shapes such as points, lines, circles, rectangles, and polygons.
• Attributes and Styling: Functions exist to control graphical attributes like color, line thickness, fill patterns, and text fonts for rendered objects.
• Transformations: Advanced graphics functions support operations like translation (moving), rotation, scaling, and shearing of graphical objects in 2D or 3D space.
• Display Management: These functions often manage screen regions, windows, buffers, and provide mechanisms for refreshing the display to show updated graphics.