1.1 Introduction 1.2 Propositions 1.3 Logical operations 1.4 Truth table 1.5 Conditional Statements 1.6 Translating English sentences 1.7 Logical equivalence

2.1 Sets and Subsets 2.2 Sets Operation 2.3 Functions 2.4 Cardinality of Sets 2.5 Matrices

3.1 Divisibility and Modular Arithmetic 3.2 Integer Representations 3.2.1 Binary 3.2.2 Octal 3.2.3 Hexadecimal 3.3 Primes 3.4 Greatest Common Divisors 3.5 Least Common Multiples

4.1 Basic counting principles 4.2 Complex counting problem 4.3 Permutation without repetition 4.4 Permutation with repetition 4.5 Combination without repetition 4.6 Combination with repetition

5.1 An Introduction to Discrete Probability 5.1.1 Finite Probability, Sample Space and Events 5.1.2 Probabilities of Complements and Unions of Events 5.2 Probability Theory 5.2.1 Assigning Probabilities 5.2.2 Probabilities of Complements and Unions of Events 5.2.3 Conditional Probability 5.2.4 Independence 5.2.5 Bernoulli Trials and the Binomial Distribution 5.2.6 Random Variables 5.3 Expected Value and Variance

6.1 Cartesian Product 6.2 Binary Relations 6.3 Relation on a set 6.4 Properties of Relation 6.5 Representing Relations 6.6 Equivalence Relations 6.7 Partial Orderings

7.1 Graphs and Graph Models 7.2 Graphs Terminology 7.3 Representing Graphs 7.4 Euler path and circuit 7.5 Hamilton path and circuit

8.1 Trees terminology 8.2 Rooted trees 8.3 Tree Properties 8.4 Applications of Trees 8.5 Tree Traversal

9.1 Boolean algebra operations 9.2 Boolean functions 9.3 Representing Boolean Functions 9.3.1 Sum-of-Products 9.3.2 Product-of-Sums 9.4 Logic Gates 9.5 Minimization of circuits 9.5.1 Karnaugh Maps 0.5.2 Don't Care Condition