Business and technology qualifications, Levels 3-6, in Brussels. Explore qualifications
Portal login
Level 4 Diploma in Cyber Security

Writing pseudocode as a universal template for algorithms

CYB404 · Algorithms and Data Structures — Week 9 of 16

CourseCYB404
Week9 of 16
SemesterII
TutorOnline in the course chat

This week’s topics

Writing pseudocode as a universal template for algorithms

  1. Writing pseudocode as a universal template for algorithms
  2. Converting pseudocode to Python functions

What you will be able to do

  • 4.1 Explain how to write pseudo-code for algorithmic design.
  • 4.2 Implement pseudocode in a programming language.

Activity

Start with this week’s 4 videos, then: Seminar, guided reading and a short written task: explain how to write pseudo-code for algorithmic design.

Study materials

Videos

  • Representing algorithms using pseudocode · Oak National Academy, Key Stage 4 (GCSE level) · for registered students
  • Representing algorithms using flowcharts · Oak National Academy, Key Stage 4 (GCSE level) · for registered students
  • 78. CAMBRIDGE IGCSE (0478-0984) 7 How to produce algorithms using pseudocode and flowcharts · YouTube · Craig'n'Dave · 5 min · for registered students
  • Algorithms in pseudocode and flow diagrams · YouTube · Cambridge GCSE Computing Online · 4 min · for registered students

Further resources

  • Introduction to Computer Science, 2.1: Pseudocode · PDF · OpenStax Introduction to Computer Science (2024), 2.1 on writing algorithms as pseudocode with sequence, selection and iteration, pp. 46–51 · for registered students
  • Think Python, ch. 6: Fruitful functions · PDF · Downey, Think Python 2e (Green Tea Press), ch. 6: return values, incremental development and Boolean functions, pp. 51–62 · for registered students
  • A multi-national study of reading and tracing skills in novice programmers · Open-access article · Lister et al. (2004), ACM SIGCSE Bulletin (ITiCSE working group report). Study of novices tracing code and pseudocode by hand. · 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: Data structures: arrays, lists, stacks, queues, sets and di…
  • Week 2: Choosing data structures, with a Python refresher
  • Week 3: Measuring complexity: Big O notation
  • Week 4: Problem classes: computability and Turing machines, P and N…
  • Week 5: Recursion and memoisation (e.g. Tower of Hanoi); the memory…
  • Week 6: Algorithmic paradigms: divide and conquer, backtracking, gr…
  • Week 7: Sort, search and pathfinding algorithms compared by time an…
  • Midterm: Midterm evaluation
  • Week 9: Writing pseudocode as a universal template for algorithms
  • Week 10: Checking algorithms are correct: tracing, testing and timing
  • Week 11: Debugging and testing implementations; review and practice …
  • Week 12: Applying Algorithms and Data Structures in practice: case s…
  • Week 13: Assignment workshop: research, planning and referencing
  • Week 14: Assignment workshop: drafting, feedback and improvement
  • Week 15: Review and coursework completion
  • Final: Final assessment and submission
Back to the course
Scroll