Paper 1: Algorithm basics and flowchart symbols
Chapter practice with ten items, answers and a one-line note for each, about 25 minutes.
| Item | Detail |
|---|---|
| Questions | 10 |
| Suggested time | 25 |
| Difficulty mix | Foundation 4 · Intermediate 2 · Challenge 2 · Error redo 2 |
| Chapter | Chapter: S2 ICT: algorithms and flowcharts |
| Level | Basic |
| # | Answer | One-line note |
|---|---|---|
| 1 | A finite, ordered set of clear steps that solves a problem. | If the steps are clear, ordered and finish, it is an algorithm even without code. |
| 2 | The start or the end of the process. | An oval is used only at the beginning and the end, so every chart has a clear entry and exit. |
| 3 | Input or output. | Asking the user for data, or showing a result, is drawn with a parallelogram. |
| 4 | A process step such as a calculation or an assignment. | One rectangle holds one action; a condition belongs in a diamond, not here. |
| 5 | A decision, usually with a yes and a no branch. | A diamond always splits into two paths, and the two paths may lead to quite different results. |
| 6 | They show the direction of flow and connect the steps. | Without arrows the order is unknown, and order is part of what makes an algorithm correct. |
| 7 | 12 steps. | 3 times 4 equals 12; rounds multiplied by steps per round gives the total work. |
| 8 | 24. | 7 plus 5 is 12, and 12 times 2 is 24; changing the order changes the answer. |
| 9 | 15. | 1 plus 2 plus 3 plus 4 plus 5 is 15, the classic running-total loop. |
| 10 | 30. | The total is 150 and dividing by 5 gives 30; mean equals total over count. |
Want the whole chapter? See all four difficulty papers on the chapter page.Tutor Registration →
Questions and answers are written originally by the TutorZone team and are not taken from any school, publisher or examination authority paper. Every value is checked by computer.

