Discrete Mathematics
Discrete Mathematics
CAD$78.95
This book is designed to form the basis of a one-year course in discrete mathematics for first-year computer scientists or software engineers. The materials presented cover much of undergraduate algebra with a particular bias toward the computing applications. Topics covered include mathematical logic, set theory, finite and infinite relations and mapping, graphs, graphical algorithms and axiom systems. It concludes with implementations of many of the algorithms in Modula-2 to illustrate how the mathematics may be turned into concrete calculations. Numerous examples and exercises are included with selected solutions to the problems appearing in the appendix.
- Concise and witty introduction to mathematics for computer science
- Taught in all computer science departments
- Though written by a mathematician, emphasises software engineering
- Compare with Cooke and Bez, published in 1984, now dying but has sold 4000 in pb in HEO (split: 2150, 350, 1500)
Reviews & endorsements
"A useful refresher for those who wish to refamiliarize themselves with the material." Choice
"...a very good freshman-level discrete math textbook." Mukkai S. Krishnamoorthy, Mathematical Reviews
Product details
June 1991Paperback
9780521386227
332 pages
229 × 152 × 19 mm
0.49kg
Available
Table of Contents
- 1. Introduction
- 2. Logic
- 3. Set theory
- 4. Relations
- 5. Mappings
- 6. Graphs
- 7. Graph algorithms
- 8. Abstract algebra
- Appendices.
