Assignments

Assignment	Description & Handouts	Date Assigned	Date Due
Course Project	To get a grade for the course you must do a project directly related to one of the 10 algorithms. This must involve a careful look at one or more papers or books related to the algorithm and a development of our own which illuminates some strong point (or weak point) of the algorithm. The final result should be an 8-10 page paper summarizing, documenting and explaining your findings. About halfway through the course, you must submit a one-page plan outlining your project. We have regular office hours and will make a series of short slots available to discuss possible projects and help with references. A good project should go beyond the available literature in some way. This may be: "I tried out the following alternative to the basic algorithm and ran some comparisons, here is what happened" "I found understanding the basic idea behind the algorithm hard and found the following simple method of seeing why step x works" "Here is a running time or stability analysis of this step" "I'm an x-scientist, in my field no one ever heard of algorithm y--I found a neat problem to try it out on" "I got interested in the original paper describing the algorithm and decided to rerun their analysis to duplicate their numbers." The journal Computing in Science and Engineering, Vol. 2, No. 1 is devoted to the ten algorithms with a short article and references for each. This is in the engineering library and will be posted on the site. In addition, we will make references available.	Jan 15	Mar 21

Assignment

Description & Handouts

Date Assigned

Date Due

Course Project

To get a grade for the course you must do a project directly related to one of the 10 algorithms. This must involve a careful look at one or more papers or books related to the algorithm and a development of our own which illuminates some strong point (or weak point) of the algorithm.

The final result should be an 8-10 page paper summarizing, documenting and explaining your findings. About halfway through the course, you must submit a one-page plan outlining your project. We have regular office hours and will make a series of short slots available to discuss possible projects and help with references.

A good project should go beyond the available literature in some way. This may be:

"I tried out the following alternative to the basic algorithm and ran some comparisons, here is what happened"
"I found understanding the basic idea behind the algorithm hard and found the following simple method of seeing why step x works"
"Here is a running time or stability analysis of this step"
"I'm an x-scientist, in my field no one ever heard of algorithm y--I found a neat problem to try it out on"
"I got interested in the original paper describing the algorithm and decided to rerun their analysis to duplicate their numbers."

The journal Computing in Science and Engineering, Vol. 2, No. 1 is devoted to the ten algorithms with a short article and references for each. This is in the engineering library and will be posted on the site. In addition, we will make references available.

Jan 15

Mar 21