# 2024-2025 annual progression sheet computer science form 4

### 2024-2025 annual progression sheet computer science form 4

2024-2025 annual progression sheet computer science form 4

 Term Week Module Category of action Competency statement Lesson no Lesson title Objectives Nature of lesson Observation Th Prac Dig FIRST TERM 1 Diagnostic evaluation Problem solving and coding 2 Using control structures Given an algorithmic problem that requires the use of control structures, learners produce algorithms that use the appropriate control structure to solve the problem. 1 Lesson 1:sequence and selection control structure Explain how sequence and selection control structures work illustrate the functioning of sequence and selection control structures with a flowchart Write simple algorithms that make use of a selection control structure 2 Lesson 2:Multiple selection constructs Explain how the different types of multiple selection constructs work Illustrate the functioning of the different multiple selection constructs Write algorithms that make use of multiple selection control structures 2 3 Lesson 3: Iterative constructs Identify situations where an iterative or loop control structure is needed. Describe the 4 main parts of a loop. Explain advantages and disadvantages of iterative control structures. 4 Lesson 4: Definite iterative constructs Choose correctly when to use a definite iteration. Build definite iterations that are coherent with a given context. Write simple algorithms that make use of definite iteration 5 Lesson 5: Indefinite iterative constructs Differentiate between pretest and posttest indefinite iterations. Illustrate the functioning of indefinite iterations using a flowchart. Write simple algorithms that make use of indefinite iteration.
 Term Week Module Category of action Competency statement Lesson no Lesson title Objectives Nature of lesson Observation Th Prac Dig FIRST TERM 1 Diagnostic evaluation Problem solving and coding 2 Using control structures Given an algorithmic problem that requires the use of control structures, learners produce algorithms that use the appropriate control structure to solve the problem. 1 Lesson 1:sequence and selection control structure Explain how sequence and selection control structures work illustrate the functioning of sequence and selection control structures with a flowchart Write simple algorithms that make use of a selection control structure 2 Lesson 2:Multiple selection constructs Explain how the different types of multiple selection constructs work Illustrate the functioning of the different multiple selection constructs Write algorithms that make use of multiple selection control structures 2 3 Lesson 3: Iterative constructs Identify situations where an iterative or loop control structure is needed. Describe the 4 main parts of a loop. Explain advantages and disadvantages of iterative control structures. 4 Lesson 4: Definite iterative constructs Choose correctly when to use a definite iteration. Build definite iterations that are coherent with a given context. Write simple algorithms that make use of definite iteration 5 Lesson 5: Indefinite iterative constructs Differentiate between pretest and posttest indefinite iterations. Illustrate the functioning of indefinite iterations using a flowchart. Write simple algorithms that make use of indefinite iteration.