Introduces discrete mathematics concepts in relation to computer science. Applies the use of Boolean algebra, analysis of algorithms such as logic, sets and functions, recursive algorithms, and recurrence relations, combinatronics, graphs, and trees. Assignments in this course require a basic understanding of programming concepts, problem-solving, basic college algebra and trigonometry skills.

Lecture Hours: Lecture 3 hours per week.
Semester(s) Offered: Fall Spring
Prerequisites: Prerequisite: Demonstrate readiness for MTH 161.

Facebook this Page (opens a new window)

Tweet this Page (opens a new window)

Add to Catalog (opens a new window)