Basic Algorithms
CSCIUA.0310001 and 002 Fall 2012
Lectures: Mon/Wed 23:15pm, room 102 WWH
Recitation: Thurs 9:3010:45am, room WWH 102
Instructor: Victor Shoup

Phone: (212) 9983511

Office: 418 WWH

email: shoup@cs.nyu.edu

Office hours: Tuesdays, 121pm, or by appointment
Grader/recitation leader: Sriram Rangarajan
<sr2776@nyu.edu>
Mailing List

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

To subscribe to the list, follow
these instructions.
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, 23: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:
CSCIUA.0102 and MATHUA.0120.
Text:

Introduction to Algorithms (3rd edition),
by Cormen, Leiserson, Rivest, and Stein.
Acedemic Integrity:

Students should review the department's academic integrity policy

Students are to do all assignments individually.

High level discussion of ideas in working on assignments is permitted, but all writing
must be done individually.
If you do discuss an exercise with a fellow student,
you must write down the name of that student on the homework when you hand it in.
You will not be penalized for this  but you may face penalties if you fail to do so.

You should not use any other resources to solve homework exercises.

Any cheating that occurs in homeworks or in exams will result in harsh penalties.
Disciplinary actions can vary in severity and can result in censure, disciplinary probation, suspension and/or dismissal from CAS
Lecture notes
Problem sets:

Problem Set 1, Due: Sept. 17

Problem Set 2, Due: Sept. 24

Problem Set 3, Due: Oct. 3

Problem Set 4, Due: Oct.10

Problem Set 5, Due: Oct.17

Problem Set 6, Due: Nov. 15

Problem Set 7, Due: Nov. 21

Problem Set 8, Due: Nov. 29

Problem Set 9, Due: Dec. 6

Problem Set 10, Due: Dec.12