Preface. Propositions. Conditional Propositions and Logical Equivalence. Quantifiers. Proofs. Resolution Proofs. Mathematical Induction. Strong Form of Induction and well ordering Property.
2. The Language of Mathematics Sets. Functions. Sequences and Strings. Relations.
Relations. Equivalence Relations. Matrices of Relations. Relational Databases.
Introduction. Correctness of Algorithms. Analysis of Algorithms. Recursive Algorithms.
Divisors. Representation of Integers and Integer Algorithims. The Euclidean Algorithm. The RSA PublicKey Cryptosystem.
Basic Principles. Permutations and Combinations. Algorithms for Generating Permutations and Combinations. Introduction to Discrete Probability. Discrete Probability Theory. Generalized Permutations and Combinations. Binomial Coefficients and Combinatorial Identities. The Pigeonhole Principle.
Introduction. Solving Recurrence Relations. Applications to the Analysis of Algorithms.
Introduction. Paths and Cycles. Hamiltonian Cycles and the Traveling Salesperson Problem. A ShortestPath Algorithm. Representations of Graphs. Isomorphisms of Graphs. Planar Graphs. Instant Insanity.
Introduction. Terminology and Characterizations of Trees. Spanning Trees. Minimal Spanning Trees. Binary Trees. Tree Traversals. Decision Trees and the Minimum Time for Sorting. Isomorphisms of Trees. Game Trees.
Introduction. A Maximal Flow Algorithm. The Max Flow, Min Cut Theorem. Matching.
Combinatorial Circuits. Properties of Combinatorial Circuits. Boolean Algebras. Boolean Functions and Synthesis of Circuits. Applications
Sequential Circuits and FiniteState Machines. FiniteState Automata. Languages and Grammars. Nondeterministic FiniteState Automata. Relationships Between Languages and Automata.
The ClosestPair Problem. An Algorithm to Compute the Convex Hull.
Matrices. Algebra Review.
