Discrete Mathematics / Edition 4

Discrete Mathematics / Edition 4

3.0 2
by Richard Johnsonbaugh
     
 

ISBN-10: 0135182425

ISBN-13: 9780135182420

Pub. Date: 09/28/1996

Publisher: Prentice Hall Professional Technical Reference

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;…  See more details below

Overview

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.

Product Details

ISBN-13:
9780135182420
Publisher:
Prentice Hall Professional Technical Reference
Publication date:
09/28/1996
Edition description:
Older Edition
Pages:
690
Product dimensions:
8.22(w) x 10.26(h) x 1.22(d)

Table of Contents

1Logic and Proofs1
2The Language of Mathematics63
3Algorithms142
4Counting Methods and the Pigeonhole Principle197
5Recurrence Relations256
6Graph Theory304
7Trees376
8Network Models and Petri Nets455
9Boolean Algebras and Combinatorial Circuits500
10Automata, Grammars, and Languages546
11Computational Geometry593
AppendixMatrices610
References615
Hints and Solutions to Selected Exercises621
Index687

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >

Discrete Mathematics 3 out of 5 based on 0 ratings. 2 reviews.
TheStudent101101 More than 1 year ago
I agree with the others that this book needs to be burned. I have taken Discrete Mathematics one using this textbook and I also tried looking at the authors earlier edition, but it was a worthless attempt. I have to resort to using other resources such as the internet, other text, and individuals who have a firm undersatnding of the subject. The same individuals who are Computer Science or Math majors all agree that this book is trash. The author is probably a very intelligent individual but he does not explain much of anything in great detail. That is something that a novice needs to grasp a full understanding of the concepts. Without concepts the foundation is weak and clarity is non-existent. To whom it may concern choose another text book.
Guest More than 1 year ago
I am a Comp Sci student from WCU in Pa., this is a required reading for a 100 level math course (MAT151 to be exact). I found this book to be extremely informative and helpful, especially chapter 5 on Recurrence Relations. Perhaps the people who didn't do so well were either not ready for the course material or not devoted to their studying. Either way, good or bad, go to the B.N. store and read some of the book before you buy to see if you like it or not.