COM S 280: Discrete Structures

Cross-Listing: Not cross-listed.

Covers mathematical aspects of programming and computing. Topics will be chosen from the following: mathematical induction; logical proof; propositional and predicate calculus; combinatorics and discrete mathematics covering manipulation of sums, recurrence relations, and generating-function techniques; basic number theory; sets, functions, and relations; partially ordered sets; graphs, algebraic structures.

Offered: Fall and Spring

Prerequisites: COM S 100 or permission of instructor.

Grade options: Letter or S/U

Credit hours: 3

Recent offerings:

• http://www.cs.cornell.edu/courses/cs280/2007fa
  • Graeme Bailey
• http://www.cs.cornell.edu/courses/cs280/2007sp
  • Joseph Halpern
• http://www.cs.cornell.edu/courses/cs280/2006fa
  • Uri Keich