Skip to content
BvunzoHub

Menu

Get full accessSign in

Cambridge IGCSE Computer Science

7Algorithm design and problem-solving

Algorithm design and problem-solving in Cambridge IGCSE Computer Science: what the syllabus expects you to know, the learning objectives and how to practise.
Topic196 practice questions10 lessons
Practise this topicAll Computer Science topics

Learning objectives

What the syllabus expects you to be able to do.

  1. 7.1Identify the stages of the program development life cycle (analysis, design, coding, testing) and the tasks in each.
  2. 7.2aUnderstand that a computer system is made of sub-systems.
  3. 7.2bDecompose a problem into its component parts (inputs, processes, outputs, storage).
  4. 7.2cDesign solutions with structure diagrams, flowcharts and pseudocode.
  5. 7.3State the purpose of a given algorithm and describe its processes.
  6. 7.4Use the standard methods: linear search, bubble sort, totalling, counting, and maximum, minimum and average.
  7. 7.5aExplain the need for validation and use range, length, type, presence, format and check-digit checks.
  8. 7.5bExplain the need for verification and use visual and double-entry checks.
  9. 7.6Suggest and apply normal, abnormal, extreme and boundary test data.
  10. 7.7Complete a trace table for a dry run of an algorithm.
  11. 7.8Identify errors in an algorithm and suggest corrections.
  12. 7.9Write and amend algorithms in pseudocode, program code and flowcharts for given problems.

Lessons

  • Algorithms and the sequence construct

    40 min

    Full access

  • Finding and correcting errors in algorithms

    45 min

    Full access

  • Flowcharts: symbols, selection and loops

    45 min

    Full access

  • Linear search and bubble sort

    50 min

    Full access

  • Problem decomposition and the program development life cycle

    40 min

    Full access

  • Test data and test plans

    40 min

    Full access

  • Totalling, counting, maximum, minimum and average

    45 min

    Full access

  • Trace tables and dry runs

    45 min

    Full access

  • Validation and verification of input data

    45 min

    Full access

  • Writing algorithms for scenario questions

    60 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