G22.1170-001

Fundamental Algorithms, fall 2007

Alan Siegel
Mondays, 5-5:50 (recitation) Room 109
Wednesdays 5-6:50 (main lecture) Room 109

Office Hours: Mondays 6-7, Wednesdays 7-8
Teaching Assistance:
TA tutoring Monday 6-7 and Tuesday 4-5 (Ashish Rastogi rastogi@cs.nyu.edu 998-3177 818 WWH)
TA tutoring Tuesday 5-6 and Wednesday 3-4 in room 427 [office-hours phone in 427: 998-3090] (Saurabh Kumar skumar@cs.nyu.edu 998-3514)


This course covers the design and analysis of combinatorial algorithms. The curriculum is concept-based and emphasizes the art of problem-solving. The class features weekly exercises designed to strengthen conceptual understanding and problem solving skills. Students are presumed to have adequate programming skills and to have a solid understanding of basic data structures and their implementation in the programming languages of their choice. Although some mathematical sophistication is very helpful for this course, the necessary mathematics is contained within in the curriculum.

Because of the emphasis on problem solving, students are strongly advised to attend the Monday recitation sessions, where sophisticated concepts will be reviewed and illustrated in depth.

Algorithmic Design Paradigms

Recursion
Depth-First-Search
Breadth-First-Search
The Greedy Method
Divide-and-Conquer
Dynamic Programming
Sorting- and Selection-based processing
Randomization
Algorithm Redesign and Adaptation
Problem Transformations

The Analysis of Algorithmic Performance

Asymptotic Growth
Recurrence Equations
The Recursion Tree Solution Method
Probabilistic Analysis
Structural Analysis
Lower Bounds

Managing Data for Efficient Processing

Lists, Stacks, Queues, Priority Queues, Trees and Graphs
Tarjan's Categorization of Data Structures
Search Trees and their Enhancement
Union-Find
Sorting, Selection, and Hashing

Selected Representative Algorithms/problems

Topological Sort
Connected Components
Biconnected Components and Strong Components
Representative styles of Dynamic Programming and their applications
Standard Sorting and Selection Algorithms
Selected topics in Hashing
Minimum Spanning Trees
Shortest Path Problems

Required Text:

An Inside Guide to Algorithms: their application, adaptation, design and analysis, by A.R. Siegel and R.J. Cole. Available at Unique Copy Center, 252 Greene St.