|
Mar 15, 2025
|
|
|
|
Undergraduate Record 2005-2006 [ARCHIVED RECORD]
|
APMA 202 - Discrete Mathematics I Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include sets (finite and infinite, such as sets of strings over a finite alphabet), elementary combinatorial problems, and finite state automata. Develops tools and mechanisms for reasoning about discrete problems. Cross-listed as CS 202. (S)
Prerequisites & Notes Prerequisite: APMA 111 and CS 101, or equivalent.
Credits: 3
|
|