DISCRETE STRUCTURES

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.

Credits

3 credits

Course Code

COMP 2240