Mar 17, 2018  
Undergraduate Record 2006-2007 
Undergraduate Record 2006-2007 [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