| Prerequisites | An elementary course in analysis of algorithms, such as CS 3130 or consent of instructor |
| Textbooks | Cormen, Leiserson, Rivest, and Stein. Introduction to Algorithms. McGraw Hill. |
| Initial class handout | |
The grade will be based on programming and homework assignments and two tests. Each assignment must be meticulously documented and clearly identify its purpose, author, and date. You are free to do the projects in C, C++, or Java, but the programs must execute on admiral. Tests are non-comprehensive but may have some overlap of material from one test to the next. The distribution of grades will be as follows:
| Programming Assignments | 60% |
| Two tests | 20% each |
/etc/exam_dates
| Test 1 | March 12, 2009 |
| Test 2 | May 07, 2007 |
Failure to hand in any assignment will result in an automatic zero for that assignment. If some student is unable to hand in an assignment by the deadline, he/she must discuss it with me before the deadline.
/etc/note
You have an account on one of the Unix machines on campus and you should use it for all assignments. Any assignment that fails to run on the Unix machines automatically gets a zero. You can communicate with all the students in the class using the email alias cs5130@cs.umsl.edu. Any message sent to this list will automatically go to all the students in the class. It may be a good idea to print the class notes before you come to class.
Algorithms course at SUNY, Stony Brook