Algorithms and Complexity
Dr. Stephen Bloch
This course meets on Mondays, Wednesdays, and Fridays from 12:00-12:50
PM in Harley 106.
The last time I taught this course was Spring
Algorithm Design, by Kleinberg & Tardos,
It's been ordered by the Adelphi bookstore; it's probably also available
for slightly less money from amazon.com,
Barnes & Noble, and
Here's the syllabus.
updated schedule contains
the latest updates to homework due dates, lecture topics, etc.
Please check the schedule regularly and keep up on the assigned reading!
I'll assign several homework assignments during the semester, a mix
of "analysis on paper" assignments, programming assignments, and pseudocode
Reading and Support
In conjunction with our discussion of asymptotic growth
rates, see my Web page on growth rates.
- I've arranged to use an on-line package of animated
algorithms, Algorithms in Action. Use the username "guest" and
the password "adelphi", radio button "guest".
- 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
- Jan. 31: I just ran across this game, which gives you a feel
for what graph-theoretic algorithms are about.
My office hours are
- Mondays 3:40-5:00 (in SCI 227),
- Tuesdays 10:00-4:00 (in Alumnæ 113A; if I'm not there,
look in the computer lab around the corner in Alumnæ 114), and
- Thursdays 10:00-4:00 by appointment.
You are visitor number
to this page
since Jan. 13, 1997.
Stephen Bloch / firstname.lastname@example.org