| COURSE | TITLE | EFF YEAR | EFF TERM | DEPARTMENT | CREDIT HOURS | ||||
| MA372 | INTRODUCTION TO DISCRETE MATH | 2013 | 1 | Mathematical Sciences | 3.0 (BS=0.0, ET=0.0, MA=3.0) | ||||
| SCOPE | |||||||||
| The purpose of this course is to introduce topics in Discrete Mathematics, providing a foundation for further study and application. The topics covered are useful to both the applied mathematician and the computer scientist. They include propositional logic, elements of set theory, combinatorics, relations, functions, partitions, methods of proof, induction and recursion, digraphs, trees, finite state machines, and algebraic systems. Specific applications to computer science are presented. | |||||||||
|
|||||||||
| SPECIAL REQUIREMENTS: | |||||||||
| None | |||||||||
| TYPE | COURSE | EFF YEAR | EFF TERM | TRACK | RED BOOK FLG |
| PRE REQUISITE | |||||
| MA206 | 1992 | 1 | 1 | Y | |
| MA206X | 2017 | 2 | 2 | Y | |
| MA256 | 2018 | 2 | 3 | Y | |
| AYT | #SECT/SIZE | CPBLTY | ENRLD | WAIT | SEATS | CLOSED | DETAILS | ||
| 2025 - 2 | 4 | 18 | 72 | 64 | 0 | 8 | N | Hours | |
| 2026 - 2 | 4 | 19 | 76 | 6 | 0 | 70 | N | Hours | |
| 2027 - 1 | 0 | 0 | 0 | 0 | 0 | 0 | N | Hours | |
| 2027 - 2 | 5 | 18 | 90 | 3 | 0 | 87 | N | Hours | |
| 2027 - 8 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| 2028 - 1 | 0 | 0 | 0 | 0 | 0 | 0 | N | Hours | |
| 2028 - 2 | 5 | 18 | 90 | 0 | 0 | 90 | N | Hours | |
| 2028 - 8 | 1 | 18 | 18 | 0 | 0 | 18 | N | Hours | |
| COURSE | TITLE | EFF YEAR | EFF TERM | DEPARTMENT | CREDIT HOURS | ||||
| MA372 | INTRODUCTION TO DISCRETE MATH | 1987 | 2 | Mathematical Sciences | 3.0 (BS=0.0, ET=0.0, MA=0.0) | ||||
| SCOPE | |||||||||
| The purpose of this course is to introduce topics in Discrete Mathematics, providing a foundation for further study and application. The topics covered are useful to both the applied mathematician and the computer scientist. They include propositional logic, elements of set theory, combinatorics, relations, functions, partitions, methods of proof, induction and recursion, digraphs, trees, finite state machines, and algebraic systems. Specific applications to computer science are presented. | |||||||||
|
|||||||||
| SPECIAL REQUIREMENTS: | |||||||||
| None | |||||||||
| TYPE | COURSE | EFF YEAR | EFF TERM | TRACK | RED BOOK FLG |
| PRE REQUISITE | |||||
| MA206 | 1992 | 1 | 1 | Y | |