Discrete Mathematics

by Richard Johnsonbaugh

On This Page

Description

For a one- or two-term introductory course in discrete mathematics.   Focused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh's algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization.

Tags

Recommendations

Member Reviews

2 reviews
Why is this book so tall? Good grief, it's like a notebook. I guess it's easier to fit into one's backpack though.

Introduces all the basic concepts of the "science" of computer science. Logic, probability, relations, graphs, algorithm efficiency, it's all here. There's even a little bit of combinatorial math, which I've lately come to love.

And yes, of course, our favorite: the pigeonhole principle. I swear, computer science textbooks make such a big deal about it, that for weeks after I first "learned" it, I thought I had to be missing something. Surely, such an OBVIOUS statement isn't something that they need to TEACH people? They must mean something else. Nope. That's it. Oh well.
½
This book is intended for a one- or two- term introductory course in discrete mathematics

Members

Recently Added By

Author Information

Picture of author.
13 Works 345 Members

Classifications

Genre
Nonfiction
DDC/MDS
510Natural sciences & mathematicsMathematicsMathematics / Graphs
LCC
QA39.2 .J65ScienceMathematicsMathematicsGeneral
BISAC

Statistics

Members
184
Popularity
174,486
Reviews
2
Rating
½ (3.31)
Languages
Chinese, English, Spanish
Media
Paper, Ebook
ISBNs
29