Ebook Info
- Published: 2001
- Number of pages: 600 pages
- Format: PDF
- File Size: 26.89 MB
- Authors: John A. Dossey
Description
The strong algorithmic emphasis of Discrete Mathematics is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students.Algorithms are presented in English, eliminating the need for knowledge of a particular programming language. Computational and algorithmic exercise sets follow each chapter section and supplementary exercises and computer projects are included in the end-of-chapter material. This Fifth Edition features a new Chapter 3 covering matrix codes, error correcting codes, congruence, Euclidean algorithm and Diophantine equations, and the RSA algorithm.MARKET: Intended for use in a one-semester introductory course in discrete mathematics.
User’s Reviews
Reviews from Amazon users which were colected at the time this book was published on the website:
⭐Great deals
⭐The discrete math course at our university is a sort of “rite of passage” for math majors- it introduces students to the idea of proofs, as well as basic set and graph theory and combinatorics. It is an introduction to the abstract aspect of mathematics. This book serves this purpose well, with a number of examples and drawings to illustrate concepts. However, this book explained induction in a manner that confused me. Also, our department wasn’t too fond of this book- they switched to another after one semester. Still, I don’t think it’s too bad- unless the current book that the department uses is that much better.
⭐I used this book for a sophomore level Discrete Math class in the CS program at Park university. It was pretty difficult to understand for everybody in the class including myself and I’ve had math through Calc III. It was apparently not written for that level student.
⭐While this book by Dossey may serve as a self-teaching book for surveying topics in discrete mathematics, it is not thorough enough even for an introductory course, thus inadequate for a textbook. FYI, I am currently taking a discrete mathematics course using a popular textbook “Discrete mathematics and its applications” by Rosen.The most basic foundation of discrete mathematics is logic and proof. This part is found in the very first chapter of Rosen book. On the contrary, Dossey book covers that part in the appendix! While one may read the appendix first, doing so is still not helpful because all the proof in this book are not based on the arguments in the appendix. Also, the appendix does not cover quantifier at all. As a result, one cannot build a concrete foundation, and without it, your understanding of discrete mathematics will not go far.I do not like all aspects of Rosen book (there are some issues, as can be seen from its review), nor I like books with high level of mathematical sophistication, but I am glad that my instructor did not choose this Dossey book as a textbook.Also, its price is too high for its relatively slim volume.
Keywords
Free Download Discrete Mathematics (4th Edition) 4th Edition in PDF format
Discrete Mathematics (4th Edition) 4th Edition PDF Free Download
Download Discrete Mathematics (4th Edition) 4th Edition 2001 PDF Free
Discrete Mathematics (4th Edition) 4th Edition 2001 PDF Free Download
Download Discrete Mathematics (4th Edition) 4th Edition PDF
Free Download Ebook Discrete Mathematics (4th Edition) 4th Edition