Portland-State-University 2015-2016 Bulletin

CS 250 Discrete Structures I

Introduces discrete structures and techniques for computing. Sets. Graphs and trees. Functions: properties, recursive definitions, solving recurrences. Relations: properties, equivalence, partial order. Proof techniques, inductive proof. Counting techniques and discrete probability. Expected preparation: Mth 251.

Credits

4
  • Up one level
  • 200