CS 2802 - Discrete Structures - Honors

(MQR-AS, SMR-AS)

Fall. 3 credits. Student option grading.

J. Halpern.

Covers the mathematics that underlies most of computer science. Topics include mathematical induction; logical proof; propositional and predicate calculus; combinatorics and discrete mathematics; some basic elements of basic probability theory; basic number theory; sets, functions, and relations; graphs; and finite-state machines. These topics are discussed in the context of applications to many areas of computer science, such as the RSA cryptosystem and web searching. This course is an honors version of CS 2800. It will cover essentially the same material, but go into more depth.