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 →

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. Notes
  2. /Planning a Program: Quick Revision
Computer Science

Planning a Program: Quick Revision

A brief note on planning a program: the four stages of the program development life cycle, decomposition and abstraction, structure diagrams and the flowchart symbols, with practice, a program and questions to check yourself.

StemPy LabWritten by StemPy Lab
Log in to save

A brief note on Planning a Program. Read it before a test. Try each question at the end before you open its answer.

The program development life cycle

  • Analysis: identify the problem and the requirements, with abstraction and decomposition.
  • Design: decomposition, structure diagrams, flowcharts and pseudocode.
  • Coding: write the program code, with iterative testing (test, correct, test again).
  • Testing: test the whole program with test data.

A problem found later sends the team back to an earlier stage.

Breaking a problem down

  • Every computer system is made of sub-systems, which are made of further sub-systems.
  • Decomposition splits a problem into inputs, processes, outputs and storage.
  • Abstraction keeps the details that matter and removes the rest.
  • A structure diagram shows the system at the top and its parts below. It has no arrows and no decisions.

Flowchart symbols

  • Terminator (round ends): START and STOP.
  • Process (rectangle): an action, such as Total ← 0.
  • Input/Output (parallelogram): INPUT X, OUTPUT Total.
  • Decision (diamond): two exits, Yes and No.
  • Subroutine (rectangle with a line inside each end): a separate flowchart.
  • Flow line (arrow): a line back to an earlier shape makes a loop.

Write conditions precisely: X > 10, not "X is bigger than 10".

Practice with new numbers

A program to try

The program follows a flowchart that counts the inputs greater than 101010. It prints the variables after each pass, like a dry run.

Read it first. Then run it. Why is the input 10 not counted?

1. Change the test to x >= 10. Predict the new output.

Mistakes to avoid

  • Calling iterative testing the testing stage. It happens in coding.
  • A decision with one exit. A diamond always has Yes and No.
  • Input or output in a rectangle. Use the parallelogram.
  • Forgetting the edge value. Check the number that equals the limit in a decision.

Check yourself

  1. Which stage includes drawing a structure diagram?
  1. A music app stores song titles and lengths, but not the weather on the day each song was recorded. What is this called?
  1. Which shape holds OUTPUT Score?
  1. A flowchart sets X to 111 and doubles it until X > 20. What is the final value of X?

Sources

  • Cambridge International, IGCSE Computer Science 0478 syllabus (2026, 2027 and 2028), unit 7 and section 4 (flowchart symbols).
← All Notes
← Artificial Intelligence: Quick RevisionPseudocode, Trace Tables and Testing: Quick Revision →
More onComputer Science › Algorithms and Problem-Solving

Discussion (0)

Log in to join the discussion.

Loading…

On this page

  1. The program development life cycle
  2. Breaking a problem down
  3. Flowchart symbols
  4. Practice with new numbers
  5. A program to try
  6. Mistakes to avoid
  7. Check yourself
  8. Sources

Goes with the lesson

  1. FlowchartsPlanning a Program: Life Cycle, Decomposition and Flowcharts

More notes on this topic

  1. Standard Algorithms and Validation: Quick Revision
  2. Pseudocode, Trace Tables and Testing: Quick Revision
  3. Logic Circuits and Truth Tables: Quick Revision
  4. NAND, NOR and XOR Gates: Quick Revision
  5. NOT, AND and OR Gates: Quick Revision
All notes on this topic →