|Logistics:|| Lecture: Mon/Wed 2:00 - 3:30, GDC 1.304
Discussion section: Fri 10:00 - 11:00 ECJ 1.308, 11:00 - 12:00 GAR 2.112
Course web page: http://www.cs.utexas.edu/~ecprice/courses/331/sp22/
Unique number: 51320 / 51325
Office: GDC 4.510
Office Hours: 3:30-4:30pm Monday (over class Zoom while class is on Zoom)
Office Hours: TBA
The class will
Erickson's book. Lecture notes will 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. If you would like
to read ahead, the notes on the 2020
version of the class can be helpful.
|Content:||This undergraduate course will cover the basics of algorithms and complexity, including dynamic programming, greedy algorithms, graph algorithms, linear programming, and NP-hardness.|
|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.|
30%: Two in-class exams
20%: Final exam
|Text:||The course will generally follow Jeff Erickson's book, which is freely available online.|
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.
Late policy: Late submissions without warning are not accepted. Every student may take (with prior notice by email) one day late over the course of the semester. Further flexibility may be available on a case-by-case basis.
|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.|