Algorithm
Finite, ordered sequence of instructions to solve a problem. Properties: finite, defined, effective.
Loading page
Resource 1 of 2
Lesson overview
This lesson brings together the PDF, study notes and chapter flow so you can revise Programming without losing the thread.
Algorithm
Finite, ordered sequence of instructions to solve a problem. Properties: finite, defined, effective.
Variables and types
Variable: named memory space. Types: integer, float, char, boolean. E.g.: x ← 5 (assignment).
Input/Output
Lire(x): keyboard input. Écrire(x): screen output.
IF...ELSE condition
IF (condition) THEN instructions ELSE other instructions ENDIF
FOR loop (fixed iteration)
FOR i FROM 1 TO n DO instructions END FOR Executes n times.
WHILE loop (condition)
WHILE (condition) DO instructions END WHILE Stops when condition is false.
Language levels
Low level: machine language (binary), assembly. High level: C, Java, Python. More human-readable.
Compilation vs Interpretation
Compiled: translated before execution (C, C++). Interpreted: line by line at runtime (Python, JS).
Understand before memorizing
Connect each concept to a concrete use: hardware, operating system, algorithm, program, file, or network.
Algorithms
Clearly describe inputs, processing, outputs, variables, and control structures before writing code.