
Discrete Mathematics
Pearson (Publisher)
4th Edition
Published on 21. May 1999
Book
Hardback
690 pages
978-0-13-096141-9 (ISBN)
Article exhausted; check for reprint
Description
The distinguishing characteristic of Ross and Wright is a sound mathematical treatment that increases smoothly in sophistication. The book presents utility-grade discrete math tools so students can understand them, use them, and move on to more advanced mathematical topics. *NEW-An introductory section giving gentle, motivated warm-up questions that point out the importance of precision, examples, and abstraction as problem-solving tools. *NEW-Dependence on previous mathematical background and sophistication is reduced to give students with rusty skills a better chance at understanding the new ideas in discrete mathematics. *NEW-The chapter on elementary logic is extensively revised to place even more emphasis on logical thinking. *NEW-A revised presentation makes algorithms easier to translate into object-oriented programs. *NEW-Some long sections have been broken up. In particular, the account of Boolean algebras is substantially reworked to keep the abstract outline clear and to lead naturally to applications. *NEW-The section on big-oh notation is now in the chapter on induction where it is also closer to the algorithmic applications.
*NEW-Chapters devoted to probability and algebraic structures have been eliminated, though the chapter on counting includes two sections on elementary probability. *The section on big-oh notation is now in the chapter on induction where it is also closer to the algorithmic applications *Chapters devoted to probability and algebraic structures have been eliminated, though the chapter on counting includes two sections on elementary probability *Proofs of all important results are given in the body of the text presentation itself, not as exercises, so serious students can study the proofs or keep the book as a reference *Hundreds of examples illustrate new ideas, tie abstract concepts to concrete settings, and build up to moderately complex uses of new methods
*NEW-Chapters devoted to probability and algebraic structures have been eliminated, though the chapter on counting includes two sections on elementary probability. *The section on big-oh notation is now in the chapter on induction where it is also closer to the algorithmic applications *Chapters devoted to probability and algebraic structures have been eliminated, though the chapter on counting includes two sections on elementary probability *Proofs of all important results are given in the body of the text presentation itself, not as exercises, so serious students can study the proofs or keep the book as a reference *Hundreds of examples illustrate new ideas, tie abstract concepts to concrete settings, and build up to moderately complex uses of new methods
More details
Edition
4th edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 243 mm
Width: 183 mm
Thickness: 30 mm
Weight
1158 gr
ISBN-13
978-0-13-096141-9 (9780130961419)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions

Kenneth Ross | Charles Wright
Discrete Mathematics
Book
09/2002
5th Edition
Pearson
€108.93
Shipment within 15-20 days
Previous edition
Kenneth Allen Ross | Charles R.B. Wright
Discrete Mathematics
Book
05/1992
3rd Edition
Prentice-Hall
€33.37
Article exhausted; check for reprint
Content
1. Sets, Sequences and Functions 2. Elementary Logic 3. Relations 4. Induction and Recursion 5. Counting 6. Introduction to Graphs and Trees 7. Recursion, Trees and Algorithms 8. Digraphs 9. Boolean Algebra 10. More Relations 11. Predicate Calculus and Infinite Sets