Basic Algorithms

Fall 2014 — CSCI-UA.0310-001 and -002

Instructor: Victor Shoup

Recitation Leader:


Office hours:

Mon 11-12:30 (room 605)
Tues 12:30-2 (room 705)

Tues 2-3:30 (room 805)
Wed 3-4:30 (room 905)

IMPORTANT: This class combines an honors section and a regular section. Section 001 is honors, section 002 is regular. The honors section students will get a few, more challenging projects to work on. Please make sure you know which one you are in.

Mailing List

Lectures: Tue, Thur, 11am-12:15pm, CIWW 109

Recitation: Wed, 12:30-1:45pm, CIWW 109

Grading: Homework 30%, midterm 30%, final 40%.

Course description: Big-O notation, algorithms with numbers (with applications to cryptography and hashing), divide and conquer algorithms, algorithms on graphs, greedy algorithms, dynamic programming, NP-completeness.

Midterm Exam: Tuesday, Oct. 21

Final Exam: TBA

Text: Algorithms, by S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani.

Supplemental reading:

Problem Sets