This course is a continuation of Discrete Mathematics I. Topics include: recursion, induction, regular expressions and finite state automata, efficiency of algorithms, graph theory, introduction to number theory and counting. Lect: 3 hrs./Lab: 1 hr. Prerequisite: MTH 110 Course Weight: 1.00 Billing Units: 1
