James A. Foster 

Analysis of Algorithms (Sp '96)CS 495/Math 475Instructor: Dr. James A. Foster This course covers techniques for analysing the efficiency of algorithms, and for using this information to design better ones. Here is the syllabus as is currently stands.
This document contatins:
Announcements
General Information
Programming ProjectIn this course, we implement three programs for the three processor scheduling problem. One uses a simple exhaustive search, another uses backtracking, and the third uses branch and bound. For details, see the project description.Here is a description of the criteria by which project papers are graded, and hints for getting a higher grade.
HomeworkThere will be approximately eight homework assignments (every two weeks). However, these will be graded on a pass/fail basis, where students who turn in the homeworks and make a genuine effort will pass. I will provide solutions. Here are the homework assignments for this semester:
See the homepage from 1994 for past homework. TestsHere is Test One (with answers). The average score was 65.1 with a standard deviation of 20.5. Letter grades are:
Here is Test Two (with answers). The average score was 129 with a standard deviation of 15.5. Letter grades are:
And here are some tests from years gone by:
Interesting Stuff
foster@cs.uidaho.edu 
Last Updated 01/13/2003 15:56 0800 