CS388G: Algorithms: Techniques & Theory (#50680), Fall 2019

The University of Texas at Austin
Department of Computer Science
August 27, 2019


Time. TTh 2-3:30

Professor. Vijaya Ramachandran 

TA. Kuan-Yi Ho 

Textbook and Course Material. 


 This course will cover advanced topics in algorithm design and analysis including selected topics in algorithmic paradigms, data structures, maximum flow, randomized algorithms, NP-completeness and approximation algorithms. 

This is a graduate diversity course in a theory thread.

All algorithms will be analyzed to obtain provable bounds.  There is no programming component to the course.  

Here are the topics that will be covered in the course.  

Topics in Algorithmic Paradigms:

Divide and conquer, greedy, dynamic programming; graph algorithms.

2 weeks

Data structures:

Amortized analysis, Fibonacci heap; union find, splay tree, hashing.

2-3 weeks 


P and NP; NP-completeness reductions; approximation algorithms

2-3 weeks 

Maximum flow and maximum matching:

Ford-Fulkerson; Edmond-Karp; push-relabel; maximum matching; linear programming

2-3 weeks

Randomized algorithms: 

Tail bounds; universal hashing; randomized graph algorithms and approximation algorithms

2 weeks


Canvas and Piazza. Course material will be posted on Canvas. There will be a discussion forum on Piazza.

Course Grade. The course grade will include plus and minus grades, and will be based on the following: 

Further Information on the Two Tests.  The tests are closed-book, but you are allowed to bring one sheet of personally-prepared notes to the test. The total of 43 points will be  distributed over the two tests as follows. 

Dates for the Tests, Quiz, and Class Presentations.   

Final Quiz. The final quiz will be held during class on Thursday, December 5.

Class Presentations. We will have project presentations during class meetings in the last two weeks of classes. 

Extra time slots on the evenings of November 25 and December 2 may be scheduled if needed to accommodate all talks (see above). 

Grading Queries. Any questions on grading should be brought to the attention of the TA or the instructor no later than a week after the graded material is returned to the class. 

Students with Disabilities. Students with disabilities may request appropriate academic accommodations from the Division of Diversity and Community Engagement, Services for Students with Disabilities, 471-6259, http://www.utexas.edu/diversity/ddce/ssd 

If you require any assistance or accommodations from me, please let me know by September 13. 

Accommodations for Religious Holidays. If you must miss a class or an examination in order to observe a religious holy day, you will be given an opportunity to complete the missed work within a reasonable time before or after the absence, provided proper notification is given. 

If you intend to make use of such accommodations, please let me know by September 13. 

Statement on Scholastic Dishonesty. Anyone who violates the rules for the problem sets or who cheats in the in-class tests or final exam is in danger of receiving an F for the course. Additional penalties may be levied by the Computer Sciences department and the University. See http://www.cs.utexas.edu/academics/conduct/