# MTH 232 : Discrete Mathematics II

## Transcript title

Discrete Mathematics II

## Credits

4

## Grading mode

Standard letter grades

## Total contact hours

40

## Lecture hours

40

## Prerequisites

## Course Description

A second course in discrete mathematics. Builds on the topics of MTH231 including topics in combinatorics, mathematical proofs, probability, graph theory and number theory. Applications include cryptography and analysis of algorithms.

## Course learning outcomes

1. Model and solve counting problems by applying properties of functions and techniques of combinatorics including problems involving indistinguishable items, repetition, and the principle of inclusion/exclusion.

2. Apply mathematical proof techniques in settings of number theory, graph theory, analysis of algorithms, and probability.

3. Calculate and interpret probabilities by applying principles of discrete probability, techniques of combinatorics and set theory.

4. Analyze graphs and apply techniques for identifying Euler and Hamiltonian paths, shortest paths, chromatic numbers, and isomorphic graphs.

5. Classify the growth of functions and the run-time of algorithms using Big O notation.

6. Apply principles of number theory including divisibility, modular arithmetic, modular congruences, and their applications to cryptography.

## Content outline

- Foundational Topics in Discrete Mathematics
- Proofs (direct, contraposition, contradiction, induction)
- Sets
- Basic Combinatorics

- Advanced Combinatorics
- Permutations with non-distinct objects
- Repetition allowed combinations
- Inclusion/Exclusion
- Applications

- Discrete Probability
- Basics of Discrete Probability
- Methods for Calculating Probability (probability theory)
- Conditional Probability and Bayes Theorem
- Expected Value

- Algorithms
- Number Theory
- Divisibility
- Modular arithmetic
- Primes and GCD’s
- Representations of Integers and related Algorithms
- Modular Congruences
- Applications in Cryptography

- Graph Theory
- Basics of Graph Theory
- Graph Isomorphisms
- Euler Paths
- Hamiltonian Paths
- Shortest Paths
- Planar Graphs
- Graph Coloring

## Required materials

A textbook is required.

## General education/Related instruction lists

- Science not Lab