CS 2800

Last Updated

  • Schedule of Classes - June 22, 2015 4:42PM EDT
  • Course Catalog - June 11, 2015 6:21PM EDT

CS 2800
Discrete Structures

Course information provided by the Courses of Study 2014-2015.

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.

When Offered Fall, spring.

Prerequisites/Corequisites Prerequisite or corequisite: one programming course or permission of instructor.

Distribution Category (MQR)

View Enrollment Information

Syllabi: none

  •   Regular Academic Session. 

  • 3 Credits Stdnt Opt

  • 11217 CS 2800   LEC 001

  •  
    • MWF Uris Hall G01

    • Chaudhuri, S

      George, M

  • Preference given to CS majors. If class is oversubscribed, non-CS majors will be moved to waitlist.