Overview
Description
Quantifiers and logical operators; sets, functions, binary relations, digraphs, and trees; inductive definitions, counting techniques, recurrence systems analysis of algorithms, searching and sorting algorithms.
Requirements
Prerequisites
- with a “C” or better
MATH 182
Original catalog text
Prerequisites
MATH 182 with a “C” or better.
Units
Lecture3
Learning Outcomes
- manipulate the concepts from set theory of unions, intersections and complements.
- use mathematical induction to construct proofs.
- demonstrate an understanding of the techniques of counting applied to permutations, combinations.
- use graph theory to work with lattices and Boolean algebras.