-
Institution:
-
Cardinal Stritch University - Closed
-
Subject:
-
-
Description:
-
Today's computers, no matter how large, have a finite amount of storage, and, as such, are best described by discrete mathematical structures. Many techniques used in computing have roots in these structures. This course deals with a variety of discrete structures and their uses. Topics include integer operations, sets, partially ordered sets, functions, relations, graphs, Boolean algebra, logic and predicate calculus. Also listed under MT 315. Prerequisite: MT 209 or department approval.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(414) 410-4000
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2026 AcademyOne, Inc.