2501 ICT Programming 3
Semester 1, 2006

LOGAN CAMPUS

Course outline

Cross-Campus WEB-site

Logan Convener

Professor Vladimir (Vlad) Estivill-Castro, PhD

Email:v.estivill-castro (the at symbol) griffith.edu.au

Logan Schedule

  1. (Week 1) Lecture.- Introduction (PDF FULL SLIDES and 3-SLIDIES a page)

  2. (Week 2) Lecture .- Preconditions and Post-conditions (Programming by contract/decoupling) and Object Oriented Programming (PDF FULL SLIDES and 3-SLIDIES a page)
  3. (Week 3) Lecture.- Complexity and Algorithm Analysis (PDF FULL SLIDES and 3-SLIDIES a page)
  4. (Week 4) Lecture - Algorithms and Data Structures COLLECTIONS (PDF FULL SLIDES and 3-SLIDIES a page)
  5. (Week 5) Lecture - Linked Lists (PDF FULL Slides and 3-SLIDES a page)
  6. (Week 6) Lecture - Queues and Stacks, and intro Hierarchical Data Structures (Binary Search Trees) (PDF FULL Slides and 3-SLIDES a page)
  7. (Week 7) Lecture - Graphs, (PDF Full Slides and 3-Slides a page)
  8. (Week 8) Processes and Threads (PDF Full Slides and 3-Slides a page)
  9. (Week 9) Interprocess communication (PDF Full Slides and 3-Slides a Page)
  10. (Week 10)
  11. (Week 11)

 

 

     

Marks for the Logan Campus (to be updated regularly)