MA 215
Discrete and Combinatorial Algebra I

Credits/When Offered: 4R-0L-4C / F

An introduction to enumeration and discrete structures. Elementary mathematical logic. Permutations, combinations, and related concepts. Set theory, relations and functions on finite sets.  Mathematical induction.

MA 315
Discrete and Combinatorial Algebra II

Credits/When Offered: 4R-0L-4C / W

Prerequisites: MA 215.

A continuation of MA 215. More advanced enumeration techniques including recurrence relations, generating functions and the principle of inclusion and exclusion. Boolean functions with application to circuit design. An introduction to group theory and its application to error-correcting codes.

Explain the notation used here.

white_icon.gif (851 bytes)Required Courses
cs_icon.gif (891 bytes)Computer Science
rhit_icon.gif (977 bytes)Rose-Hulman

09-Feb-1999 20:02:16