This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has the techniques of proofs woven into the text as a running theme and each chapter has the problem-solving corner. The text provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics.
What people are saying - Write a review
LibraryThing ReviewUser Review - sloDavid - LibraryThing
Why is this book so tall? Good grief, it's like a notebook. I guess it's easier to fit into one's backpack though. Introduces all the basic concepts of the "science" of computer science. Logic ... Read full review
COUNTING METHODS AND RECURRENCE RELATIONS
9 other sections not shown