2IC30 · resource
Coverage audit
Which lecture material each module covers.
Coverage audit
This course was built by analysing every source file: 13 lecture decks (College 01–13, 563 slides) and 9 past exams plus 2 solution sets from 2016 to 2024. The table maps each lecture to the module that carries its content.
| Source | Topics | Module |
|---|---|---|
| College 1–2 | Gates, Boolean algebra, K-maps, completeness, PLA | M1 |
| College 3–4 | Number systems, 2's-complement, adders, overflow, codes | M2 |
| College 4–5 | Flip-flops, timing, registers, RAM, decoders | M3 |
| College 5–6 | FSMs, Mealy/Moore, minimisation, sync/async | M4 |
| College 7–8 | Datapath, ALU, instruction set, Conductor, prefetch, I/O | M5 |
| College 9–11 | Stack, subroutines, interrupts, ARM, assembly translation | M6 |
| College 12 | Compilers, parsing, buses, DRAM, caches, concurrency | M7 |
| College 11,13 | OS, context switch, paging, replacement, segmentation | M8 |