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
"synopsis" may belong to another edition of this title.
Informal but thorough in its coverage, this introduction to discrete mathematics offers a carefully graded treatment of the basics essential to computer science.From the Back Cover:
Presenting conceptual chains in an orderly and gradual fashion, this informal but thorough introduction to discrete mathematics offers a careful treatment of the basics essential for computer science such as relations, induction, counting techniques, logic, and graphs. It also covers the more advanced topics of Boolean algebra and permutation groups, and comes with a wealth of examples to reinforce material and to allow readers to view topics from several perspectives. The book includes new coverage of probability that examines such areas as random variables and distributions and new sections on the Euclidean algorithm and loop invariants, providing a powerful tool for designing algorithms and verifying their correctness.
"About this title" may belong to another edition of this title.
Book Description Prentice Hall, 1987. Paperback,ex-library, with usual stamps and markings, in fair all round condition suitable as a reading copy. pp., 1100grams, ISBN:0132157160. Bookseller Inventory # 1093470
Book Description Prentice Hall, 1987. Paperback. Book Condition: Very Good. Discrete Mathematics This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. . Bookseller Inventory # 7719-0132157160