Discrete Mathematics Fourth Edition

Ross, Kenneth A. And Charles R. B. Wright

ISBN 10: 0130961418 / ISBN 13: 9780130961419

Published by Prentice Hall, Upper Saddle River, New Jersey, U.S.A., 1999

About this Item

684 pgs. Scratch-out on flyleaf; Text Clean.

Seller Inventory # 034555

Bibliographic Details

• Title: Discrete Mathematics Fourth Edition
• Publisher: Prentice Hall, Upper Saddle River, New Jersey, U.S.A.
• Publication Date: 1999
• Language: English
• ISBN 10: 0130961418
• ISBN 13: 9780130961419
• Binding: Textbook Binding
• Edition: 4th Edition
• Condition: Very Good
• Seller catalogs:
  • Science and Tech

About this title

Synopsis

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

From the Publisher

Informal but thorough in its coverage, this introduction to discrete mathematics offers a carefully graded treatment of the basics essential to computer science.