Discrete Mathematics in Computer Science

By Donald F. Stanat and David F. McAllister

Book Overview

No Synopsis Available.

• Format: Hardcover
• Language: English
• ISBN: 0132161508
• ISBN13: 9780132161503
• Release Date: January 1977
• Publisher: Pearson College Div
• Length: 850 Pages
• Weight: 1.92 lbs.

Customer Reviews

Dated, but still a good introduction to some areas of computer science

In the 1980's, I was teaching mathematics at the college level and we made the decision to offer a course in discrete mathematics for computer science students. While I was trained in mathematics, I did not know the precise meaning of the term in this context. Therefore, I purchased this book and read through it. Shortly after that, I wrote the proposal to add a course in discrete mathematics to our curriculum and it passed all the confirmatory hurdles. Since the definition of what is considered discrete mathematics for computer science students has changed over the years, the coverage here is not consistent with the modern approach. The chapters are: *) Mathematical models *) Mathematical reasoning *) Sets *) Binary relations *) Functions *) Counting and algorithm analysis *) Infinite sets *) Algebras As you can see, there is no graph theory and there is no mention of switching theory and only one page devoted to Boolean algebra. Therefore, while this book was excellent at the time and remains a solid introduction to some areas of discrete mathematics, the field has moved somewhat beyond this coverage.