Graduate Online Academic Catalog

Discrete Mathematics for Eng and OR

Catalog Home > Mathematical Sciences > Course Listings > Discrete Mathematics for Eng and OR

Quick Links

Master's Program
Doctoral Program
Graduate Certificate
Back To All Courses
Printer-Friendly Version
Back to Department
How to Apply

92.580

Course ID: 008452

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

Credits: 3