(CIS 205) Discrete Mathematics I
Functions, relations, and sets; basic logic; proof techniques basics of counting.
| Credit Hours | 3.0 Lecture |
|---|---|
| Prerequisite | CIS 101 |
| Offered | Fall, Winter, Spring |
| Programs | - |
Course Outcomes
1. Given a logical argument, break it down into its basic components and express it in symbolic notation.
2. Complete basic proofs using propositional logic.
3. Recognize and implement a recursive algorithm.
4. Use set theory, combinations, and permutations to solve counting problems. 5. Apply the rules of probability to solve statistical problems.
6. Identify different types of relations, and understand the relationship between sets, relations, and databases.
7. Know the vocabulary associated with graph theory, and apply graph theory to computer related problems.