CS 281: Discrete Structures

Course Description

This course focuses on discrete mathematical structures that are essential to computer scientists. In this course, students will develop their analytical and algorithmic thinking skills through practice with propositional and first-order predicate logic, various proof techniques, mathematical and structural induction, sets, functions, sequences, recurrence relations, algorithm analysis and computational complexity, the basics of counting, and in introduction to discrete probability. Prerequisites: Grade of C or better in COMP SCI 171 or 262 and MATH 171 or 206. Special course fees may apply.