Description: The course covers the theoretical fundamentals of computing, and analysis of the inherent capabilities and limitations of computation. Topics include advanced techniques in formal algorithm analysis, classical and modern algorithms, P and NP, polynomial-time reduction, NP-completeness and NP-hardness. Please contact Your Favorite Professor for help with CST-520: Design and Analysis of Algorithms or any other assignment. Email: professorrobertphd@gmail.com