ICS 141 - Discrete Mathematics for Computer Science I
Course Description
- Prerequisite: MATH 135
- Prerequisite or Corequisite: ICS 111
- Recommended Prep: MATH 205
Includes logic, sets, functions, matrices, algorithmic concepts, mathematical reasoning, recursion, counting techniques, probability theory.
Student Learning Outcomes
Upon successful completion of ICS 141, the student will be able to:
- Solve problems in prepositional logic.
- Work with truth tables.
- Use Venn diagrams.
- Solve problems in elementary set theory.
- Prove mathematical theorems, including proofs using mathematical induction.
- Solve counting problems using basic counting techniques.
- Solve counting problems using the concepts of permutations, combinations, and binomial coefficients.
- Solve simple recurrence relations.
- Work with reflexive, symmetric, transitive, equivalent, and anti-symmetric relations.
- Determine whether or not a relation is a partial order.
- Find the closure of a relation.