CS331: Algorithms and Complexity, Fall 2017

Logistics: Lecture: Tue/Thu 9:30 - 11:00, UTC 4.122
Discussion section: Mon 1:00 - 2:00/2:00 - 3:00, RLM 7.114
Course web page: http://www.cs.utexas.edu/~ecprice/courses/331/
Unique numbers: 51590/51595
Professor: Eric Price
Email: ecprice@cs.utexas.edu
Office: GDC 4.510
Office Hours: 4-5pm Thursday
TA: Ziyang Tang
Email: ztang@cs.utexas.edu
Office Hours: 3-4pm Monday.
Problem Sets:
Course Notes: Jeff Erickson's notes may be useful, in addition to these:
  1. Multiplication (August 31)
  2. Master Theorem (September 5)
  3. Fibonacci Numbers (September 7)
  4. Interval Scheduling (September 12)
Content: This undergraduate course will cover the basics of algorithms and complexity. The tentative outline for the course is as follows, with one week per topic:
  • Introduction: interval scheduling
  • Basic dynamic programming
  • Advanced dynamic programming
  • Shortest paths
  • Test 1; more graph problems
  • Network flows, maximum matching, and minimum cut
  • Linear Programming
  • Approximation algorithms
  • Test 2; Randomized algorithms
  • NP-completeness
  • Hash tables
  • Advanced Topics
Prerequisites: The following coursework with a grade of at least C-: CS 311, 311H, 313H, or 313K; CS 307, 314, 314H, 315, or 315H; CS 310, 310H, 429, or 429H; M362K or SSC321; and credit with a grade of at least C- or registration for M340L or SSC329C.
Grading: 40%: Homework
30%: Two in-class exams
20%: Final exam
10%: Class attendance and participation
Key dates:
  • Exam 1: Thursday, October 5.
  • Exam 2 : Thursday, November 9.
  • Final exam: TBA.
Text: Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein. Note that some topics covered in the course will not appear in the textbook.
Homework
policy:
There will be a homework assignment every 1-2 weeks.

Collaboration policy: You are encouraged to collaborate on homework. However, you must write up your own solutions. You should also state the names of those you collaborated with on the first page of your submission.
Students with
Disabilites:
Any student with a documented disability (physical or cognitive) who requires academic accommodations should contact the Services for Students with Disabilities area of the Office of the Dean of Students at 471-6259 (voice) or 471-4641 (TTY for users who are deaf or hard of hearing) as soon as possible to request an official letter outlining authorized accommodations.

Additional Class Policies

You should read the CS Department Code of Conduct. The policies described there will be followed in this class.