Completion of CS 110.
Upon successful completion of this course, students will be able to…
Interpret and explain concepts in propositional logic and first-order predicate logic.
Employ proof-solving techniques including direct proof, proof by contradiction, and mathematical induction.
Interpret and explain concepts in set theory and counting.
Employ combinatorics and discrete probability to solve theoretical and practical problems.
Recognize binary relations, functions, and their properties, including orders of magnitude.
Employ graphs and graph algorithms to solve theoretical and practical problems in graph theory.
Apply the curriculum to improve mathematical abstraction and critical thinking abilities.
Full syllabus is available upon request.
The required text is Mathematical Structures for Computer Science: Discrete Mathematics and Its Applications 7th Edition by Judith Gersting for reading, reference, and homework. The older 6th Edition of the book is acceptable.