Typically offered during the fall as a sprint course.

Catalog description:

 
This course introduces discrete structures and proof techniques at a graduate level. Topics covered include sets, inductive reasoning, proof strategies, and relations.

 
Prerequisites:

Graduate standing in Computer Science.

 
Objectives:

 
A graduate degree in computer science requires excellent command of logic, reasoning, and proof techniques. This course is designed to very rapidly get students up to speed on proof techniques and discrete structures. The use of the sprint schedule will allow students to take CSA 609 as a co-requisite (with the approval of the graduate director), simplifying scheduling issues.

Topics Covered:

Logic, Predicates and Quantifiers
Methods of proof, Sets
Functions, Proof strategy
Sequences and Sums
Mathematical Induction
Recursive Functions and Induction
Relations: Properties, Applications, Representations
Relations: Closures, Partial Orders