COMP3600/6466: Algorithms

Unit Lecturer:

Professor Brendan McKay
with a few lectures by Dr. Billy Duckworth.

General Information

General Description

Discussion Forum

Please check regularly for announcements concerning classes, assignments, etc.

  • Announcement Board
  • COMP3600 Discussion Board

    Consultation times

    Students are welcome to see the lecturer at any time (room N336, CSIT building) except in the hour before a lecture. However, he doesn't like getting up early in the morning, keeps irregular hours, might have a visitor, etc, etc, so this unusual amount of choice is a mixed blessing. Don't knock on his door if it isn't open. If you want to check that he is present and available before visiting, ring him on 6125 3845 or make an appointment by email.

    Lectures

    Every student is encourged to participate in lectures. The lecture slides don't reflect the whole content delivered in the classroom and therefore don't necessarily include all that is on the exam!

    Lecture times
    Tuesday 12:00-13:00 Chem T1
    Wednesday 12:00-13:00 Engn T
    Thursday 10:00-11:00 JD 102

    The lecture slides are here.

    Handouts

  • Tutorial 1 questions
  •    Tutorial 1 solutions
  •    Lab 1 task
  •    linear_select.c
  • Assignment 1
  • Tutorial 2 questions
  •    Tutorial 2 solutions
  •    Lab 2 task
  •    alignment.c
  • Assignment 2
  •    bstree.c
  • Tutorial 3 questions
  •    Tutorial 3 solutions
  •    Lab 3 task
  •    topsort.c
  • Tutorial 4 questions
  •    Lab 4 task
  •    Dijkstra.c
  •    test.data
  • Solutions for 2006 exam
  • Alternate Notes

    A course based on the same text given by the Australian Partnership for Advanced Computing produced the following lecture notes. Students in COMP3600/6466 might find them useful as a supplement.

    lecture text chapter: alternate notes
    Lecture 1 Chapters 1 & 2 Introduction [pdf]
    Lecture 2 Chapter 3 Function Growth[pdf]
    Lecture 3 Chapter 3 Function Comparison [pdf]
    Lecture 4 Chapter 3 & 4
    Lecture 5 Chapter 4 Recurrences [pdf]
    Lecture 6 (Mathematical Tools: R&A)
    Lecture 7 Chapter 9 Medians and Order Statistics [pdf]
    Lecture 8 Chapter 9
    Lecture 9 Chapter 15 Dynanic Programming [pdf]
    Lecture 10 Chapter 15
    Lecture 11 Chapter 15 & 16 Greedy Algorithms [pdf]
    Lecture 12 Chapter 16
    Lecture 13 (Design Methodologies: R&A)
    Lecture 14 Chapter 16
    Lecture 15& 16 Chapter 11 & 16 Hash Tables [pdf]
    Lecture 17 Chapter 12 Binary Search Trees [pdf]
    Lecture 18 & 19 Chapter 13 Red-Black Trees [pdf]
    Lecture 21 & 22 Chapter 21 Dsijoint Sets [pdf]
    Lecture 23 (Data Structures: R&A)
    Lecture 24 & 25 Chapter 22 Basic Graph Algorithms [pdf]
    Lecture 26 & 27 Chapter 23 Minimum Spanning Trees [pdf]
    Lecture 28 & 29 Chapter 24 Single Shortest Paths [pdf]
    Lecture 30 & 31 Chapter 25 All Pairs Shortest Paths [pdf]
    Lecture 32 Course Review

    Past exam papers

    2005 final exam

    2006 final exam

    Sources of Information, Help and Extensions