CS 447/647 Computer Algorithms
|2||Growth of Functions|
|6||Counting and Probability|
|9||Sorting in Linear Time|
|10||Medians and Order Statistics|
|23||Elementary Graph Algorithms|
|24||Minimum Spanning Trees|
Exams: There will be three hour exams. There will be no final exam. Tentative dates for the exams are: 9/30, 10/28, 12/2
Homework: The homework will consist of exercises, primarily from the text, but also from me. These homework will be assigned on a weekly basis. In determining your final grade, your lowest homework grade will be dropped. In addition to the written homeworks, there will be one programming assignment.
Academic Integrity: All work in this course should be individual effort. It is perfectly fine (and even encouraged) to discuss the homework problems with me or other students, but the work should be your own. A first time or minor infraction of this policy on a homework assignment will be penalized by a grade of 0 for that assignment. Repeated or flagrant violations will result in a grade of F for the course.