Note this schedule is only indicative.
| Weeks/Dates | Material Covered | Lecture Recording | Workshop Recording |
|---|---|---|---|
| Week 0: Feb 28 - Mar 4 |
Syllabus, Course Introduction
Reading:
Chapters 1, 2 & 13.2 of PPSAA
|
|
Workshops start in Week 2. Use the Link to Access Grok Learning in the Weekly Schedule module to access Grok for the first time. This will activate your access to Grok via university email for subsequent accesses. |
| Week 1: Mar 7 - Mar 11 |
Selection, Iteration, and Abstraction in C
Reading:
Chapters 3,4 and 5 of PPSAA
|
Workshop 1 | |
| Week 2: Mar 14 - Mar 18 |
Functions
Reading:
Chapters 5 and 6 of PPSAA
|
|
Workshop 2 |
| Week 3: Mar 21 - Mar 25 |
Memory layout, Pointers, Arrays
Reading:
Chapters 6, 7 and 12 of PPSAA
|
Workshop 3 | |
| Week 4: Mar 28 - Apr 1 |
Analysis of Algorithms, 2D Arrays
Reading:
Chapter 7 and 12 of PPSAA
Assessment: Mid-semester Test
|
Workshop 4 | |
| Week 5: Apr 4 - Apr 8 |
Analysis of Algorithms, Quicksort
Reading:
Chapter 12 of PPSAA
Assessment: Assignment 1 Released
|
Workshop 5 | |
| Week 6: Apr 11 - Apr 15 |
Strings, Pattern search, String indexing
Reading:
Chapter 7 of PPSAA
|
Workshop 6 | |
| Apr 15 - Apr 24 | Mid Semester Break! | No Workshops | |
| Week 7: Apr 25 - Apr 29 |
Structures and dynamic memory allocation, Abstract data types: linked lists, queues, stacks, and binary search trees
Reading:
Chapters 8 and 10 of PPSAA
|
|
Workshop 7 |
| Week 8: May 2 - May 6 |
Linked Lists and Binary Search Trees
Reading:
Chapter 10 of PPSAA
Assessment: Assignment 2 release
|
||
| Week 9: May 9 - May 13 |
Binary Search Trees and Files
Reading:
Chapter 11 of PPSAA
|
|
|
| Week 10: May 16 - May 20 |
Files, Number representations.
Reading:
Chapters 11 and 13 of PPSAA
|
|
|
| Week 11: May 23 - May 27 |
More algorithms, C programming tools, and wrap up
Reading:
Chapter 9 of PPSAA
|
Most course content © University of Melbourne, (CRICOS: 00116K ABN: 84 002 705 224)