Computer Modeling and Algorithmization
Core ideas
A model is a simplified representation of an object or process. Models can be material or informational; informational models include tables, graphs, formulas, and programs. Algorithmization means describing a solution as a finite, definite, mass, and effective sequence of steps. Standard constructs are linear, branching (if/else), and loops (with a counter or a condition). Flowcharts use standard symbols: oval = start/end, parallelogram = input/output, rectangle = process, diamond = decision.
Traps to watch
- Confusing a model with the original: a model never captures every property, only the relevant ones.
- Loops that never terminate because the condition variable is not updated.
- Mixing up while (condition checked first, may run zero times) and repeat/until (body runs at least once).
- Counting loop iterations incorrectly when the counter starts at 0 or uses
<=.
Rule of thumb
Trace an algorithm with a small table of variable values, one row per step. Write down each variable after every assignment - never do it "in your head."
Worked example
s = 0; for i = 1 to 4: s = s + i. Trace: i=1→s=1; i=2→s=3; i=3→s=6; i=4→s=10. Four iterations, final s=10. If the loop were while i < 4, it would run only 3 times and stop at s=6 - the boundary condition is the usual trap.