CSC 318 - Discrete Mathematics with Computer Applications II (3 cr.)

Using propositional and predicate logic. Proofs, including induction. Recursive definitions. Proving algorithm termination and correctness. Sets. Functions. Relations, including: equivalence relations, partial and linear orders, and closures of relations. Groups, rings, fields, subalgebras and isomorphisms.
Liberal arts
Prerequisite(s): CSC 217.
Semester(s) Offered: Spring