|
Mar 15, 2025
|
|
|
|
Undergraduate Record 2005-2006 [ARCHIVED RECORD]
|
APMA 302 - Discrete Mathematics II A continuation of APMA 202, consisting of topics in combinatorics, including recurrence relations and generating functions. An introduction to graph theory, including connectivity properties; and Eulerian and Hamiltonian graphs, spanning trees and shortest path problems. Cross-listed as CS 302. (Y)
Prerequisites & Notes Prerequisite: APMA/CS 202 or equivalent.
Credits: 3
|
|