Discrete Mathematics with Combinatorics

by James Andrew Anderson

For one-/two- semester, freshman courses in Discrete Mathematics. This carefully organized, very readable text covers every essential topic in discrete mathematics in a logical fashion. Placing each topic in context, it covers concepts associated with discrete mathematical systems that have applications in computer science, engineering, and mathematics. The author introduces more basic concepts at the freshman level than are found in other texts, in a simple, accessible form. Introductory material is balanced with extensive coverage of graphs, trees, recursion, algebra, theory of computing, and combinatorics. Extensive examples throughout the text reinforce concepts.

Genres: Mathematics

9 pages, Hardcover

First published July 20, 2000

Reviews

[Dianna · Rating 1 out of 5]

Like the other reviewer notes, there are numerous mistakes in both the text as well as the solutions of this title. I imagine that's why there hasn't been any newer editions - unfortunately, it was still assigned to my Discrete Math class.

Many of my classmates (as well as our professor) supplemented their learning with Rosen's Discrete Mathematics and its Applications (available, perhaps illegally, free on PDF online). I wish I had learned about that earlier in the semester.

[Michael · Rating 1 out of 5]

This book is full of errors, both in the text and in the provided solutions for problems. I've had good and bad math texts through the years and this one is perhaps the worst. Had I not tried to forget how bad it was years ago, I could provide specific examples of bad examples and poor explanations.

[Imrankamfa]

Logic