Lecture plus recitation: M 5-8:00, Room 101
Final Exam: Monday, May 10, 5-6:50, Room 1302
Please note the room change and the three-hour time allocation
Office Hours: M 8-9, Th 2-3
Due to the unusual scheduling of the recitation,
the lecture and recitation discussions will be interleaved this semester.
W 3-5 Room 727
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 the curriculum.
recitation sessions, sophisticated problems will be solved by
the class in closely supervised individual, collaborative, and group efforts.
Due to the unusal scheduling of the recitation sessions this semester, the
sessions will be used as separators to break the lecture into three 45-minute
Inside Guide to Algorithms: their application, adaptation, design and analysis,
by A.R. Siegel and R.J.
Cole. The text is
available at Unique Copy Center, 252 Greene St. 212-420-9198
Algorithmic Design Paradigms
The Greedy Method
Sorting- and Selection-based processing
Algorithm Redesign and Adaptation
The Analysis of Algorithmic Performance
The Recursion Tree Solution Method
Managing Data for Efficient Processing
Lists, Stacks, Queues, Priority Queues, Trees and
Tarjan's Categorization of Data
Search Trees and their Enhancement
Sorting, Selection, and Hashing
Selected Representative Algorithms/problems
It will change as the lectures and organization are adapted to
fit the current time constraints.
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
There will be approximately 11 written homework assignments
that contain 10 to 15 multi-part exercises. Perhaps one-third
to one-half of these problems will be extremely challenging. That is,
the necessary concepts will have already been taught, but significant
thought will be needed to figure out how to apply these techniques
to solve the more challenging exercises.
- Students are not required to solve even the majority of the difficult
but they are expected to write down what ideas/methods they used, and where
their solution method seems to have broken down.
- Students are also expected to compare their own answers with the
solution handouts to see what concepts and techniques were overlooked.
Because more than a third
of the course is embedded in the exercises, students are expected to study the
answers as a vehicle for mastering the material.
- Homework will receive two grades: overall performance, and quality of
effort. Incorrect and even fragmentary incorrect answers can receive full
credit for the QoE grade.
Course Grading Policy
20% Midterm Exam
5% Overall homework performance grade
20% Overall QoE homework grade
47% Final Exam
8% Classroom participation
The homework and exam grading policy allocates significantly more credit for
incorrect and partial solutions that include an explanation about what is
wrong than for comparable answers that lack any such comments.