LAM 320 Discrete Mathematics

This course provides an introduction to the topics and techniques of discrete methods, combinatorial reasoning, and finite algebraic structures. Set theory, logic, and functions provide the unifying themes as finite systems are studied. Topics include sets, counting, recursion, graph theory, trees, nets, Boolean Algebra, automata, and formal grammars and languages. The nature and importance of the algorithmic approach to problem solving is stressed. This course applies toward the mathematics concentration. Prerequisite: At least one 200-level mathematics course or consent of department. 5 quarter hours

Credits

5