Discrete Mathematics

Catalog Search > Science & Mathematics > 92.505

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

Course No: 92.505; Last Offered: No Data;

Course Description

Basic counting rules, permutations and combinations, recurrence relations. Asymptotic algorithms analysis, NP-completeness, heuristic algorithms. Linear, integer, and dynamic programming. Coding Theory. Applications.

Prerequisites & Notes

  • Prerequisites:
  • 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.