SYLLABUS August 27, 2002
Instructor: Jeffrey Horn,
email: jhorn@nmu.edu
office: New Science Building 1119
phone: 227-1607
Office Hours:
Textbook (required): Genetic Algorithms in Search, Optimization, and Machine Learning, by David E. Goldberg
Classroom: New Science Building, Room 1209
Meeting Times: 3:00 - 4:40 pm
Tu,Th
Prerequisites: CS 122 or equivalent (one
year) of programming experience, and MA 240, or permission of instructor.
Our web page: http://cs.nmu.edu/~jeffhorn/Classes/EC/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.)
OVERVIEW
Hill-Cilmber
The Simple Genetic Algorithm
Abstract Models of Computation (Turing Machines, RAM model, etc.)Complexity Hierarchy
Undecidability
NP-Hardness, NP-Completeness
Heaps and Priority QueuesAdvanced SortingAdvanced 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.)
Your NMU ThinkPad. And perhaps, optionally, the
Parallel Computing Lab and the Linux Lab.