Discrete Mathematics

by Richard Johnsonbaugh

This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has the techniques of proofs woven into the text as a running theme and each chapter has the problem-solving corner. The text provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics.

Genres: Nonfiction, Mathematics, Reference, Textbooks

621 pages, Hardcover

First published June 7, 1984

About the author

Richard F. Johnsonbaugh is an American mathematician and computer scientist. His interests include discrete mathematics and the history of mathematics. He is the author of several textbooks.
Johnsonbaugh earned a bachelor's degree in mathematics from Yale University, and then moved to the University of Oregon for graduate study. He completed his Ph.D. at Oregon in 1969. His dissertation, I. Classical Fundamental Groups and Covering Space Theory in the Setting of Cartan and Chevalley; II. Spaces and Algebras of Vector-Valued Differentiable Functions, was supervised by Bertram Yood. He also has a second master's degree in computer science from the University of Illinois at Chicago.
He is currently professor emeritus at De Paul University.

Reviews

[Effy Feng]

...

[Eric · Rating 1 out of 5]

Oh, lordy, make it stop! This book makes such interesting material completely inaccessible to those who are trying to study the subject. Maybe next time I'll try Discrete Maths for Dummies.

[Sarah sa · Rating 5 out of 5]

I love this book

[Max Angeluz]

hmmmm.. i dont know

[Mirza Tajik · Rating 3 out of 5]

I want to read this book .....