Reflecting many of the recent advances and trends in this area, this classroom-tested text covers the core topics in discrete structures as outlined by the ACM and explores an assortment of novel applications, including simulations, genetic algorithms, network flows, probabilistic primality tests, public key cryptography, and coding theory. It presents algorithms in pseudo code and offers sample programs via the author's website. The text also includes a wide variety of examples and exercises, with solutions in the appendices. In addition, computer exercises teach students how to write their own programs. A solutions manual is available upon qualifying course adoption.