Elements of Discrete Mathematics II
- Course Number:
- MTH 232
- Transcript Title:
- Elements of Discrete Mathematics II
- Created:
- Nov 19, 2026
- Updated:
- Nov 19, 2026
- Total Credits:
- 4
- Lecture Hours:
- 44
- Lecture / Lab Hours:
- 0
- Lab Hours:
- 0
- Satisfies Cultural Literacy requirement:
- No
- Satisfies General Education requirement:
- No
- Grading Options
- A-F, P/NP, Audit
- Default Grading Options
- A-F
- Repeats available for credit:
- 0
Course Description
Builds on the foundations laid in MTH 231. Includes discrete probability, applications of graph theory, basic number theory, algorithmic efficiency, and proof techniques. Investigates both theoretical and applied aspects using symbolic, graphical, and numerical methods. Prerequisite: MTH 231. Audit available.
Course Outcomes
Upon successful completion of this course, students will be able to:
- Calculate and interpret probabilities in discrete settings.
- Analyze and identify various types of graphs.
- Apply principles of number theory.
- Analyze and classify growth of functions and algorithmic efficiency.
Suggested Outcome Assessment Strategies
The determination of assessment strategies is generally left to the discretion of the instructor. Here are some strategies that you might consider when designing your course: writings (journals, self-reflections, pre-writing exercises, essays), quizzes, tests, midterm and final exams, group projects, presentations (in person, videos, etc), self-assessments, experimentations, lab reports, peer critiques, responses (to texts, podcasts, videos, films, etc), student generated questions, Escape Room, interviews, and/or portfolios.
Suggested department assessment strategies: Quizzes, homework, tests, projects of various types to be done individually or in groups as suits the current instructor.
Course Activities and Design
The determination of teaching strategies used in the delivery of outcomes is generally left to the discretion of the instructor. Here are some strategies that you might consider when designing your course: lecture, small group/forum discussion, flipped classroom, dyads, oral presentation, role play, simulation scenarios, group projects, service learning projects, hands-on lab, peer review/workshops, cooperative learning (jigsaw, fishbowl), inquiry based instruction, differentiated instruction (learning centers), graphic organizers, etc.
Department requirement: At least one project must be included in the final grade.
Course Content
Outcome #1: Calculate and interpret probabilities in discrete settings.
- Discrete Probability
- addition/multiplication rules
- pigeon hole principle
- combinations (with and without repetition)
- Pascal's formula and binomial theorem
- conditional probability and Bayes formula
- independent/dependent events
- expected value
Outcome #2: Analyze and identify various types of graphs.
- basics of graph theory
- graph isomorphisms
- Euler paths
- Hamiltonian paths
- shortest paths
- planar graphs
- graph coloring
Outcome #3: Apply principles of number theory.
- divisibility
- remainder classes
- properties of congruence
- modular arithmetic
- applications to cryptography
Outcome #4: Analyze and classify growth of functions and algorithmic efficiency.
- real valued functions and their graphs
- Big O notation
- exponential and logarithmic functions - graphs and orders
- analysis of algorithmic efficiency
Suggested Texts and Materials
- Discrete Mathematics with Applications, 5th ed. Susan S. Epp (for example)
- Desmos or similar app that students can access in class.
Department Notes
All word problems must be answered using complete sentences and include correct units.