MTH 232 - Discrete Mathematics II

Credits: 3

A continuation of MTH 231 providing background in discrete mathematics. Emphasis will be placed on the development of mathematical algorithms and their usage in computer science. Topics include: Introduction to divisibility, the integers, and the Euclidean Algorithm; growth rates of functions, big OH notation and an introduction to algorithm analysis including analyzing iterative and recursive algorithms; basics of graph theory including paths, cycles, graph isomorphism, and graph colorings; introduction to greedy algorithms and their use; trees, spanning trees, binary trees and related algorithms; introduction to combinatorial circuits and Boolean algebra, introduction to finite state machines

Pre-Requisites: MTH 231 with grade of 2.0 or better
Repeatable: May not be repeated for credit