Discrete math, as an undergraduate course, is an amalgamation of topics dealing with finite and infinite discrete structures. Often propositional logic and set theory introduces a beginning student to discrete math. Additionally, when learning to read and write mathematics with care, the integers and especially induction and recursion play an important role in discrete math. Algorithms, counting and probability, equivalence and order relations are some of the most important topics to bridge the gap with other more advanced topics such as graph theory, trees, Boolean algebras, and formal languages. Discrete math is a popular course for engineers and especially computer scientists.
CERTAIN CONTENT THAT APPEARS ON THIS SITE COMES FROM AMAZON SERVICES LLC. THIS CONTENT IS PROVIDED ‘AS IS’ AND IS SUBJECT TO CHANGE OR REMOVAL AT ANY TIME.