Dec 14, 2018  
Undergraduate Record 2017-2018 
Undergraduate Record 2017-2018 [ARCHIVED RECORD]

APMA 2102 - 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 2102. Prerequisite: APMA 1110 and CS 1110, or equivalent.

Credits: 3