MATH 381 - Methods of Discrete Mathematics

(3 units)

Quantifiers and logical operators; sets, functions, binary relations, digraphs, and trees; inductive definitions, counting techniques, recurrence systems analysis of algorithms, searching and sorting algorithms.

Prerequisite(s): MATH 182 with a “C” or better.

Grading Basis: Graded
Units of Lecture: 3
Student Learning Outcomes
Upon completion of this course, students will be able to:
1. manipulate the concepts from set theory of unions, intersections and complements.
2. use mathematical induction to construct proofs.
3. demonstrate an understanding of the techniques of counting applied to permutations, combinations.
4. use graph theory to work with lattices and Boolean algebras.

Click here for course scheduling information. | Check course textbook information