Essential Discrete Mathematics for Computer Science 1st Edition Harry Lewis

1 The Pigeonhole Principle

2 Basic Proof Techniques

3 Proof by Mathematical Induction

4 Strong Induction

5 Sets

6 Relations and Functions

7 Countable and Uncountable Sets

8 Structural Induction

9 Propositional Logic

10 Normal Forms

11 Logic and Computers

12 Quantificational Logic

13 Directed Graphs

14 Digraphs and Relations

15 States and Invariants

16 Undirected Graphs

17 Connectivity

18 Coloring

19 Finite Automata

20 Regular Languages

21 Order Notation

22 Counting

23 Counting Subsets

24 Series

25 Recurrence Relations

26 Probability

27 Conditional Probability

28 Bayes’ Theorem

29 Random Variables and Expectation

30 Modular Arithmetic

31 Public Key Cryptography