CS 422 Fall 2002                     SYLLABUS                   August 28, 2002

Instructor:      Jeffrey Horn,  email:     jhorn@nmu.edu
                        office:   New Science Building 1119
                        phone:  227-1607

Office Hours:    MWF 11:00am-12:00noon, are open office hours, no appt. necessary
                            Wed  12:00noon-5:00pm,  Thur  11:00am-2:00pm,  and Fri. 12:00noon-1:00pm are by appointment only (email me!  and wait for my response!)

Textbook (required):  Introduction to Algorithms,
                                        by Cormen, Leiserson, & Rivest, available in Campus Bookstore

Classroom:   New Science Building, Room 1209
Meeting Times:  10:00 - 10:50 am,  MWF
Prerequisites:   CS 222 and MA 240 or MA 340
Our web page:   http://cs.nmu.edu/~jeffhorn/Classes/CS422/Fall2002

 (I will use the web page EXTENSIVELY, posting everything I can up there as soon as possible.  This includes all electronic forms of handouts, assignments, solutions, sample tests, etc.  Also I will post announcements, links to interesting, topic-related sites, etc.  So please check our page regularly!  At the very least, twice a week.  We will also have a WebCT page for posting grades, etc.)



TOPICS:  (tentative)

OVERVIEW

Abstract Models of Computation (Turing Machines, RAM model, etc.)

Complexity Hierarchy

Undecidability

NP-Hardness, NP-Completeness

Heaps and Priority Queues
Advanced Sorting
Advanced Trees