Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Discrete structures: an introduction to mathematics for computer science
Norris F., Prentice-Hall, Inc., Upper Saddle River, NJ, 1985. Type: Book (9789780132152600)
Date Reviewed: Feb 1 1986

The study of digital computing and circuitry requires, for its mathematical treatment, tools which are quite different from the traditional calculus and linear algebra and which can be loosely defined as finite structures. The ACM recommended in its 1968 curriculum report [1] the teaching of this topic at the beginning college level. Such courses are now offered at most colleges, and texts have proliferated (one of which is the book under review). The principal difficulty in teaching finite mathematics is that it consists of many different areas, such as Boolean algebra, graph theory, and combinatorics, each of which has its very own set of concepts and definitions not shared with the others. Just introducing these concepts will consume most of the allotted time, giving the students the tools but not enough instruction on how to use them. Given these difficulties, the author does as good a job as can be expected. The book is solidly written with just the right balance between mathematical rigor and readability.

The first three chapters deal with formal logic, set theory, and Boolean algebra, respectively, stressing the essential unity of these three areas. The next chapter, on switching theory, applies the tools just learned. The chapter on functions, which follows, is less well conceived. It starts with some highly technical definitions (“injective,” “surjective,” etc.), then jumps abruptly to Polish notation, and then again to recursion and mathematical induction. The latter concepts are, of course, fundamental to computation, but their significance will be hard to understand from this compressed treatment. The next chapter discusses graph theory with applications. It is followed by chapters on combinatorics and lattices.

The topics in this book cover everything that can reasonably be included in a one-semester course, and probably a good deal more. As stated before, it is well written and contains a generous amount of examples and exercises. If there are weaknesses, then they are primarily due to the problem of dealing with too many diverse areas in such a compressed form.

Reviewer:  F. W. Stallmann Review #: CR109692
1) ACM Education BoardCurriculum ‘68: recommendations for academic programs in computer science, in ACM curricula recommendations for computer science, vol. 1, ACM Education Board (Compilers), ACM, New York, 1983, 1–48.
Bookmark and Share
 
General (G.2.0 )
 
 
Miscellaneous (G.1.m )
 
Would you recommend this review?
yes
no
Other reviews under "General": Date
Discrete mathematics
Ross K., Wright C., Prentice-Hall, Inc., Upper Saddle River, NJ, 1985. Type: Book (9789780132152860)
Mar 1 1986
Applied discrete structures for computer science
Doerr A., Levasseur K., 1985. Type: Book (9789780574217554)
Feb 1 1986
Introduction to discrete structures
Pfleeger S., Straight D., John Wiley & Sons, Inc., New York, NY, 1985. Type: Book (9780471800750)
Oct 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy