Class learning objectives

CS 3305 Discrete Mathematics for Computing II

Ability to use Big O in context of algorithmic complexity
Ability to construct and solve recurrence relations
Ability to use the principle of inclusion and exclusion to solve problems
Ability to understand binary relations and their applications
Ability to recognize and use equivalence relations and partial orderings
Ability to use and construct graphs and graph terminology
Ability to apply the graph theory concepts of Euler and Hamilton paths
Ability to identify and use planar graphs and shortest path problems
Ability to use and construct trees and tree terminology
Ability to use and construct binary search trees