CSC-256 Discrete Structures (3)

This course presents discrete structures as a foundation for computing. Students are familiarized with symbolic logic, as well as fundamental structures such as sets, functions and relations. The course introduces the basics of counting, including counting arguments, the pigeonhole principle, permutations and combinations. Proof techniques are discussed including direct proofs, proofs by contradiction, by cases and by induction as well as topics in graph theory including isomorphisms, cycles, trees, and directed graphs. Finally, algorithmic complexity is introduced. Usually Offered: spring. Prerequisite: CSC-148 and completion of Quantitative Literacy I requirement. Recommendation: CSC-240.