Fundamental Algorithms
G22.1170001 Fall 2003
Instructor: Victor Shoup

Phone: (212) 9983511

Office: 511 WWH

email: shoup AT cs DOT nyu EDU edu

Office hours: Fri. 56pm
Teaching Assistants

Shabsi Walfish  office hours: Wed. 67pm, room 525 WWH.
email: walfish AT cs DOT nyu DOT edu

Sumit Chopra  office hours: Thur. 78pm, room 1106 WWH.
email: sumit AT cs DOT nyu DOT edu
Mailing List

It is important that yous subscribe to the class mailing list,
in order to receive announcements.

To subscribe to the list, follow
these instructions.
Lectures: Mondays, 56:50pm, room 109 WWH
Recitation: Tuesdays, 77:50pm, room 109 WWH.
(Note: no recitation on Sept. 2)
Text: An Inside Guide to Algorithms: their Application,
Adaptation, Design, and Analysis
by
Alan Siegel and Richard Cole.
Available for purchase at Unique Copy, at 252 Greene Street.
Supplemental Notes
Grading:
There will be a a number of problem sets, a midterm exam, and a final
exam.
There will be little or no programming assignments.
Grades will be determined as follows:

problem sets: 30%

midterm exam: 35% (midterm is scheduled for Oct. 20, in class)

final exam: 35%
Course description:
This is an introduction to the design and analysis of
algorithms.
Topics to be covered are as follows:

Mathematical tools of algorithmic analysis

Basic data structures and their significance

Sorting

Searching

Algorithms on graphs

Algorithm design paradigms

Introduction to Decidability and Computational Complexity
Problem Sets:

Problem Set 1, Due: Monday, Sept. 15.
(corrected 9/11/2003)

Problem Set 2, Due: Monday, Sept. 22.
(corrected 9/16/2003, 9/17/2003)

Problem Set 3, Due: Monday, Sept. 29.

Problem Set 4, Due: Tuesday, Oct. 7.
(corrected 9/30/2003)

Problem Set 5, Due: Monday, Oct. 13.

Problem Set 6, Due: Monday, Oct. 27.

Problem Set 7, Due: Monday, Nov. 3.

Problem Set 8, Due: Monday, Nov. 10.

Problem Set 9, Due: Monday, Nov. 17.

Problem Set 10, Due: Monday, Nov. 24.

Problem Set 11, Due: Monday, Dec. 8.