ICS 141: Discrete Mathematics for Computer Science I

Credits 3 Lecture Hours 3

This course covers logic, sets, functions, matrices, algorithmic concepts, mathematical reasoning, recursion, counting techniques, and probability theory.


Grade of ā€œCā€ or better in MATH 103 or placement into MATH 135 or higher, or consent of instructor.

Course Outcomes
  • Analyze issues and apply mathematical problem solving skills to plan courses of action in decision-making situations.
  • Solve problems by using basic mathematical formal logic, proofs, recursion, analysis of algorithms, sets, combinatorics, relations, functions, matrices and probability.