Discrete mathematics is the study of mathematical structures that are discrete, such as integers, graphs, and logic statements. It excludes topics in continuous mathematics, such as real numbers and calculus. It has applications in computer science, such as algorithms, programming languages, and software development. It is a prerequisite for mathematics majors in some universities and is sometimes seen as a preparatory course. The Fulkerson Prize is awarded for outstanding papers in this field.
Carnegie Mellon University
Spring 2021
This advanced course reexamines traditional concepts of discrete mathematics (relations, functions, logic, graphs, algebra, automata) in the context of computation and algorithms, necessitating a strong background in discrete math.
No concepts data
+ 23 more concepts