ICS 141

Discrete Mathematics for Computer Science I

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

Course Student Learning 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.

Credits:3

Lecture Hours:3

Prerequisites: MATH 103 with a grade of "C" or better, placement into MATH 135 or consent of instructor.

Back to the main page. Back to the description page. Back to the curriculum page.