 |  |  |
| Lecture 1: Higher Computing 1 - Richard Buckland UNSW 2008 | Lecture 2: Inside a computer - Richard Buckland UNSW | Lecture 3: Machine Code - Richard Buckland UNSW |
 |  |  |
| Lecture 4: Simple C Program - Richard Buckland UNSW | Lecture 5: Clarity (C programming #2) - Richard Buckland UNSW | Lecture 6: Solving Problems - Richard Buckland UNSW 2008 |
 |  |  |
| Lecture 7: Side Effects - Richard Buckland UNSW 2008 | Lecture 8: writing a simple C program - Richard Buckland | Revision Lecture 8.1: COMP1917 Higher Computing - Richard Buckland UNSW |
 |  |  |
| Revision Lecture 8.2: COMP1917 Higher Computing - Richard Buckland UNSW | Lecture 9: A simple recursive function - Richard Buckland UNSW | Lecture 10: Functions - Richard Buckland UNSW |
 |  |  |
| Lecture 12.1: The mechanics of function calls - Richard Buckland UNSW | 16: Frames (revision) - Richard Buckland (UNSW) | Lecture - 1 Introduction to Data Structures and Algorithms |
 |  |  |
| Lecture - 2 Stacks | Lecture - 3 Queues and Linked Lists | Lecture - 4 Dictionaries |
 |  |  |
| Lecture - 5 Hashing | Lecture - 6 Trees | Lecture - 7 Tree Walks / Traversals |
 |  |  |
| Lecture - 8 Ordered Dictionaries | Lecture - 9 Deletion | Lecture - 10 Quick Sort |
 |  |  |
| Lecture - 11 AVL Trees | Lecture - 12 AVL Trees | Lecture - 13 Trees |
 |  |  |
| Lecture - 14 Red Black Trees | Lecture - 15 Insertion in Red Black Trees | Lecture - 16 Disk Based Data Structures |
 |  |  |
| Lecture - 17 Case Study: Searching for Patterns | Lecture - 18 Tries | Lecture - 19 Data Compression |
 |
| Lecture - 20 Priority Queues |
