Discrete Mathematics

Front Cover
Prentice Hall, 2009 - Mathematics - 766 pages
8 Reviews

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.

From inside the book

What people are saying - Write a review

User ratings

5 stars
3
4 stars
1
3 stars
3
2 stars
0
1 star
1

User Review - Flag as inappropriate

may i know how much does this book costs in the market

User Review - Flag as inappropriate

Excellent book to read. Specially problem solving corner is very entertaining. I enjoyed reading the book.

Contents

Sets and Logic
1
Proofs
66
This section can be omitted without loss of continuity
117
Copyright

17 other sections not shown

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

About the author (2009)

Richard Johnsonbaugh is Professor Emeritus of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago. Prior to his 20-year service at DePaul University, he was a member and sometime chair of the mathematics departments at Morehouse College and Chicago State University. He has a B.A. degree in mathematics from Yale University, M.A. and Ph.D. degrees in mathematics from the University of Oregon, and an M.S. degree in computer science from the University of Illinois, Chicago. His most recent research interests are in pattern recognition, programming languages, algorithms, and discrete mathematics. He is the author or co-author of numerous books and articles in these areas. Several of his books have been translated into various languages. He is a member of the Mathematical Association of America.

Bibliographic information