Discrete structures with contemporary applications

Reflecting many of the recent advances and trends in this area, Discrete Structures with Contemporary Applications covers the core topics in discrete structures as well as an assortment of novel applications-oriented topics.

The applications described include simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory. A modern and comprehensive introduction to discrete structuresWith clear definitions and theorems and carefully explained proofs, this classroom-tested text presents an accessible yet rigorous treatment of the material.

Numerous worked-out examples illustrate key points while figures and tables help students grasp the more subtle and difficult concepts. "Exercises for the Reader" are interspersed throughout the text, with complete solutions included in an appendix.

In addition to these, each section ends with extensive, carefully crafted exercise sets ranging from routine to nontrivial; answers can be found in another appendix.

Most sections also contain computer exercises that guide students through the process of writing their own programs on any computing platform. Accommodates various levels of computer implementationAlthough the book highly encourages the use of computing platforms, it can be used without computers.

The author explains algorithms in ordinary English and, when appropriate, in a natural and easy-to-understand pseudo code that can be readily translated into any computer language.

A supporting website provides an extensive set of sample programs.