beep beep boop boop
| code that we will write in tuts 🧑💻 | ‣ |
|---|---|
| good set of pre-recorded lectures if you wanna go ahead 🧑🏫 | 21T2 COMP2521 Lectures |
| 24T1 COMP2521 Lectures | |
| errors guide [HIGHLY RECOMMENDED READING IF YOU GET STUCK] | https://comp2521unsw.github.io/sanitisers-guide/ |
| timetable | https://cgi.cse.unsw.edu.au/~give/Admindata/25T2/COMP2521_timetable.html |
comp2521 tut slides - Google Drive
Week 1 — Welcome, 1511 Recap + Gap
Week 2 — Compilation, Makefiles, Recursion
Week 4 — Function Pointers + BSTs
Week 5 — AVL Trees, 2-3-4 Trees, Graph Reps
Week 7 — Graph Traversal + Graph Theory
Week 10 — Hashing, Heaps, Tries
topics no longer in the course (as of 24T1): function pointers, 2-3-4 trees, gdb/valgrind (optional), P/NP
graph algorithms: cycles, Hamiltonian, Euler
basic sorts: bubble, insertion, selection