Elements of discrete mathematics of particular importance in computer science: propositional and predicate logic; proof techniques, including mathematical induction; recursive functions, definitions, and algorithms; proofs of program correctness; algebra of sets; relations and functions; and elements of the theory of directed and undirected graphs. Application of these structures to various areas of computer science. Prerequisite: CSCI 1311, 1320, or consent of instructor.
3 credits
Lower Division
Pathways Curriculum
Approaches to Creation and Analysis