COMP 2240 · DISCRETE STRUCTURES

LEC. 3. Pr. (COMP 1210 or COMP 1213 or COMP 1217) and (MATH 1610 or MATH 1617). Characterization of computer science data structures and algorithms in terms of sets and relations, functions, recurrence relations. Use of propositional and predicate calculus to describe algorithms. Proving correctness and running time bounds for algorithms by induction and structural induction. Pr. COMP 1210 & MATH 1610, both with a grade of C or higher.

Pr. (COMP 1210 or COMP 1213 or COMP 1217) and (MATH 1610 or MATH 1617). Pr. COMP 1210 & MATH 1610, both with a grade of C or higher.