COVID-19 Update
The health and safety of our community is of the utmost importance to us at UMass Boston. We are closely monitoring the evolving COVID-19 (Coronavirus) situation. Due to concerns, UMass Boston is currently operating online only. Many answers about the campus's response to the coronavirus can be found in our special coronavirus web section.

In addition please subscribe to our classmembers list for continued updates on courses and more. If you have any inquiries please contact us at csinfo@umb.edu.

Click here for a message from the CS Chair, Marc Pomplun as of March 20, 2020.

HomeAcademicsCourses → CS624

Analysis of Algorithms (3 credits)

Basic techniques for designing algorithms: divide and conquer, the greedy method, dynamic programming, etc. Applications to searching and sorting algorithms. Complexity of parsing. The fast Fourier transform and its applications (evaluation of polynomials and arithmetical problems). Lower bound theory. NP-hard and NP-complete problems. Probabilistic estimates of algorithms.

Pre-requisites

CS220/CS320L/MATH320L or permission of the instructor.


This page was last modified on September 21, 2018
© 2018 University of Massachusetts Boston

Template by OS Templates