2501 ICT Programming 3
Semester 1, 2006
LOGAN CAMPUS
Logan Convener
Professor Vladimir (Vlad) Estivill-Castro, PhD
Email:v.estivill-castro (the at symbol) griffith.edu.au
Logan Schedule
-
(Week 1) Lecture.- Introduction (PDF FULL SLIDES and 3-SLIDIES a page)
- (Week 2) Lecture .- Preconditions and Post-conditions (Programming by contract/decoupling) and Object Oriented Programming (PDF FULL SLIDES and 3-SLIDIES a page)
- (Week 3) Lecture.- Complexity and Algorithm Analysis (PDF FULL SLIDES and 3-SLIDIES a page)
- (Week 4) Lecture - Algorithms and Data Structures COLLECTIONS (PDF FULL SLIDES and 3-SLIDIES a page)
- (Week 5) Lecture - Linked Lists (PDF FULL Slides and 3-SLIDES a page)
- (Week 6)
Lecture - Queues and Stacks, and intro Hierarchical Data Structures (Binary Search Trees) (PDF FULL Slides and 3-SLIDES a page)
- Tutorial 5 Memory management (reading) and tutorial (with discussion of virtual functions and makefiles) and tutorial on strings. Do an exercise on memory management and one on strings
- (Week 7)
Lecture - Graphs, (PDF Full Slides and 3-Slides a page)
- (Week 8)
Processes and Threads (PDF Full Slides and 3-Slides a page)
- (Week 9)
Interprocess communication
(PDF Full Slides and 3-Slides a Page)
- (Week 10)
- Tutorial 9 Execute the following program in dwarf (make sure you can delay each process so that you can use ps to see the effects)
- (Week 11)
Marks for the Logan Campus (to be updated regularly)