Discrete Structures with Contemporary Applications (Hardback)
  • Discrete Structures with Contemporary Applications (Hardback)

Discrete Structures with Contemporary Applications (Hardback)

Hardback 1002 Pages / Published: 19/01/2011
  • We can order this

Usually dispatched within 1 week

  • This item has been added to your basket

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 structures
With 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 implementation
Although 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.

Publisher: Taylor & Francis Ltd
ISBN: 9781439817681
Number of pages: 1002
Weight: 2268 g
Dimensions: 254 x 178 x 51 mm


"... this textbook is excellent. The author clearly had put a lot of effort in presenting the topics clearly and as engaging as possible. His many years of teaching and mentoring clearly show. The more I read it through the more I like the book, especially how the exercises are so carefully selected and presented. For this reason alone, this book is worth keeping and using. ...
The topics covered should provide enough materials for two or even three semester courses.
I heartily recommend this textbook and have been using it both in preparing teaching materials and in educating myself. ...
The level of difficulty makes this book suitable for undergraduate and beginning graduate students of mathematics and computer science."
-IACR Book Reviews, September 2014

"...this is the most physically readable textbook that I have seen in a long time. The print is clear and large ... The text is readable, there are many examples and in many cases proofs of the theorems are included. A large number of exercises are provided and split into two categories, the traditional math problem and exercises to be performed on a computer. ... The two most important courses in the computer science major are the first programming and discrete math classes. Each establishes a foundation of skills that will be repeatedly used throughout the major field of study and this book is an excellent text for the development of the needed skills in math."
-Charles Ashbacher, MAA Reviews, March 2011

You may also be interested in...

A Combinatorial Introduction to Topology
Added to basket
Matroids: A Geometric Introduction
Added to basket
Discrete Mathematics
Added to basket
Modern Graph Theory
Added to basket
Subdivision Surfaces
Added to basket
Graph Theory As I Have Known It
Added to basket
Introduction to Graph Theory
Added to basket

Please sign in to write a review

Your review has been submitted successfully.