CS 315: Algorithm Design and Analysis (Spring 2013)


Location:     RMB 323 (Robotics Building)
Time:           TR 9:30 am - 10:45 am
Instructor

Zongming Fei
Office: 227 James F. Hardymon Building, (859)257-3202, fei@cs.uky.edu
Office hours: TR 11:00am - 12:00 noon (or by appointment)

TA: Weihua Liu (weihua.liu AT uky.edu)
TA Office hours: Wed 12:00-1:00pm and Friday 9:50-10:50am
TA Office hours Location: Multilab (2nd floor of EE Annex Building)
Textbook

Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, Algorithms, McGraw-Hill, 2008.
You can find the Errata of the book.

Handouts

  1. Syllabus
  2. Homework 1
  3. Homework 1 Solutions
  4. In-class Quiz
  5. Homework 2
  6. Homework 2 Solutions
  7. In-class Quiz
  8. Homework 3
  9. Homework 3 Solutions
  10. In-class Quiz
  11. Homework 4
  12. Homework 4 Solutions
  13. Homework 5
  14. Homework 5 Solutions
  15. Homework 6
  16. Homework 6 Solutions
  17. Practice Questions
  18. Solutions to Practice Questions

     The programming part should be submitted through https://www.cs.uky.edu/csportal
Links

  1. Thomas H. Cormen Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, , Third Edition, The MIT Press, September 30, 2009.
  2. Tutorial on log (Logarithmic Function) , Geometric Sequence, Arithmetic Sequence, and Summation
  3. Applications of Bellman-Ford algorithms: Scheduling, Concurrency Conversion (slides 32 to 34), and Network flow
  4. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979.
  5. Vijay V. Vazirani, Approximation Algorithms, Springer, 2001.