MTH 232 - Discrete Mathematics II

Institution:

Wilkes University

Subject:

Mathematics

Description:

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.

Credits:

3.00

Credit Hours:

Prerequisites:

[[MTH-231]] with grade of 2.0 or better

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.wilkes.edu

Phone Number:

(570) 408-5000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.