CourseHES 212

Week7 of 16

SemesterII

TutorOnline in the course chat

This week’s topics

Sequences and how fast programs grow

Counting the steps a program takes
Slow and fast growth

What you will be able to do

2.2 Explain their relevance to algorithmic complexity (informally).

Activity

Count the steps of two simple algorithms for bigger and bigger inputs.

Study materials

Further resources

Think Python, Appendix B: Analysis of Algorithms · PDF · Downey, Think Python 2e (Green Tea Press), Appendix B: counting steps and how running time grows, pp. 201–209 · for registered students
Introduction to Computer Science, 3.3: Formal Properties of Algorithms · PDF · OpenStax Introduction to Computer Science (2024), 3.3: slow and fast growth of algorithms (a step up), pp. 104–109 · for registered students

Materials marked “for registered students” open in the student portal, which is set up as soon as you receive final acceptance.

Week 6 Midterm

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