Computer Science · Theme B: Computational thinking and problem-solving

B2.3 — Programming constructs

Computer Science · SL / HL · syllabus-mapped notes

1. CS_B2.3.1

   Correct sequence of instructions

   How instruction order affects output, and avoiding infinite loops, deadlock and wrong output.

2. CS_B2.3.2

   Selection structures

   if, else, else if / elif with Boolean (AND, OR, NOT) and relational operators.

3. CS_B2.3.3

   Looping structures

   Counted and conditional loops, and choosing the right one.

4. CS_B2.3.4

   Functions and modularization

   Reusable functions, modular design, scope and the benefits of both.