Discrete Mathematics

Richard Johnsonbaugh

622 pages, parution le 09/01/2002 (5^eme édition)

Ajouter à une liste

Indisponible

Résumé

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.

Contents

Logic and Proofs
The Language of Mathematics
Algorithms
Counting Methods and the Pigeonhole Principle
Recurrence Relations
Graph Theory
Trees
Network Models and Petri Nets
Boolean Algebras and Combinatorial Circuits
Automata, Grammars, and Languages
Computational Geometry

Appendix: Matrices

References

Hints and Solutions to Selected Exercises

Index

L'auteur - Richard Johnsonbaugh

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.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Prentice Hall
Auteur(s)	Richard Johnsonbaugh
Parution	09/01/2002
Édition	5^eme édition
Nb. de pages	622
Format	21,5 x 28,4
Couverture	Relié
Poids	1522g
Intérieur	2 couleurs
EAN13	9780130890085