Apr 23, 2024  
2020-2021 Undergraduate Catalog 
    
Catalog Navigation
  Publication Home
  Archived Catalogs
  About KSU
  Admissions
  Tuition, Expenses, & Financial Aid
  Computing and Information Resources
  Academic Policies
  Student Services & Activities
  Student Rights and Responsibilities
  General Education Core Curriculum Requirements
  Academic Programs
  Courses
  Faculty
  Academy for Inclusive Learning and Social Growth
  My Portfolio
HELP
2020-2021 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CSE 2300:Discrete Structures for Computing

3 Class Hours 0 Laboratory Hours 3 Credit Hours
Prerequisite: ((CSE 1321  and CSE 1321L  with a grade of “B” or higher) or CSE 1311 ) and (MATH 1113  or MATH 1190 )
Coverage of discrete structures is crucial to any program in computing. This course covers propositional and predicate logic, proofs, set theory, relations and functions, algorithms and complexity theory, matrices, graphs and trees, and combinatorics. Throughout, the emphasis will be on applications of these concepts in computing.


Add to Portfolio (opens a new window)