MAT 321 - Applied Discrete Math

Institution:

Carlow University

Subject:

Mathematics

Description:

A selection of topics from set theory, combinatorics, graph theory, algebra, Boolean algebra, formal logic, and computer science that are both useful and basic to students in applied mathematics, computer science, and engineering. Formal mathematical proofs via induction, combinatorial arguments, truth tables and propositions, Russell's Paradox, principle of inclusion and exclusion, the pigeonhole principle and analysis of algorithms, countably and uncountably infinite sets, generating functions, recurrence relations, and lattices

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

09/01/2010 - 08/31/2010 

Institution Website:

www.carlow.edu

Phone Number:

(412) 578-6000

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.