Discrete mathematics is about precision in reasoning as much as it is about solving problems. Proof techniques like induction, contradiction, and direct reasoning are used to establish results in ...

Combinatorics and discrete mathematics constitute the study of finite or countable structures and the algorithms that govern them. At its heart is enumeration: the art of counting arrangements, ...

SMU Office of Research & Tech Transfer - Have you ever followed a recipe to bake some bread? If you have, congratulations; you have executed an algorithm. The algorithms that follow us around the ...

In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...