Covid-19 Update: Fall courses offered in one of four options.

Algorithms

Catalog Search > Computer Related > COMP.5030

Note: This course is not available for the current semester.

Course No: COMP.5030; Last Offered: No Data;

Course Description

Advanced algorithms and complexity analysis. Dynamic programming; greedy algorithms; amortized analysis; shortest path and network flow graph algorithms; NP-completeness; approximation algorithms; number-theoretic algorithms; string matching; computational geometry. Additional topics may include linear programming, parallel algorithms, fast Fourier transforms, polynomial, integer, and matrix algorithms. Readings may include conference and journal papers from the algorithms literature.Abstract types, lists, trees, graphs, sets; relevant algorithms and their worst and average case analyses; fast transforms; polynomial, integer, and matrix algorithms; NP-completeness.

Prerequisites & Notes

  • Prerequisites: COMP.4040 pre-requisite
  • Special Notes:
  • Credits: 3;

Questions About This Course?

Contact the Advising Center at 978-934-2474 or Continuing_Education@uml.edu

Use the Back button in your browser to go back to search results.