Module 1
Algorithm and sequence
Prerequisites: No C programming prerequisites
What you will learn: Observe how a sequence in the flowchart becomes a sequence of C statements executed in the same order.
Learning paths · C programming
From flowchart to C code: sequence, main, variables, input/output and progressively selections, loops, functions and algorithms.
It is ready and unlocks 1 more skill in the learning path.
Start module →The map shows prerequisites, mastered skills and the next step in this learning path.
Prerequisites: No C programming prerequisites
What you will learn: Observe how a sequence in the flowchart becomes a sequence of C statements executed in the same order.
Prerequisites: Algorithm and sequence
What you will learn: Connect flowchart START/END to main and observe a minimal C program that produces real output.
Prerequisites: Your first C program
What you will learn: Track x while two flowchart blocks correspond to two C assignments.
Prerequisites: Variables and assignment
What you will learn: Read two integers, compute the sum and print the result.
Prerequisites: Input, processing and output
What you will learn: Connect relational operators to the flowchart decision diamond.
Prerequisites: Comparisons: true or false
What you will learn: Observe how a condition makes part of a program optional.
Prerequisites: The IF selection
What you will learn: Use a condition to choose exactly one of two branches.
Prerequisites: IF/ELSE: two alternative paths
What you will learn: Follow a condition-controlled loop and observe how state changes toward termination.
Prerequisites: The WHILE loop
What you will learn: Recognize initialization, condition and counter update in a single header.
Prerequisites: The FOR loop
What you will learn: Combine multiple conditions and observe how one decision is built from several subconditions.
Prerequisites: Compound conditions: &&, || and !
What you will learn: Observe an inner FOR completing all its iterations for every outer FOR iteration.
Prerequisites: Nested loops
What you will learn: Introduce a separate function and observe what happens when main calls it.
Prerequisites: Functions: decompose the problem
What you will learn: Follow arguments entering parameters and a value returning to main.
Prerequisites: Parameters and return
What you will learn: Compare two variables with the same name that belong to different frames.
Prerequisites: Scope and local variables
What you will learn: Visualize an array as numbered cells and connect each index to the corresponding C expression v[i].
Prerequisites: Arrays: an indexed sequence
What you will learn: Move the index from left to right and observe how a loop visits every element exactly once.
Prerequisites: Traversing an array
What you will learn: Keep two candidates while traversing the array: a new value replaces them only when it is smaller or larger.
Prerequisites: Minimum and maximum in an array
What you will learn: Compare the target with one cell at a time and keep the current index visible.
Prerequisites: Linear search
What you will learn: Observe the minimum candidate, comparisons, and the swap that fixes one position at a time.
Prerequisites: Visual Selection Sort
What you will learn: Follow adjacent pairs, comparisons, and swaps as larger elements move toward the right.
Prerequisites: Visual Bubble Sort
What you will learn: Observe a C string as a sequence of characters in memory and discover why one extra cell is needed for the terminator.
Prerequisites: Strings: char arrays and the \0 terminator
What you will learn: Follow index i as it visits one character at a time and stops exactly when it reaches the terminator.
Prerequisites: Traversing a string until \0
What you will learn: Read a line into a known-size buffer and observe how to handle the newline without writing past its bounds.
Prerequisites: Safe string input with fgets
What you will learn: Scan a string once and observe how the same traversal can update multiple results: vowel count and the position of the first searched character.
Prerequisites: String processing: vowels and search
What you will learn: Learn to choose inputs that genuinely test an algorithm instead of running it once with an easy value.
Prerequisites: Test Case Lab: normal and boundary cases
What you will learn: Learn to distinguish a program that does not compile from one that compiles but produces the wrong result.
Prerequisites: Bug Hunt: find, explain, fix
What you will learn: Close the path by building and verifying a complete solution: data, loop, conditions, arrays, statistics, tests and a final decision.
Progress is stored in a protected technical cookie in your browser.