CS 2800: Discrete Structures

Cross-Listing: Not cross-listed.

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 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.

Offered: Fall and Spring

Prerequisites: One programming course or permission of instructor.

Grade options: Letter or S/U

Credit hours: 3

Recent offerings:

• http://www.cs.cornell.edu/courses/cs2800/2009fa
• http://www.cs.cornell.edu/courses/cs2800/2009sp
• http://www.cs.cornell.edu/courses/cs2800/2008fa
  • Bart Selman