Business and technology qualifications, Levels 3-6, in Brussels. Explore qualifications
Portal login
Diploma in Higher Education Studies

From a problem to pseudocode

HES 212 · Further Mathematics for University Study — Week 12 of 16

CourseHES 212
Week12 of 16
SemesterII
TutorOnline in the course chat

This week’s topics

From a problem to pseudocode

  1. Breaking a problem into steps
  2. Writing pseudocode

What you will be able to do

  • 4.1 Translate a mathematical problem into pseudocode.

Activity

Write pseudocode for working out a bill with a discount.

Study materials

Further resources

  • Introduction to Computer Science, 2.1: Pseudocode · PDF · OpenStax Introduction to Computer Science (2024), 2.1: breaking a problem into steps and writing pseudocode, pp. 46–51 · for registered students
  • Introduction to Computer Science, 3.2: Algorithm Design and Discovery · PDF · OpenStax Introduction to Computer Science (2024), 3.2: designing an algorithm for a problem, pp. 97–103 · for registered students
  • Prealgebra 2e, 9.1: Use a Problem Solving Strategy · PDF · OpenStax Prealgebra 2e (2020), 9.1: a step-by-step problem-solving strategy, pp. 651–665 · for registered students
  • Algorithmic thinking: an initial characterization of computational thinking in mathematics · Open-access article · Lockwood et al. (2016), Proceedings of PME-NA 38. How people think algorithmically when turning problems into steps. · for registered students
  • Computational thinking · Open-access article · Wing (2006), Communications of the ACM. The classic case for computational thinking in problem solving. · for registered students
Materials marked “for registered students” open in the student portal, which is set up as soon as you receive final acceptance.
Course chat

Admitted students ask questions on this week’s page in the student portal: an AI assistant trained on the course answers first, and during the course’s timetabled classes Connect to your tutor brings your tutor into the chat, who may start a call if needed.

Open this week in the portal
Course plan
  • Week 1: Coordinates and straight-line graphs
  • Week 2: Gradient and y-intercept (y = mx + c)
  • Week 3: Plotting quadratic graphs
  • Week 4: Using graphs to solve problems
  • Week 5: Number sequences and the nth term
  • Week 6: Geometric sequences
  • Week 7: Sequences and how fast programs grow
  • Midterm: Midterm evaluation
  • Week 9: Probability basics
  • Week 10: Probability of two events
  • Week 11: Statistics for a dataset
  • Week 12: From a problem to pseudocode
  • Week 13: Checking a solution with test data
  • Week 14: Maths problem-solving project
  • Week 15: Review and coursework completion
  • Final: Final assessment and submission
Back to the course
Scroll