MSc Algorithms & Data Structures

Software · Live · v0

Algorithms and data structures from scratch — analysis, core structures, design paradigms, and measured complexity claims.

Path type: Software
Requirements: Open entry
Enrollment: €9.95
Deadline: Next cohort starts 2027-09-06 (AY 2027/28)
Length: ~1 year · 42 phases
Language: English · Español
Content freshness: Curriculum updated 2026-08-23 · content rev da394eda
Cortex Credits (CC): 126 CC
What are Cortex Credits?
Syllabus: View the phase syllabus

Foundations & tooling

Models of computation & counting steps

Asymptotic notation

Recursion & recurrences

Correctness: invariants & proofs

Amortized analysis

Randomness in algorithms

Arrays & linked lists

Stacks, queues & deques

Binary trees & BSTs

Heaps & priority queues

Hash tables: chaining, open addressing & Robin-Hood

Balanced search trees I: AVL

Balanced search trees II: red–black

Disjoint sets (union–find)

Elementary sorting & binary search

Mergesort, quicksort & maximum subarray

Heapsort, the lower bound & linear-time sorts

Selection & order statistics

Greedy algorithms

Dynamic programming I

Dynamic programming II

Backtracking & branch-and-bound

Number-theoretic algorithms

Polynomials & the Fast Fourier Transform

Matrix & algebraic algorithms

Graph representations & BFS

DFS, topological sort, SCC & 2-SAT

Shortest paths I: Dijkstra

Shortest paths II: Bellman–Ford & Floyd–Warshall

Minimum spanning trees

Maximum flow & bipartite matching

String matching: Rabin–Karp, KMP & Z

Tries & prefix structures

Suffix arrays: an introduction

The competitive solver

Benchmarking & profiling in practice

Testing algorithms

Intractability primer

Capstone: algoforge is complete

Hardening, postmortem & "What's Next"

Portal integration

Syllabus →
Enrolment prerequisites: A verified account and admissions-committee approval.

What changed

Every release of this programme, newest first.

v0 Pilot 2026-07-18 Wave A backfill: v0 pilot baseline

Professor: Vacancy available