CS 250 Discrete Structures I
Introduces discrete structures and techniques for computing. Sets. Graphs and trees. Functions: properties, recursive definitions. Relations: properties, equivalence, partial order. Proof techniques, inductive proof. Counting techniques and discrete probability.
Prerequisite
CS 161 and
Mth 112Z or passing at the necessary level on the mathematics placement test within the last year