CSE 450/598 Design and Analysis of Algorithms

Arizona State University, Fall 2002
TTh 9:15-10:30 AM, LSE B04

Instructor: Goran Konjevod, GWC 312
Office hours: T,Th 10:30-12:00

Syllabus in postscript and txt formats.

Final exam scores and class grades.

Solution sketches for the final in postscript and pdf

Web-sites of interest:
Jeff Erickson's notes.
(In particular, local copies of his notes on Minimum spanning trees and Shortest paths.
Analysis of algorithms home page
Other algorithms courses
The Stony Brook algorithm repository
Donald Knuth's home page
Dictionary of algorithms, data structures and problems
 

Note on accessing the files: homeworks and most other handouts are
available as PostScript files.  This is a standard format understood by
many programs and most laser printers. The files can be printed or
viewed using the free program Ghostview available on all campus PCs,
or the Adobe Acrobat (not Acrobat Reader), which can also convert them into pdf.