Walsh University Undergraduate Catalog 2012-2013
MATH 230-231 Discrete Patterns I & II 3 sem. hrs. ea.
(See Computer Science 230-231) Algorithms and Combinatorics. Logic, circuits, Karnaugh maps. Proofs, including quantified statements and mathematical induction. Relations, graphs, trees. Languages and finite-state machines. Prerequisite for 230: MATH 155 or equivalent with permission; Prerequisite for 231: MATH 230. 230 offered every spring; 231 with a grade of "C" or better. Offered every fall.
Up one level
Click arrowheads to expand or collapse contents