Discrete mathematical structures
著者
書誌事項
Discrete mathematical structures
Prentice Hall, 1996
3rd ed
大学図書館所蔵 件 / 全6件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Previous eds. published under title: Discrete mathematical structures for computer science
Includes index
内容説明・目次
内容説明
Tying together discrete mathematical topics with a theme, this text stresses both basic theory and applications, offering students a firm foundation for more advanced courses. It limits the mathematics required (no calculus), and explains the small amount of linear algebra that is needed. The book uses algorithms and pseudocode to illustrate techniques, provides coding exercises and features sections on mathematical structures, the predicate calculus, recurrence relations, functions for computer science, growth of functions and minimal spanning trees. A student solutions manual (0-13-515917-2) and instructor's manual (0-13-375064-7) are available.
目次
1. Fundamentals. 2. Logic. 3. Counting. 4. Relations and Digraphs. 5. Functions. 6. Topics in Graph Theory. 7. Order Relations and Structures. 8. Trees. 9. Semigroups and Groups. 10. Languages and Finite-State Machines. 11. Groups and Coding. Appendix A: Algorithms and Pseudocode. Appendix B: Experiments in Discrete Mathematics. Answers to Odd-Numbered Exercises. Index.
「Nielsen BookData」 より