cs 2223 - mathematical structures for computer science 3 f, sp

introduction to logic, propositional equivalences, predicates and quantifiers, methods of proof, mathematical induction, recursive definition and algorithms, program correctness, representing relations, closures of relations, equivalence relations, partial orderings, boolean matrices, invertible matrices, systems of linear equations, permutations and combinations, sequences and recurrence relations, graph terminology and representation, connectivity, euler and hamiltonian paths, shortest path algorithms, introduction and applications of trees, tree traversal algorithms, spanning trees, minimum spanning trees. the course also incorporates a significant programming component.

prerequisite: ma 1314 with a grade of “c” or higher.