Department of Computer Science Theory of Computer Algorithms (Winter 2008) 4005-800-01 (Calendar Description)

Home --- Syllabus --- Slides --- Assignments --- Resources

Instructor: Richard Zanibbi, Office hours: Tues 2-4pm, Thursday 10am-12pm (or by appointment), 70-3551 (Golisano College)
Lectures (NOTE: two locations):
Mondays 12-1:50pm (70-2590, Golisano College)
Wednesdays 12-1:50pm (70-3435, Golisano College)

Assignments

Written Assignments

Please note: some assignments will contain a programming question.

• Assignment 1 (due start of class, Wed. of Week 3)
  • Sample solution to programming question (Question 3). This is an O(m log n) implementation, as described in the K&T textbook using a binary heap implementation of a priority queue.
    • Dijkstra.java (main program reads in graph file, returns distances. With any second argument, will also trace the heap state).
    • Graph.java (main program reads in a graph file, and produces a .dot (GraphViz) file as output)
    • PriorityQueue.java
    • tests.zip test cases, example GraphViz output
• Assignment 2 (due Thurs. of Week 5)
• Assignment 3 (due Wed. of Week 9)
• Assignment 4 (due Thursday. of Week 10)

Programming Project

• Using Dynamic Programming Algorithms to Find Shortest Paths (due Fri. of Week 10)