Loops:

• for Loop: “Loops allow you to repeat tasks without writing the same code over and over. They’re like having a personal assistant who never gets tired of doing the same chore.”

Sample Code: for Loop (Printing a Pattern)

#include <stdio.h>

int main() {
    // Print a simple pattern using nested loops
    for (int i = 1; i <= 5; i++) {
        // Print i asterisks on each line
        for (int j = 1; j <= i; j++) {
            printf("* ");
        }
        printf("\\n");
    }

    return 0;
}

• while Loop: “A while loop will keep running as long as a condition is true. It’s like a game of ‘keep going until you win!’”

Sample Code: while Loop

#include <stdio.h>

int main() {
    int count = 1;

    while (count <= 5) {
        printf("Count is: %d\\n", count);
        count++;
    }

    return 0;
}

Humorous Aside:

“Be careful not to create an infinite loop—it’s like being stuck in an endless rerun of your favorite show. Fun for a while, but eventually, you’ll want to move on!”

6. Functions: Reusable Code with a Twist (25 minutes)

Talking Points:

• What Are Functions? “Functions are like recipes in a cookbook. They break your code into smaller, manageable parts. Instead of writing the same code twice, you just call the function—like ordering your favorite dish from a restaurant instead of cooking it yourself every time!”

Sample Code: Functions

#include <stdio.h>

// Function prototype: Declare our function before main
int addNumbers(int a, int b);

// A function to print a decorative line (extra fun!)
void printDivider() {
    printf("------------------------------\\n");
}

int main() {
    printDivider();
    int result = addNumbers(5, 3);
    printf("5 + 3 = %d\\n", result);
    printDivider();

    // Additional demonstration: a function that calculates factorial
    int num = 5;
    printf("Factorial of %d is %d\\n", num, factorial(num));

    return 0;
}

// Function definition: Adds two integers
int addNumbers(int a, int b) {
    return a + b;
}

// Extra: Function to calculate factorial recursively
int factorial(int n) {
    if(n <= 1)
        return 1;
    else
        return n * factorial(n - 1);
}

Humorous Aside:

“Remember, a good function should do one thing and do it well—kind of like your favorite coffee machine that just brews coffee perfectly every morning!”

7. Mini Project: Building a Super Simple Calculator

Objective: