HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Algorithms and Problem-Solving
  2. /Computer Science
  3. /Pseudocode, Trace Tables and Testing
Chapter 7 · Part 2 of 3Algorithms and Problem-Solving
← Previous part: Planning a Program: Life Cycle, Decomposition and FlowchartsNext part: Standard Algorithms: Totals, Searching, Sorting and Validation →
High School (9–10)Algorithms, Programming and Logic › Algorithms and Problem-SolvingFree course

Pseudocode, Trace Tables and Testing

A computer does exactly what it is told, so a plan must be exact too.

  • Pseudocode is a way to write each step precisely, in a form any programmer can read.
  • You write and read pseudocode in the exam style and follow an algorithm by hand in a trace table.
  • Then you choose normal, abnormal, extreme and boundary test data, and find and correct the errors in an algorithm.
  • It covers the middle part of unit 7 of Cambridge IGCSE Computer Science.

3 lessons, about 1 h 15 min3 simulations10 problems3 practice questionsPython in every lesson

StemPy LabCreated by StemPy Lab

Free

Every lesson is open to read. Enroll to keep your place in the course. No payment needed.

This course includes

  • 3 lessons, about 1 h 15 min
  • 3 simulations with sliders
  • 3 practice questions with new numbers each time
  • 3 Python programs to run
  • 10 problems with worked solutions
  • 2 Python labs
1 question set
  • 1 revision note
  • 1 test
  • Log in to save

    Course outline (3 lessons)

    1. 1
      Lesson 1about 25 min

      Writing pseudocode

      Pseudocode writes an algorithm in a precise, readable form that is not tied to one programming language. You learn the exam style of Cambridge IGCSE pseudocode: assignment with an arrow, INPUT and OUTPUT, IF and CASE, the three kinds of loop, MOD and DIV, and how to state the purpose of an algorithm and amend one.

      1 simulation1 practice question1 Python program4 problems1 Python lab
      Read the lesson
    2. 2
      Lesson 2about 25 min

      Trace tables and dry runs

      A dry run follows an algorithm by hand, one step at a time, without a computer. A trace table records it: one column for each variable, and columns for the prompts and outputs. You complete trace tables for loops and decisions and use them to find what an algorithm does.

      1 simulation1 practice question1 Python program3 problems
      Read the lesson
    3. 3
      Lesson 3about 25 min

      Test data and finding errors

      A program is tested with data chosen on purpose. You learn the four kinds of test data in the syllabus: normal, abnormal, extreme and boundary. Then you use dry runs and test data to find errors in algorithms and to suggest how to correct them.

      1 simulation1 practice question1 Python program3 problems1 Python lab1 question set1 note
      Read the lesson

    Test Your Learning

    Pseudocode and Testing: Timed Test
    IGCSE format20 questions · 25 min
    Not started

    Your teacher

    StemPy LabStemPy Lab

    1 follower

    Loading…

    ← All Courses
    ← Planning a Program: Life Cycle, Decomposition and FlowchartsStandard Algorithms: Totals, Searching, Sorting and Validation →
    More onAlgorithms, Programming and Logic › Algorithms and Problem-Solving

    Discussion (0)

    Log in to join the discussion.

    Loading…