CSC 344
Algorithms and Complexity

Dr. Stephen Bloch

Spring, 2008

This course meets on Tuesdays and Thursdays from 1:40-2:55 PM in either Hagedorn 105 or Alumnae 116 or somewhere else. The last time I taught this course was Spring 2007.

See the syllabus (which is finally up!) for more details.

The textbook Analysis of Algorithms: an Active Learning Approach, by Jeffrey McConnell, is required. It's been ordered by the Adelphi bookstore; it's probably also available for slightly less money from amazon.com and Barnes & Noble.

An 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!

Homework Assignments

I'll assign several homework assignments during the semester, a mix of "analysis on paper" assignments, programming assignments, and pseudocode assignments.

Reading and Support

In conjunction with our discussion of asymptotic growth rates, see my Web page on growth rates.
See the Complete Collection of Algorithm Animations for visualizations of some of the algorithms we'll study this semester.
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.

Getting Help

My office hours are TBA.

You are visitor number to this page since Jan. 13, 1997.

Last modified:

Stephen Bloch / sbloch@adelphi.edu