-
Institution:
-
Carroll College
-
Subject:
-
-
Description:
-
A look at some actual applications of discrete mathematics that emphasize such unifying themes as mathematical reasoning, alagorithmic thinking, modeling, combinatorial analysis, the kinds of structures used in discrete mathematics, and the use of technology. Possible topics include cryptography, primes and factoring, computer passwords, networking problems, shortest paths, scheduling problems, building circuits, modeling computation, and correctness of algorithms. Three one-hour class periods with a substantial computing component illustrating the technology and the ideas studied. Prerequisite: Grades of "C" of better in MA 131 or MA 121-122. Fall semester.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(406) 447-4300
-
Regional Accreditation:
-
Northwest Commission on Colleges and Universities
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.