Discrete Mathematical Structures
Pearson (Publisher)
3rd Edition
Published on 1. February 1996
Book
Hardback
524 pages
978-0-13-320912-9 (ISBN)
Article exhausted; check for reprint
Description
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.
More details
Edition
3rd edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 240 mm
Width: 193 mm
Thickness: 24 mm
Weight
996 gr
ISBN-13
978-0-13-320912-9 (9780133209129)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Bernard Kolman | Robert C. Busby | Sharon Cutler Ross
Discrete Mathematical Structures
United States Edition
Book
12/1999
4th Edition
Pearson
€89.12
Article exhausted; check for reprint
Content
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.