MA 208 - Discrete Mathematics

Institution:

Millikin University

Subject:

Mathematics

Description:

Introduces basic techniques and modes of reasoning of combinatorial problem solving. Introduces rigorous theoretical frameworks within which ideas about computer science can be expressed. Topics include graphs, trees, logic, networks, coding, and combinatorics. Pre-requisite: Mathematics 114 or equivalent or consent of instructor and placement score of at least 3.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.millikin.edu

Phone Number:

(217) 424-6211

Regional Accreditation:

North Central 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.