Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Concise computer mathematics : tutorials on theory and problems
Bagdasar O., Springer Publishing Company, Incorporated, New York, NY, 2013. 118 pp. Type: Book (978-3-319017-50-1)
Date Reviewed: Apr 14 2014

Jon von Neumann once said, “In mathematics you don’t understand things. You just get used to them.” Reviewing definitions and procedures and working out solutions to problems are two ways to achieve understanding by getting used to mathematical things. Concise computer mathematics provides an excellent vehicle for participating in these two tasks and for moving toward understanding. Since it stresses brevity over detail and breadth over depth, the book is ideally suited as an adjunct to a course in computer mathematics or as a refresher for someone with some background in computer mathematics.

The book is divided into 12 short, crisply written chapters. Each opens with an abstract, a set of keywords, and a brief treatment of the theoretical background of the subject. Each chapter concludes with a collection of problems or questions to solidify mastery or to provoke thought. The topics covered are sets, relations and functions, logic, proofs and arguments, vectors, matrices, graph theory, number theory, calculus, and numerical methods. The chapter on sets and numbers illustrates the power and limitations of the book. The opening abstract, which functions as a quick overview of the chapter, starts with a brief definition of sets and then quickly mentions the usefulness of sets in problem solving. The four keywords are each also titles of sections, and thus they serve as chapter guides. Keeping the number of keywords to single digits helps focus on what is essential and avoids cluttering details. In four subsequent pages, the book sets out definitions of terms and operations and provides the rationale for the basic number sets. Given the space limitation and the philosophy of the book, the chapter is a set of notes on sets, but those notes are essential and can be amplified by an instructor or a motivated reader. The chapter concludes with problems and their solutions, but the solutions, as is typical of the book, do not include narrative explanations.

The book fulfills its purpose of providing a distilled treatment of the mathematics most commonly used in computer science. It is of most value to computer science students who need a place to find a succinct treatment of the topics covered.

Reviewer:  Marlin Thomas Review #: CR142168 (1407-0511)
Bookmark and Share
  Featured Reviewer  
Would you recommend this review?
yes
no
Other reviews under "General": Date
Rigid body dynamics algorithms
Featherstone R., Springer-Verlag New York, Inc., Secaucus, NJ, 2007.  278, Type: Book (9780387743141)
May 19 2008
Wandering towards a goal: how can mindless mathematical laws give rise to aims and intention?
Aguirre A., Foster B., Merali Z., Springer International Publishing, New York, NY, 2018.  254, Type: Book (978-3-319757-25-4)
Jan 24 2020
Computer science: a mathematical introduction
Lew A., Prentice-Hall, Inc., Upper Saddle River, NJ, 1985. Type: Book (9789780131642522)
Jul 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 2004 Reviews.com™
Terms of Use
| Privacy Policy