[Book Cover]

Discrete Mathematics, 4/e

Kenneth A. Ross, the University of Oregon
Charles R.B. Wright, the University of Oregon

Published January, 1999 by Prentice Hall Engineering/Science/Mathematics

Copyright 1999, 690 pp.
Cloth
ISBN 0-13-096141-8


Sign up for future
mailings
on this subject.

See other books about:
    Discrete Math-Mathematics

    Discrete Mathematics-Computer Science


Summary

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. The new edition responds to changes in typical student preparation and to developments in computer science with numerous revisions prompted by classroom experience.

Features


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. FEATURES
Overall organization remains the same. The first few chapters make a coherent 1-semester core course. The book as a whole contains plenty of material for a year.
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.
Each section's exercises include a complete range of problems with easy examples and applications of methods as well as questions that develop abstract understanding and give practice with proofs.
The account of induction—a whole chapter—still begins with loop invariants, a concept that students find intuitively clear and that is strongly motivated by links to computer science.
The chapter on recursion gives a mathematically clean and comprehensible treatment of one of the central topics that computer science students must understand.



[Help]

© Prentice-Hall, Inc. A Simon & Schuster Company
Comments To webmaster@prenhall.com