Develops and analyzes structures of computer science: numbers, sets, relations, functions and trees; . This course includes propositional and predicate logic; , applications of predicate logic: preconditions, postconditions, invariants, guards; inductive proofs; applications to verification of algorithms; introduction to complexity of algorithms. Prerequisite: MATH 229 or MATH 231, and MATH 242 or High School equivalent Transfer: CSU; UC. (Formerly CIS41)