Discrete Mathematics for Eng and OR

Catalog Search > Science & Mathematics > 92.580

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

Course No: 92.580; Last Offered: No Data;

Course Description

Topics: Basic Principles of Counting, Burnside's Lemma, Growth of Functions, Big-O, Big-Theta, Big-Omega notation, The Notion of Algorithm, Pseudocode, Graphs, Trees, Forests, Networks, Algorithms for Graphs and Networks, Graph Minors, Combinatorial Optimization, Software Implementations of Graphs, Software for Graph Theory and its Applications. Pre-requisites: 92.321 Discrete I or 91.102 Computing II

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.