|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
MaC 3035 Algorithms
Dr. Schwartz |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Robert Sedgewick
Addison-Wesley |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
We will study algorithms for the computer solution of a wide
variety of problems, primarily using a von Neumann type architecture. We will
discuss data structures needed to implement these algorithms. We will spend much
time discussing the relative efficiency of different algorithms and we will develop
methods for measuring this efficiency. We will examine recurrence relations for
various algorithms. We will discuss the possible trade off of efficiency for
guaranteed results. We will also discuss the question of NP-completeness. We
will mention some completely different methods that might be applied to massively parallel
architectures. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
There will be at least three, and no more than seven, large
programming assignments that will count for 30% of the grade. There will be a
mid-term that will count for 20% of the grade and there will be a final exam counting
40%. There will be a paper that will count for the remaining 10% of the grade. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Monday and Thursday, 1:00 - 2:30 and by appointment
Room 8, Brownson Wing
Telephone: 914 323 5324
I can, of course, always be reached by email at
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|