Discrete mathematics

Front Cover
Macmillan Publishing Company, 1990 - Mathematics - 705 pages
2 Reviews
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.

From inside the book

What people are saying - Write a review

LibraryThing Review

User Review  - sloDavid - LibraryThing

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 ... Read full review

Review: Discrete Mathematics

User Review  - Eric Sundquist - Goodreads

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. Read full review

Contents

Logic and Proofs
1
The Language of Mathematics
59
Algorithms
119
Copyright

10 other sections not shown

Common terms and phrases

References to this book

All Book Search results »

About the author (1990)

Richard Johnsonbaugh" is Professor Emeritus of Computer Science at DePaul University. He has degrees in computer science and mathematics from the University of Oregon, Yale University, and the University of Illinois at Chicago. He is the author of numerous articles and books, including "Discrete Mathematics, Fifth Edition," and, with co-author Martin Kalin, "Object-Oriented Programming in C++, Second Edition, Applications Programming in C++," and "Applications Programming in ANSI C, Third Edition."

"Marcus Schaefer" is Assistant Professor of Computer Science at DePaul University. He holds degrees in computer science and mathematics from the University of Chicago and the Universitat Karlsruhe. He has authored and co-authored several articles on complexity theory, computability, and graph theory.

Bibliographic information