\ CSCI-GA.1170-001 Fundamental Algorithms , Spring 2012


CSCI-GA.1170-001 Fundamental Algorithms , Spring 2012

Lecturer: Esther Ezra , my first name at cs.nyu.edu, (212) 998-4859, room 416, WWH. Office hour: Wednesday 6:00--7:00PM
Meeting Time/Place: Mon 5:00--6:50PM, WWH 109 WWH.
Recitation Time/Place: Wed 5:00-5:50PM, WWH 109, WWH.
Graders: Arka Prava Bandyopadhyay , Ashish Walia .
Midterm: Mon, March 5 2012, 5:00--6:00PM, WWH109. Final: Mon, May 14 2012, 5:00--6:50 PM, WWH 109.
Mailing list: To subscribe to the class list follow instructions at
http://www.cs.nyu.edu/mailman/listinfo/csci_ga_1170_001_sp12
To post a message to all the list members, send email to csci_ga_1170_001_sp12@cs.nyu.edu. Please, post only messages interesting to everybody taking the class. Specific class-related questions and most of your other correspondence should be directed to the instructor.
Course Homepage: http://cs.nyu.edu/courses/spring12/CSCI-GA.1170-001/index.html

Lecture Notes:

Homework Assignments:

Midterm Sample:

Midterm Solution:

Final Sample:


Brief Course Description:

This course covers the design and analysis of combinatorial algorithms. The curriculum is concept-based and emphasizes the art of problem-solving. The course 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 would be helpful for this course, the necessary mathematics is contained within the curriculum. Because of the emphasis on problem solving, students are expected to attend the Wednesday recitation sessions. Be sure that you register for the recitation (section 002) as well as the class (section 001).

Course Topics

Textbook:

1. An Introduction to Algorithms: their methods and madness, by A.R. Siegel, available at 11 Waverly Place, which is just a few doors west of Mercer St.

2. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Cliff Stein, published by MIT Press.
You can get either the THIRD EDITION or the SECOND EDITION.

Grading:

There will be one in-class midterm and a final exam, in addition to approximately weekly homework assignments. Tentative grade split is 30% homework, 30% midterm and 40% final exam.

Homework:

There will be approximately 11 written homework assignments. Some of the homework exercises will be routine, but others will be more challenging. I do not expect you to solve all of the homework problems, but I hope that you will benefit from working on the more difficult ones. Homework will be assigned on Mondays, and will be due the following Mondays. No late homework will be accepted.

A few hints on the homework assignments: