CSC 344
Algorithms and Complexity

Dr. Stephen Bloch

Spring, 2005

This course meets on Tuesdays and Thursdays from 9:25-10:40 AM in Science 236. The last time I taught this course was Spring 2004.

The textbook Introduction to the Design and Analysis of Algorithms, by Anany Levitin, is required. It's been ordered by the Adelphi bookstore; it's probably also available for slightly less money from amazon.com, Barnes & Noble, and fatbrain.com.

Here's the syllabus.

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.
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 explain.

Getting Help

My office hours (in Alumnae Hall 113A) are TBA.

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

Last modified: