Read more

Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.

##### List of contents

Sets and Numbers

Relations and Databases

Functions

Boolean Algebra, Logic and Quantifiers

Normal Forms, Proof and Argument

Vectors and Complex Numbers

Matrices and Applications

Matrix Transformations for Computer Graphics

Elements of Graph Theory

Elements of Number Theory and Cryptography

Elements of Calculus

Elementary Numerical Methods

##### Summary

Adapted from a modular undergraduate course on computational mathematics, *Concise Computer Mathematics* delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.

##### Additional text

From the reviews:

“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 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.” (Marlin Thomas, Computing Reviews, April, 2014)

“Each of the chapters opens with a short summary followed by a set of essential problems and then a set of supplementary problems. … it would be very useful for someone that needs a quick and effective review that includes problems.” (Charles Ashbacher, MAA Reviews, January, 2014)

##### Report

From the reviews:

"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 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." (Marlin Thomas, Computing Reviews, April, 2014)

"Each of the chapters opens with a short summary followed by a set of essential problems and then a set of supplementary problems. ... it would be very useful for someone that needs a quick and effective review that includes problems." (Charles Ashbacher, MAA Reviews, January, 2014)