James A. Foster
Analysis of Algorithms (Spring 2005)
CS 395/Math 395
In this course, we will learn mathematical techniques for quantifying the inherent efficiency of algorithms in an implementation independent way. We will then discuss several ways to design better algorithms. In particular, we will look at divide and conquer strategies, dynamic programming, backtracking, branch and bound, probabilistic algorithms, and approximation algorithms. The focus of the course is on answering the questions: how good is my best algorithm for a given task, and what do I do if that isn't good enough?
The course webpage, with announcements, grades, and more, is available for registered students on WebCT. This webpage is general public information.
Tues 15.30-16.45 in JEB 229, Wed 11.00-11.20 Online in the chat room.
TA: Tim Meekhoff (email at timothym at cs dot uidaho dot edu) is available in the CSAC (2nd floor of JEB) 9.00-10.30 MW and 9.30-010.30 Fr.
The (required) textbook for the course is: Fundamentals of Algorithmics, Brassard and Brately. Prentice Hall, 1995.
My philosophy on grading is to give you the highest grade I can without embarassing either of us. I will round down for the midterm grades, which will be based on homework and the Midterm exam, and will consider class participation and any upward/downward trends in the project, homeworks, or exams when rounding scores for the final grades. Grades will be determined approximately as follows:
Past Exams (very old!)
Last Updated Thursday, May 5, 2005 16:37