CS 242 - Discrete Structures for Computer Science

Unit(s): 4

Lecture: 4 hours
This course covers fundamental mathematical concepts blended with their applications in Computer Science. Topics include: sets, functions and relations, Boolean algebra, normal forms., Karnaugh map and other minimization techniques, predicate logic, formal and informal proof techniques, relational algebra, basic counting techniques, recurrence relations, and an introduction to graph theory.

Prerequisite(s): Grade of C- or better in CS 115 and MATH 161, or consent of instructor.
Typically Offered Fall & Spring
Grading: Graded