Skip to the content

Under construction. This area is a framework being built: most courses have no teaching material yet, and things may change or break. Private self-study. Not an official programme and not recognised by any ministry or school. No qualification, mark or document is issued, and “years 1 to 3” and “advanced” are names of study paths only.

← All courses

E01 Design and analysis of algorithms

Years 1 to 3 pathE: Proposed extensionsplannedproposed, not in any programmeabout 120 h (planning estimate)

Planned: syllabus only, no teaching material yet. Nothing on this page can be studied; it describes what the course would cover.

In no programme. This is a proposed extension course; the owner has not approved it into a programme.

Proposed by the assistant to fill a gap in the owner's catalogue. It is in no programme until the owner approves it.

Why this course

The core of computer-science mathematics that the brief covers only through computability and graph theory.

Prerequisites

Required
B05 Discrete mathematics, F03 Programming for mathematical exploration
Recommended
B11 Probability I
Can be taken at the same time
none
Everything required, transitively (4 courses)
B01, B05, F01, F03
Courses that require this one
E11

Concept-level units

Units follow the syllabus order, as a recommended sequence rather than a gate.

  1. Asymptotics and recurrences
  2. Divide and conquer
  3. Dynamic programming and greedy methods
  4. Graph algorithms: paths, trees, flows
  5. Randomized algorithms
  6. NP-hardness and approximation first look

Assessable outcome

Design an algorithm, prove it correct and analyse its running time.

Assessment design

  • topic exercises
  • mixed problem sets
  • unseen proof or derivation problems
  • cumulative examination

cumulative; uses spaced retrieval

Resources

Every title here is candidate, unverified unless marked verified. Titles were suggested while planning. Nobody has checked that they exist, what they cost or how they are licensed.

  • Kleinberg and Tardos · Algorithm Design
  • Erickson · Algorithms (free notes)
  • Cormen et al. · Introduction to Algorithms

Content record

Version
0.0.0
Review
no review of any kind
Provenance
PROPOSED by the assistant on 30 Oct 2026 to fill gaps in the brief's catalogue; not in the owner's brief; needs the owner's approval and a curriculum reviewer
Known issues
  • Proposed course: not counted by any programme audit until the owner approves adding it to an elective pool.
Type
course

Bridges and laboratories

No bridge or laboratory is attached to this course yet.

You and this course

Reading your plan on this device…