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. Learning Paths
  2. /Algorithms and Problem-Solving
Computer Science
High School (9–10)
Computer Science › Algorithms and Problem-SolvingChapter 7

Algorithms and Problem-Solving

Before anyone writes a program, someone has to plan it.

  • What must it do?
  • What are its parts?
  • What steps solve each part?
  • This chapter shows how a programmer plans, writes down and checks an algorithm.
  • You break a problem into smaller parts, draw flowcharts and structure diagrams, write pseudocode, follow an algorithm step by step in a trace table, choose test data, and find and fix errors.
  • Then you learn the standard methods that every programmer uses: totals, counts, the largest and smallest values, averages, linear search, bubble sort and checks on input data.
Show the rest (1)
  • It covers unit 7 of Cambridge IGCSE Computer Science, Algorithm design and problem-solving, and it builds on the Python books of the site.

Part of Computer Science · IGCSE (9–10) (chapter 7)

StemPy LabStemPy Lab
Log in to save

Following adds this path to your dashboard and enrolls you in the 3 courses you can open, so you can start right away.

Courses in This Path (3)

1.
Planning a Program: Life Cycle, Decomposition and Flowcharts
A big program, like the one that runs a school library, is too large to write in one go. A programmer first finds out what it must do, then splits it into smaller parts, and plans the steps of each part. You meet the four stages of the program development life cycle, break systems into sub-systems, draw structure diagrams, and read and draw flowcharts with the standard symbols. It covers the first part of unit 7 of Cambridge IGCSE Computer Science.
Not started
2.
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.
← All Learning Paths
More onComputer Science › Algorithms and Problem-Solving

Computer Science · IGCSE (9–10)

  1. 1Data Representation
  2. 2Data Transmission and Encryption
  3. 3Computer Hardware
  4. 4Software and Programming Languages
  5. 5The Internet and Cyber Security
Not started
3.
Standard Algorithms: Totals, Searching, Sorting and Validation
Some small algorithms turn up in almost every program: adding up a list of numbers, counting how many pass a test, finding the highest score, searching for a name and putting values in order. You learn to write each one in pseudocode and in Python, and to check the data a user types in before a program uses it. It covers the standard methods of solution and the validation and verification checks of unit 7 of Cambridge IGCSE Computer Science.
Not started
6
Automated and Emerging Technologies
  • 7Algorithms and Problem-SolvingYou are here
  • 8Programming in Pseudocode and Python
  • 9Databases and SQL
  • 10Boolean Logic
  • The whole book →
    Computer Science
    Computer Science
    Computer Science