Discrete Mathematics deals with countable things, unlike calculus, which deals with infinitesimals. Digital computers are inherently discrete, so discrete maths has application in data structures, parsing, even cryptography. We start our study with logic and proof strategy. The ability to construct and evaluate other's attempts to prove the correctness of claims is a skill used in everyday life. We also review methods for computing the number of combinations and permutations, as well as the output and run-time of various programming constructs. We also touch on graph theory, used in solving network problems.