Recordings of lectures can be obtained from Lectopia.
§ refer to indicated section in the set text.
| Week Nr | Mon Date | Topic | Lecture Number and Subtopic | Tutorial | Assessment |
|---|---|---|---|---|---|
| 1 | 27 Jul | Introduction |
1. Course Overview
[handouts] 2. Hardware up to Java (§1, §14) [handouts] 3. The Eclipse IDE (eclipse.org) [handouts][slides][other] |
||
| 2 | 3 Aug | Fundamentals |
1. Arrays, Linked Lists and Recursion (§3)
[handouts][slides] 2. Counting Primitive Operations (§4) [handouts] 3. Asymptotic Analysis (§4) [handouts] |
[tute week 2] [solutions] |
[COMP3606 A1][criteria] [COMP7505 A1][criteria] [09COMP3506-A1.zip] |
| 3 | 10 Aug | Analysis Tools |
Exhibition Day - Public Holiday (Wed 12 Aug)
2. Asymptotic Analysis (cont) (§4) [handouts] 3. Abstract Data Types (§2) [handouts] |
||
| 4 | 17 Aug | Linear Structures |
1. Array-based Stacks and Queues (§5)
[handouts] 2. The Vector ADT and Amortisation (§6) [handouts] 3. Link-based Linear Structures (§6) [handouts] |
[tute week 4] [solutions] |
[Verify Your Submission] |
| 5 | 24 Aug | Trees |
1. Lists, Sequences and Iterators (§7)
[handouts] 2. General Trees (§7) [handouts] 3. Binary Trees (§7) [handouts] |
[tute week 5] [solutions] |
A1 Due (5%) [COMP3606 A2] [COMP7505 A2] |
| 6 | 31 Aug | Priority Queues |
1. Entries, Priority Queues and Heaps (§8)
[handouts] 2. Adaptable Priority Queues (§8) [handouts] 3. Algorithms using ADTs (§) [handouts] |
[tute week 6] [solutions] |
[Requirements] [SDD Template] |
| 7 | 7 Sep | Maps and Hashtables |
1. Mid Semester Exam
2. Maps and Hash Tables (§9) [handouts] 3. (cont) |
[tute week 7] [solutions] |
[Mid Semester Exam] |
| 8 | 14 Sep | Dictionaries |
1. Dictionaries, and Skip Lists (§9)
[handouts] 2. Binary Search Trees (§10) [handouts] 3. AVL Trees (§10) |
[tute week 8] [solutions] |
A2 Due (10%) |
| 9 | 21 Sep | Search Trees |
1. Splay Trees (§10)
[handouts] 2. (2,4) Trees (§10) [handouts] 3. Red-black Trees (§10) [handouts] |
[tute week 9] [solutions] |
[COMP3606 A3] [COMP7505 A3] [09COMP3506-A3v2.zip] |
| 28 Sep |
Mid Semester Break |
[Space Usage SDD] [A3 Marking] |
|||
| 10 | 5 Oct | Sorting, Sets and Selection |
1. Sorting I (§11)
[handouts] 2. Sorting II (§11) [handouts] 3. Sets and Selection (§11) [handouts] |
[tute week 10] [solutions] |
|
| 11 | 12 Oct | Text Processing |
1. Strings and Pattern Matching (§12)
[handouts] 2. Tries and Text Compression (§12) [handouts] 3. Text Similarity Matching (§12) [handouts] |
[tute week 11] [solutions] |
A3 Due (15%) |
| 12 | 19 Oct | Graphs |
1. Graphs (§13)
[handouts] 2. Graph Traversals (§13) [handouts] 3. Shortest Paths and Min. Spanning Trees (§13) [handouts] |
[tute week 12] [solutions] |
|
| 13 | 26 Oct | Revision |
1. CEVAL and Overview
[handouts] 2. Dictionaries [handouts] 3. Text Compression |
[tute week 13] [solutions] |