Skip to content

ZIMSEC O-Level Computer Science

8.40Form 4: Algorithm design

Form 4: Algorithm design in ZIMSEC O-Level Computer Science: what the syllabus expects you to know, the learning objectives and how to practise.
Subtopic41 practice questions2 lessons

Learning objectives

What the syllabus expects you to be able to do.

  1. 8.40.1Design algorithms for a project.

Lessons

  • Linear search and bubble sort

    50 min

    Full access
  • Totalling, counting, maximum, minimum and average

    45 min

    Full access

Join to read every lesson, or see what Full access includes.

Sample question

A sample question on this topic. Answer it, check it, then read the worked answer.

Form 4: Algorithm design: sample question

1 mark

The array Learners holds:

Index 1 2 3 4 5 6
Learners Tendai Rudo Farai Chipo Sipho Nyasha

A linear search that stops when the item is found looks for "Chipo". How many comparisons are made?

Only if the answer has a unit, e.g. cm or km/h.

Turn Form 4: Algorithm design into a strength.

Practise with instant marking, see your mastery grow and get a study plan built around your exam date.