uninotes

These are my notes from my computer science degree - every lecture, concept and worked problem I’ve written up, course by course.

Each note is one idea in its own file: a dated capture of a single lecture, an evergreen concept note I keep rewriting as I understand it better, or one tutorial, lab or assignment question worked through end to end. Notes are tagged, and linked to each other with [[wikilinks]] - so something explained properly once gets linked to everywhere it turns up again, instead of half-explained in five places.

Start with a course below, browse by tag, or use the search box (top right) if you already know what you’re after. The link graph - every note a star, every wikilink a line between them - lives at mattogrady.com.

Courses

Each dashboard carries the course’s weekly notes, concepts and study guides.

Recently updated

The last few notes to change, newest first, taken from this repo’s git history - so an edit shows up here once it’s committed.

Date Note Course Change
7 Nov 2026 Lecture 1 — Welcome & Warm-up Problems math1061 Updated
7 Nov 2026 Lecture 34 — Walks, Trails and Circuits math1061 New
7 Nov 2026 Lecture 35 — Matrix Representations of Graphs math1061 New
7 Nov 2026 Lecture 36 — Trees math1061 New
7 Nov 2026 Adjacency Matrices math1061 New
7 Nov 2026 Euler Circuits and Trails math1061 New
7 Nov 2026 The Examination Formula Page math1061 Updated
7 Nov 2026 Graphs math1061 Updated
7 Nov 2026 Incidence Matrices math1061 New
7 Nov 2026 MATH1061/MATH7861 — Discrete Mathematics math1061 Updated
7 Nov 2026 The Pigeonhole Principle math1061 Updated
7 Nov 2026 Practice Problems — the Semester-wide Set math1061 Updated
7 Nov 2026 Strong Induction and the Well-Ordering Principle math1061 Updated
7 Nov 2026 Trees math1061 New
7 Nov 2026 Walks, Trails and Circuits math1061 New
No matching items