Discrete mathematics
著者
書誌事項
Discrete mathematics
Prentice Hall, c1999
4th ed.
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes index
内容説明・目次
内容説明
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
目次
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
「Nielsen BookData」 より