Discrete Structures: 3 semester hours

Catalog description

A bridge course between data structures/discrete mathematics and analysis of algorithms, to include reviews of functions and relations, basic combinatorics (set operations, counting, combinations, and permutations) and introductions to prepositional and predicate logic, discrete probability theory, recursive definitions, computational complexity, and proof techniques including mathematical induction. The concepts are illustrated by applications involving graphs, trees, networks and related algorithms. Prerequisites: (COMP 1422 or COMP 1224) or ((COMP 1221 or COMP 1122 ) and ( COMP 1337 or COMP 1223)).