May 23, 2019  
2018-2019 College Catalog 
    
2018-2019 College Catalog [ARCHIVED CATALOG]

[Add to Personal Catalog]

MATH 2300 - Discrete Structures

(3)
An introductory course covering the mathematics most used in the analysis of algorithms. Logic and proof covered with some emphasis on proof by induction. Counting, combinatorics, probability, relations, discrete functions, and Boolean algebras with applications to switching circuits covered. Graph theory, machine arithmetic, and finite differencing techniques also introduced. Prerequisite: A grade of “C-” or better in MATH 2200  or MATH 2350 . (3 hrs lec)



[Add to Personal Catalog]