Basic Algorithms

CSCI-UA.0310-001 and -002 Fall 2012

Lectures: Mon/Wed 2-3:15pm, room 102 WWH

Recitation: Thurs 9:30-10:45am, room WWH 102

Instructor: Victor Shoup

Grader/recitation leader: Sriram Rangarajan <sr2776@nyu.edu>

Mailing List

Grading: There will be homework exercises, a midterm exam, and a final exam. Honors students (enrolled in section 001) will complete additional exercises and projects.

Grades will be based on: 40% homework, 25% midterm, and 35% final.

Midterm Exam: Monday, Oct. 22, in class.

Final Exam: Monday, Dec. 17, 2-3:50pm, room WWH 102.

Course description: This is an introductory course in algorithms. We will cover standard topics such as sorting, recurrences, various data structures, graph algorithms, and dynamic programming. There will be no programming assignments. However, there will be extensive homework exercises in which students will design and analyze algorithms.

Prerequisites: CSCI-UA.0102 and MATH-UA.0120.

Text:

Acedemic Integrity:

Lecture notes

Problem sets: