Covers topics in discrete mathematics with emphasis on computer science applications. Includes algorithms, Master’s theorem, base and number representation, logic, sets and category theory, relations, functions, induction, recursion, Boolean algebra and digital circuits, combinatorics, Pascal's Identity, permutations and combinations, counting, probability, Bayes' Theorem, Statistics, algebraic structures, Binomial theorem, directed and undirected graphs, elementary number theory, discrete probability, proof techniques, induction, pigeonhole principle, sequences, Fibonacci numbers and computational complexity.