Discrete Mathematics II. (3-0) 3 Credit Hours

Catalog description

Prerequisite: MAT 1313 , or CS 2233 , or instructor consent. Topics may include: (1) Basic counting principles: Permutations, combinations, binomial coefficients, and arrangements with repetitions. (2) The Inclusion-Exclusion principle. (3) Graph models: Isomorphisms, edge counting, and planar graphs. (4) Covering circuits and graph coloring: Euler circuits, Hamilton circuits, graph coloring, and Ramsey's theorem. (5) Network algorithms: Shortest path, minimum spanning trees, matching algorithms, and transportation problems. (6) Order relations: Partially ordered sets, totally ordered sets, extreme elements (maximum, minimum, maximal, and minimal elements), well-ordered sets, and maximality principles. This course has Differential Tuition. Course Fee: GS01 $90.