Introduction to analytic and formal methods of computer science with practical examples, including analysis or data structures, recursion relations, proof methods, and logic programming. Credit not given for more than one of CS 064, MATH 052 or MATH 054. Prerequisites: CS 020 or CS 021 or CS 110; MATH 021 or MATH 023.
Prereqs enforced by the system: CS 020 or 021 or 110 and MATH 021 or 023; Open to Degree and CDE students
Discrete Structures covers the fundamental mathematical tools that Computer Science students will need for upper level classes. We will focus on logic and proofs, sets and functions, primes and divisibility and advanced proof techniques. Students will learn to understand logical reasoning, construct well formed proofs, define one-to-one and onto functions, prove that sets are countable and work with prime numbers.
The textbook we will be using is an interactive online textbook called Discrete Math, available through zyBooks.com. This requires a purchase of online access to the book for the semester.
Class participation, online and written homework, tests and a group presentation will be used for evaluation.
Lafayette Hall L311 (View Campus Map)
to on Tuesday and Thursday
Note: These dates may change before registration begins.
Note: These dates may not be accurate for select courses during the Summer Session.
|Last Day to Add|
|Last Day to Drop|
|Last Day to Withdraw with 50% Refund|
|Last Day to Withdraw with 25% Refund|
|Last Day to Withdraw|
There are no courses that meet this criteria.