Description
MATH 213. DISCRETE MATHEMATICS FOR COMPUTER SCIENCE. A study of the foundations of mathematics with an emphasis on concepts related to theoretical mathematical methods and computer science. Topics include mathematical logic, set theory, algorithms, complexity of algorithms, integers, a variety of proof techniques, combinatorics, relations, graphs and digraphs, and trees. Corequisite: Mathematics 162. Fall semester only, four hours.