MATH 220 Discrete Structures

In this course, students will develop skills in fundamental mathematical concepts related to computer science. The course will discuss elements of set theory, relations, functions, propositional logic, permutations, combinations, probability, proof techniques, and elementary graph theory. Selected applications will be included. A TI-83 or TI-84 graphing calculator is required. 

Credits

3

Prerequisite

MATH 181 with a grade of C or higher

Hours Weekly

3

Course Objectives

1. Explain formal logical statements, including quantified statements and analyze logical arguments to identify errors and validate.
2. Explore concepts in number theory and apply those concepts to formal proofs that combine logic with number theory.
3. Represent numerical patterns as mathematical sequences, series, and recurrence relations and apply mathematical induction to prove identities.
4. Perform fundamental operations on sets, functions, and relations, and apply the proof techniques seen in that domain.
5. Solve counting and probability problems using tools such as permutations, combinations, the pigeonhole principle, and the binomial theorem.
6. Identify elementary properties of graph theory.

Course Objectives

1. Explain formal logical statements, including quantified statements and analyze logical arguments to identify errors and validate.
2. Explore concepts in number theory and apply those concepts to formal proofs that combine logic with number theory.
3. Represent numerical patterns as mathematical sequences, series, and recurrence relations and apply mathematical induction to prove identities.
4. Perform fundamental operations on sets, functions, and relations, and apply the proof techniques seen in that domain.
5. Solve counting and probability problems using tools such as permutations, combinations, the pigeonhole principle, and the binomial theorem.
6. Identify elementary properties of graph theory.