| Week | Mon Date | Topic | Lecture Number and Subtopic | Tutorial | Assessment |
|---|---|---|---|---|---|
| 1 | 25 Jul | Introduction |
1. Course Overview
[handouts] 2. Arrays, Linked Lists and Recursion (§3) [handouts][slides] 3. Abstract Data Types (§2) [handouts][other] |
||
| 2 | 1 Aug | Analysis Tools |
1. Counting Primitive Operations (§4)
[handouts] 2. Asymptotic Analysis (§4) 3. Asymptotic Analysis (cont) (§4) [handouts] |
[tutorial] [solutions] |
|
| 3 | 8 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] |
[tutorial] [solutions] |
|
| 4 | 15 Aug | Trees |
1. Lists, Sequences and Iterators (§7)
[handouts] 2. General Trees (§7) [handouts] 3. Binary Trees (§7) [handouts] |
A1 available [COMP3506/7505 Assignment 1] [11COMP3506-A1.zip] |
|
| 5 | 22 Aug | Priority Queues |
1. Entries, Priority Queues and Heaps (§8)
[handouts] 2. Adaptable Priority Queues (§8) [handouts] 3. Algorithms using ADTs [handouts] |
[tutorial] [solutions] |
|
| 6 | 29 Aug | Maps, Hashtables and Dictionaries |
1. Maps and Hash Tables (§9)
[handouts] 2. Maps and Hash Tables (§9) (cont) 3. Dictionaries, and Skip Lists (§9) [handouts] |
[tutorial] [solutions] |
A1 Due (15%) [Assignment 1 criteria] |
| 7 | 5 Sep | Search Trees |
1. Binary Search Trees (§10)
[handouts] 2. AVL Trees (§10) 3. Mid Semester Exam [other] |
[tutorial] [solutions] |
|
| 8 | 12 Sep | Search Trees |
1. Splay Trees (§10)
[handouts] 2. (2,4) Trees (§10) [handouts] 3. Red-black Trees (§10) [handouts] |
[tutorial] [solutions] |
[Assignment 1 test files] |
| 9 | 19 Sep | Sorting |
1. Sorting (§11)
[handouts] 2. Sorting (cont) (§11) 3. Sorting (cont) (§11) [handouts] |
[tutorial] [solutions] |
A2 available [COMP3506/7505 A2] [11COMP3506-A2.zip] |
| 26 Sep |
Mid Semester Break |
||||
| 10 | 3 Oct | Sets and Strings |
1. Assignment 2 discussion
[handouts] 2. Sets and Selection (§11) [handouts] 3. Strings and Pattern Matching (§12) [handouts] |
[tutorial] [solutions] |
|
| 11 | 10 Oct | Text Processing |
1. Tries and Text Compression (§12)
2. Text Similarity Matching (§12) [handouts] 3. Text Similarity Matching (cont) (§12) [handouts] |
[tutorial] [solutions] |
A2 Due (15%) |
| 12 | 17 Oct | Graphs |
1. Graphs (§13)
[handouts] 2. Graph Traversals (§13) [handouts] 3. Shortest Paths and Min. Spanning Trees (§13) [handouts] |
[tutorial] [solutions] |
|
| 13 | 24 Oct | Revision |
1. Overview
2. Revision 3. Revision (cont) [handouts] |
[tutorial] |
[Week 7-1 in colour] [Week 8-3 in colour] |
§ refers to indicated section in the set text.