Analysis of algorithms performance, time and space comlexity. Graph algorithms, vector and matrix algorithms, adversary arguments, optimal algorithms, adversart arguments, optimal algorithms, parallel algorithms, and current research topoics. Intense converage of NP-completeness with emphasis on recognizing NP-complete problems, proving NP-completeness and creating approximation algorithms (CS 5350).

It is anticipated that you should spend on average 3 - 6 hours of work per week beyond the classroom time to be competitive in this class.

Find this course in canvas.

Bibliography and references

[1] Cormen, T. H., Leiserson, C. E,m Rivest, R.L., and Stein, C. (2009). Introduction to Algorithms.Source. Github

Extra material

[1] Harvard Github

[2] Roughgarden Tim, Algorithms Illuminated

[3] Youtube videos

[4] MIT open courseware