Discrete mathematics / Richard Johnsonbaugh.

Contents;

LOGIC AND PROOFS
Prepositions
Conditional prepositions and logical equivalence
Quantifiers
E.tc

THE LANGUAGE OF MATHEMATICS
Sets
Sequences and strings
Number systems
Relations
E.tc

ALGORITHMS
Introduction
Notation for algorithms
The Euclidean algorithm
E.tc

COUNTING METHODS AND THE PIGEONHOLE PRINCIPLE
Basic principles
Permutations and combinations
Algorithms for generating permutations and combinations
E.tc

RECURRENCE RELATIONS
Introduction
Solving recurrence relations
Applications to the analysis of algorithms

GRAPH THEORY
Introduction
Paths and cycles
Hamiltonian cycles and the travelling salesperson problem
Etc.

TREES
Introduction
Terminology and characterizations of trees
Spanning trees
Minimal spanning trees
E.tc

NETWORK MODELS
Introduction
A maximal flow algorithm
The max flow, min cut theorem
Etc.

BOOLEAN ALGEBRAS AND COMBINATORIAL CIRCUITS
Combinatorial circuits
Properties of combinatorial circuit
Boolean Algebras
E.tc

AUTOMATA, GRAMMARS, AND LANGUAGES
Sequential circuits and finite state machines
Finite state automata
E.tc

COMPUTATIONAL GEOMETRY
The closet pair problem
A lower bound for the closest pair problem
E.tc

MATRICES
ALGEBRA REVIEW

Includes bibliographical references and index.