MATH 353 - Discrete Mathematics

Institution:

Lee University

Subject:

Mathematics

Description:

An introductory course in discrete mathematics stressing problem solving techniques using an algorithm approach. Connections with computer science will be analyzed. The course will include hash functions, algorithms, recursive algorithms, and analysis of these algorithms. Decision trees, Petri nets, graph theory, and Boolean algebra concepts will also be included. The course is required for students minoring in Computer Science.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.leeuniversity.edu

Phone Number:

(423) 614-8000

Regional Accreditation:

Southern 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.