- DISCRETE MATHEMATICS AND ITS APPLICATIONS SOLUTIONS MANUALS
- DISCRETE MATHEMATICS AND ITS APPLICATIONS SOLUTIONS PDF
- DISCRETE MATHEMATICS AND ITS APPLICATIONS SOLUTIONS PLUS
I reviewed the text in several electronic forms.
DISCRETE MATHEMATICS AND ITS APPLICATIONS SOLUTIONS MANUALS
There are also two print manuals available, a student’s solutions guide (complete solutions to all odd-numbered problems, rather than the hints given in the back of the book), and an instructor’s resource guide (complete solutions the the even-numbered problems, along with a test bank, instructor tips, and sample syllabi). I did not examine the instructor site, but it contains various pre-made materials for teaching and testing. It also has the excellent applications book (mentioned above) and two essays, one on proof techniques and one on common errors in discrete math. The student site is mostly “more of the same”, with additional examples and exercises that are not any easier or harder than those in the book. There is a student site and an instructor site. The book has a massive amount of ancillary material, mostly online on the companion web site. These applications are also primarily to computer science, but there are others such as a chapter on apportionment and a chapter on voting procedures.
Each chapter is cross-referenced to the sections of the present book that are its prerequisites. Michaels, Applications of Discrete Mathematics.
DISCRETE MATHEMATICS AND ITS APPLICATIONS SOLUTIONS PDF
Very Good Feature: The companion web site has a supplemental 450-page book (in PDF format) edited by Rosen and John G. More specialized techniques are shown throughout the book, such as proof by induction and counting proofs. There are 40 pages early on that discuss all the common proof techniques, with many examples of correct and incorrect proofs. The introduction to proofs aspects of the book are very strong. The book does cover the Master Theorem that gives the asymptotic behavior of a function satisfying a recursion (p. The big-O notation is introduced and the time complexity of a few simple algorithms is analyzed. The last chapter, on finite-state machines and language recognition, is on a subject I would consider pure computer science (compilers) and not mathematics at all.īecause the prerequisites are so low, the book does only a small amount of analysis of the performance of algorithms. The book is slanted heavily towards computer science, especially in the later chapters. Knowledge of calculus is optional, and items requiring it are flagged.
The book is aimed at the sophomore or higher level (Preface, p.
DISCRETE MATHEMATICS AND ITS APPLICATIONS SOLUTIONS PLUS
On the plus side, the book is thorough and comprehensive, there are copious exercises, and the book is well-supported by the publisher with supplemental materials. The promised applications, also numerous, are mostly to computer science rather than to real-world problems.
You don’t come away from this book with the idea that discrete math is an exciting subject. I also thought the examples were weak they are numerous, but most seem boring and contrived. It doesn’t have a good narrative flow, but hops from subject to subject. Overall, however, I wasn’t very happy with this book. This is a very polished and complete text, now in its seventh edition, and probably the dominant text in the field.
0 kommentar(er)
