CS331H: Algorithms and Complexity (Honors), Spring 2019

Logistics: Lecture: Mon/Wed 2:00 - 3:30, GDC 1.304
Discussion section: Fri 10:00-11:00 / 11:00-12:00, RLP 0.122
Course web page: http://www.cs.utexas.edu/~ecprice/courses/331h/
Unique number: 50910 / 50915
Professor: Eric Price
Email: ecprice@cs.utexas.edu
Office: GDC 4.510
Office Hours: 3:30-4:30pm Wednesday
TA: Akshay Kamath
Email: kamath@cs.utexas.edu
Office Hours: 12:00-1:00pm Friday
GDC basement
Problem Sets:
Course Notes: Lecture notes may be provided after class, but you should keep your own notes: topics will be covered in more detail in class than in the posted notes.
Content: This honors undergraduate course will cover the basics of algorithms. The tentative outline for the course is as follows, with one week per topic:
  • Introduction: interval scheduling
  • Basic dynamic programming
  • Advanced dynamic programming
  • Introduction to graphs; Test 1
  • Shortest paths, minimum spanning trees
  • Network flows, maximum matching, and minimum cut
  • Linear Programming
  • Test 2; Randomized algorithms
  • Approximation 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; credit with a grade of at least C- or registration for M340L or SSC329C; and consent of the honors director.
Grading: 40%: Homework
30%: Two in-class exams
20%: Final exam
10%: Class attendance and participation
Key dates:
  • Exam 1: Wednesday, February 20.
  • Exam 2 : Wednesday, April 3.
  • Final exam: take-home between last two classes.
Text: There is no formal requirement of a textbook for this course. You may benefit from referencing Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, or Jeff Erickson's notes.
There will be a homework assignment every week.

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
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.