Skip to content
BvunzoHub

Menu

Get full accessSign in

ZIMSEC O-Level Computer Science

6.7Algorithm Design and Problem-solving

Algorithm Design and Problem-solving in ZIMSEC O-Level Computer Science: what the syllabus expects you to know, the learning objectives and how to practise.
Topic160 practice questions8 lessons
Practise this topicAll Computer Science topics

In this topic

Lessons

  • Algorithms and the sequence construct

    40 min

    Full access

  • Iteration with FOR, WHILE and REPEAT loops

    50 min

    Full access

  • Selection with IF and CASE statements

    45 min

    Full access

  • Flowcharts: symbols, selection and loops

    45 min

    Full access

  • Problem decomposition and the program development life cycle

    40 min

    Full access

  • Trace tables and dry runs

    45 min

    Full access

  • 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.

Algorithm Design and Problem-solving: sample question

1 mark

What is output by this algorithm?

Seconds ← 250
Whole ← DIV(Seconds, 60)
OUTPUT Whole

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

Turn Algorithm Design and Problem-solving into a strength.

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

Start learningComputer Science topics