Schedule
(to be adapted and refined throughout the course)
Weeks Semester 1 2013 |
Lectures |
||||||||
|---|---|---|---|---|---|---|---|---|---|
# |
from |
- | to |
All students: Monday |
Comp1130 only: Wednesday |
All students: Thursday |
|||
| 0 | 11 / 2 | - | 15 / 2 |
0-Week | |||||
| 1 | 18 / 2 | - | 22 / 2 | Organization & Contents | Introduction | ||||
| 2 | 25 / 2 | - | 1 / 3 | Introduction | Programming Foundations | ||||
| 3 | 4 / 3 | - | 8 / 3 | Programming Foundations | Live Programming (Types and functions) |
||||
| 4 | 11 / 3 | - | 15 / 3 | (Canberra day - no lecture) | Programming Foundations | ||||
| 5 | 18 / 3 | - | 22 / 3 | Essential Programming | Live Programming (Recursion) | ||||
| 6 | 25 / 3 | - | 28 / 3 | Abstract Types | [no class] | ||||
| 29 / 3 | - | 20 / 4 | Autumn break | ||||||
| 7 | 15 / 4 | - | 19 / 4 | Algebraic Types | Algebraic Types | ||||
| 8 | 22 / 4 | - | 26 / 4 | Algebraic Types | Research in Computer Systems |
(Anzac Day - no lecture) | |||
| 9 | 29 / 4 | - | 3 / 5 | Live Programming (Algebraic Types) |
Trees |
Algebraic Types | |||
| 10 | 6 / 5 | - | 10 / 5 | Modular Programming | Modular Programming | ||||
| 11 | 13 / 5 | - | 17 / 5 | Live Programming (Modular Programming) |
Complexity & Performance | ||||
| 12 | 20 / 5 | - | 24 / 5 | Complexity & Performance | Research in Artificial Intelligence |
Complexity & Performance | |||
| 13 | 27 / 5 | - | 31 / 5 | Reflection | Summary & Final exam preparation | ||||
| 3 / 6 | - | 22 / 6 | Preparation & examination period | ||||||
