CS 301 - Discrete Structure for Computer Science

(3 S.H.)

Provides students with an introduction to applications of discrete mathematical structures to computer science. Topics include logic and proofs, set theory, relations, functions, complexity of algorithms, recursive definitions, recurrence relations, graphs, trees, counting methods, and discrete probability. Prerequisites: CS 234 - Algorithms and Problem-Solving I and MATH 140 - Applied Calculus or MATH 212 - Calculus I. Grade or P/NC.

Course Registration