THEORETICAL RECAP Before diving into this workshop, let's consolidate what you have learned so far. A variable is a named storage location in memory that holds a value which can change during program execution. A constant, by contrast, holds a fixed ...

**Theoretical Recap** A variable is a named memory slot used to store a value that can change during program execution. It has three key attributes: a name (identifier), a type (integer, real, string, boolean), and a value. When you perform calculati...

In the previous activities, you learned how to declare and assign variables, work with common data types, and write basic arithmetic expressions. You now have a solid foundation for understanding how data is stored and manipulated in an algorithm. In...

Every piece of information that a program manipulates must have a type. A data type tells the computer what kind of value is being stored and what operations can be performed on it. Without this concept, a program would not know whether the value 42 ...

**Theoretical Recap** A variable is a named container that holds a value at a given moment in a program's execution. You have already practiced declaring and assigning variables, as well as performing basic arithmetic expressions. Now, a classic and ...

THEORETICAL RECAP A variable is a named container that stores a value in memory during the execution of a program. Think of it as a labeled box: you give it a name, you put something inside, and you can open it, read its content, or replace it at any...

In the previous activities, you have explored the fundamentals of algorithms: sequencing, execution flow, pseudocode, variables, and states. You now know how to structure a logical process step by step and store information in variables. The next nat...

Now that you have a solid understanding of sequencing, execution flow, pseudo-code, and best practices for writing clean algorithms, it is time to take a crucial step forward: understanding variables and the concept of state. These two notions are at...

THEORETICAL RECAP An algorithm is a finite, ordered sequence of unambiguous instructions designed to solve a specific problem or accomplish a well-defined task. Three foundational concepts underpin everything you have studied so far: sequence (instru...

THEORETICAL RECAP An algorithm is a finite, ordered sequence of unambiguous instructions designed to solve a specific problem. The key word here is 'ordered': each step must follow logically from the previous one, and every instruction must be clear ...