CSC 344
Algorithms and Complexity
Dr. Stephen Bloch
Spring, 2001
This course meets from 12:00:12:50 MWF in Alumnae Hall, room 2.
The textbook
Fundamentals of Sequential and Parallel Algorithms, by Kenneth
Berman and Jerome Paul, is required. It's available from amazon.com for
$83, Barnes & Noble for $86, or fatbrain.com for $83.
The
syllabus
will be available in LaTeX,
DVI,
Postscript, and
HTML.
An
updated schedule will
contain
the latest updates to homework due dates, lecture topics, etc.
Please check the schedule regularly and keep up on the assigned reading!
I shall assign several homework assignments during the semester, a mix
of "analysis on paper" assignments, programming assignments, and pseudocode
assignments.
Reading assignments
-
In conjunction with our discussion of asymptotic growth
rates, see my Web page on growth rates.
- Different people learn (and teach) in different ways.
Try taking a Learning Styles Questionnaire to discover your own style and get
some tips on how to handle classes taught in a different style.
If you're having trouble with the way I explain things, it could just be
that I'm strongly intuitive and you're strongly sensitive (or something
like that); point it out to me, and I'll try to find another way to
explain.
You are visitor number
to this page
since Jan. 13, 1997.
Last modified:
Stephen Bloch / sbloch@boethius.adelphi.edu