Walsh University Undergraduate Catalog 2012-2013
CS 230-231 Discrete Patterns I and II 3 sem. hrs. each
(See Mathematics 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: CS 230. 230 offered every spring semester; 231 offered every fall semester.
Up one level
Click arrowheads to expand or collapse contents