The course consists of thirty lectures spread over the thirteen teaching weeks of first semester. Accordingly, some lecture slots are not used. Check the lecture schedule below.
| Lecture A: | Monday 9am | ENGNT* |
| Lecture B: | Tuesday 9am | ENGNT* |
| Lecture C: | Friday 9am | MCCT4* |
*From Tues week 2, until end of week 5, we will be using CSIT N329 instead of ENGNT and MCCT4 for lectures.
ENGNT is the Lecture Theature of the Engineering Building and MCCT4 Theatre 4 of the Manning Clark Centre (MCC). The Engineering Building is building 32 and MCC is building 26a in quadrant 2 of the campus map.
Lectures will be held (or not) according to the following schedule, with other course activites also noted. Note: This schedule is subject to change, please check it regularly.
| Week: | Lect A: | Lect B: | Lect C: | Tut/Lab: | Assessment items: |
| 1 | IQ.Lect1 | Entry Quiz (Fri) | |||
| 2 | IP.Lect1 | IP.Lect2 | IP.Lect3 | IP.TutLab1 | |
| 3 | IP.Lect4 | IP.Lect5 | IP.TutLab2 | ||
| 4 | IP.Lect6 | IP.Lect7 | IP.Lect8 | IP.TutLab3 | |
| 5 | IP.Lect9 | IP.Lect10 | IP.Lect11 | IP.TutLab4 | Assgt. 1, Wed 17:00 |
| 5 | Mid-sem Quiz, Thu 17:00 | ||||
| 6 | DA.Lect1 | DA.Lect2 | DA.Lect3 | DA.TutLab1 | |
| 7 | DA.Lect4 | DA.Lect5 | DA.TutLab2 | ||
| 8 | DA.Lect6 | DA.Lect7 | DA.Lect8 | DA.TutLab3 | |
| 9 | DA.Lect9 | SE.Lect1 | SE.Lect2 | DA.TutLab4 | Assgt 2 due (end) |
| 10 | SE.Lect3 | SE.Lect4 | SE.Lect5 | SE.TutLab1 | |
| 11 | SE.Lect6 | SE.Lect7 | SE.TutLab2 | ||
| 12 | SE.Lect8 | SE.Lect9 | SE.TutLab3 | Assgt 3 due (end) | |
| 13 | RL.Lect1 | SE.TutLab4 |
| 1 | IQ.Lect1 | Introduction to COMP1120 | 1-up, 4-up |
| 2 | IP.Lect1 | Notations for Expressing Syntax | Notes |
| 3 | IP.Lect2 | Abstract machines, object creation | |
| 4 | IP.Lect3 | Assignment, loop | |
| 5 | IP.Lect4 | Arrays, inheritance | |
| 6 | IP.Lect5 | More inheritance | |
| 7 | IP.Lect6 | Data representation | |
| 8 | IP.Lect7 | Algorithms | |
| 09 | IP.Lect8 | Structured Programming | Notes |
| 10 | IP.Lect9 | Simulation, abstract classes | Notes |
| 11 | IP.Lect10 | Assertions and contracts | Notes |
| 12 | IP.Lect11 | Container classes, implementation | Notes |
| 13 | DA.Lect1 | Programming by Contract & Defensive Programming | 1-up, 4-up |
| 14 | DA.Lect2 | Self-Documenting Code | 1-up, 4-up |
| 15 | DA.Lect3 | Data Structures and Types | 1-up, 4-up |
| 16 | DA.Lect4 | Inheritance (II) | 1-up, 4-up |
| 17 | DA.Lect5 | Searching | 1-up, 4-up |
| 18 | DA.Lect6 | Recursion | 1-up, 4-up |
| 19 | DA.Lect7 | Recursive Data Structures | 1-up, 4-up |
| 20 | DA.Lect8 | Recursive Algorithms | 1-up, 4-up |
| 21 | DA.Lect9 | Regular Expressions | 1-up, 4-up |
| 22 | SE.Lect1 | Why Software Engineering? | 1-up, 4-up |
| 23 | SE.Lect2 | Mathematics in Software Engineering | 1-up, 4-up |
| Mathematics in Software Engineering - Extra Material | 4-up | ||
| 24 | SE.Lect3 | Verification & Validation 1 | 1-up, 4-up |
| 25 | SE.Lect4 | Verification & Validation 2 | 1-up, 4-up |
| 26 | SE.Lect5 | Documentation | 1-up, 4-up |
| Documentation - Extra Material | 4-up | ||
| 27 | SE.Lect6 | Reusable Software | 1-up, 4-up |
| Reusable Software - Extra Material | 4-up | ||
| 28 | SE.Lect7 | Tetris & Frogger | 1-up, 4-up |
| 29 | SE.Lect8 | Decomposition | 1-up, 4-up |
| 30 | SE.Lect9 | Software Engineering - The Big Picture | |
| 31 | RL.Lect1 | Review, Study Hints and Tournament Results | 1-up, 4-up |
Feedback & Queries:
Peter Strazdins