<!doctype html public "-//w3c//dtd html 4.0 transitional//en">
MAT 203 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
CATALOGUE DESCRIPTION:
The emphasis will be on algorithmic problem
solving and discrete mathematical concepts including logic, sets, Boolean
algebra, relations, functions, induction and recursion, counting principles and
combinatorics, graphs, and trees. Use of the computer
as a problem solving
tool will be integrated with theory. Fundamental algorithms including sorting, searching, and tree traversal will be introduced.
Prerequisite: MAT 113 or equivalent. 4 hours a week, 1 semester, 4 credits.
TEXT: Susanna Epp, Discrete Mathematics with Applications, Third Edition, Cengage Learning, Belmont, CA, 2004.
Website: http://condor.depaul.edu/~sepp/DMappletsEtc.htm