An introductory course in discrete mathematics stressing problem solving techniques using an algorithmic approach. This course will include recursion, counting principles, probability and algorithmic processes. Graphs, trees, networks, and problems effectively modeled with these constructs will also be studied.
Prerequisites MTHS-261 with a minimum grade of C-.
