This book presents a selection of topics from set theory, combinatorics, graph theory, and algebra which were been considered as basic and useful to students in Applied Mathematics, Computer Seience, and Engineering.
It's intended to be a textbook for a course in Discrete Mathematics at the sophomore-junior level, although it can also be used in a freshman-level course since the presentation does not assume any background beyond high-school mathematics.
Table of Contents
1. Sets and Propositions
2. Computability and Formal Languages
3. Permutations, Combinations, and Discrete Probability
4. Relations and Functions
5. Graphs and Planar Graphs
6. Trees and Cut-Sets
7. Finite State Machines
8. Analysis of Algorithms
9. Discrete Numberic Functions and Generating Functions
10. Recurrence Relations and Recursive Algorithms
11. Groups and Rings
12. Boolean Algebras