CSCI 2310 - Discrete Mathematics for Computer Science
Student Learning Outcomes
Use the concept of sets and functions to reason about application domain problems.
Apply counting principles to determine the number of various combinatorial problems.
Use logic to specify precise meaning of statements, demonstrate the equivalence of statements, and test the validity of arguments.
Use summations, formulas for the sum of arithmetic and geometric sequences.
Construct and recognize valid proofs using different techniques including the principle of mathematical induction.
Course Description Discrete mathematics required for Computer Science, including topics such as the basics of logic, number theory, method of proof, sequences, mathematical induction, set theory, counting and functions. Credits: 4