CSE 450/598 Design and Analysis of Algorithms Fall 2002

Instructor: Goran Konjevod 
Office: GWC 312, 
phone: 5-2783}, email: goran@asu.edu

Class: 9:15--10:30 TR, LSE B04
Schedule line number 41665 (CSE 450), 16013 (CSE 598)
Office hours: 10:30--12 TR, GWC 312

Textbook: Algorithm Design---Foundations, Analysis
and Internet Examples, Michael T. Goodrich and Roberto Tamassia,
Wiley, ISBN 0-471-38365-1

Web site: http://www.eas.asu.edu:/~cse450

Course description

This is a ``second'' course in algorithms.  It may be taken for
undergraduate (CSE450) or graduate (CSE598) credit.  The students
are expected to understand the material typically covered in
CSE310 (and its prerequisites such as MAT243).  In particular, 
you should know how quicksort and mergesort work (and be able
to write and solve a reccurrence relation for mergesort),
you should be able to use the ``big-Oh'' notation and
you should have seen the algorithms of Dijkstra and Prim
and have at least an intuitive understanding of how they work.

We will loosely follow the textbook and supplement it with
a few handouts.

Topics covered will include fast algorithms for arithmetic,
matrix multiplication, some data structures (splay trees, fibonacci
heaps, union-find) and amortized analysis, minimum
spanning trees, network flows and matchings, geometric and
parallel algorithms.  

Additional topics will be covered according to the interest of students
taking the class.  If you are particularly interested in an algorithms
topic and would like to see it covered, let me know and I'll do what I can.

Assignments and grading

There will be weekly homework assignments, one or two
midterms and a final exam.  Each of these will contribute
to the grade.  In addition, you may take a programming assignment 
for extra credit.









\bye