(NOTE REVISED OFFICE HOURS as of 9-20-00!)
Instructor: Jeffrey Horn,
email: jhorn@nmu.edu
office: New Science Building 1119
phone: 227-1607
Office Hours: WThF 2:00-3:00,
are open office hours, no appt. necessary
WF 3:00-5:00 pm, Tu 10:00am-5:00pm, and Th 2:00-5:00
pm are by appointment only (email me!)
Textbook (required): Introduction to Algorithms,
by Cormen, Leiserson, & Rivest, available in Campus Bookstore
Classroom: New Science Building, Room
1207
Meeting Times: 1:00 - 1:50 am, MWF
Prerequisites: CS 222 and MA 240 or
MA 340
Our web page: http://cs.nmu.edu/~jeffhorn/Classes/CS422/Fall2000
(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.)
OVERVIEW
ANALYSIS OF ALGORITHMS Big-Oh, Omega, etc. Notation Time and Space Complexity THEORY OF COMPUTATION Abstract Models of Computation (Turing Machines, RAM model, etc.) Complexity Hierarchy Undecidability NP-Hardness, NP-Completeness ADVANCED DATA STRUCTURES AND ALGORITHMS Heaps and Priority Queues Advanced Sorting Advanced Trees
Late Policy: For programs and homeworks, 5% off for each day late (counting only days that the university is open; e.g., not weekends or snowdays). But of course I cannot accept them after solutions are handed out! As for exams, those cannot be made up except under the most severe and extenuating emergencies! Don't take a chance if you don't have to! (If we have "enough" assignments and/or quizes, I will drop the lowest grade in that category.)