Discrete mathematics / Richard Johnsonbaugh

By:

Johnsonbaugh, Richard [author]

Material type: Text

TextPublication details: Singapore : Pearson Education Asia Pte. Ltd., c2001Edition: Fifth edition, Low price editionDescription: xv, 621 pages : illustrations ; 26 cmISBN:

9789814096393

Subject(s):

MATHEMATICS

LOC classification:

QA 39.2 .J64 2001

Contents:

1. Logic and Proofs -- 2. The Language of Mathematics -- 3. Algorithms -- 4. Counting Methods and the Pigeonhole Principle -- 5. Recurrence Relations -- 6. Graph Theory -- 7. Trees -- 8. Network Models -- 9. Boolean Algebras and Combinational Circuits -- 10. Automata, Grammars and Languages -- 11. Computational Geometry -- A. Matrices -- B. Algebra Review -- References -- Hints and Solutions to Selected Exercises -- Index.

Summary: 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.

Item type:

Books

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Home library	Collection	Call number	Copy number	Status	Date due	Barcode
Books	National University - Manila	LRC - Main General Circulation	Gen. Ed. - CCIT	GC QA 39.2 .J64 2001 c.2 (Browse shelf(Opens below))	c.2	Available		NULIB000002217

Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Gen. Ed. - CCIT Close shelf browser (Hides shelf browser)

Previous		No cover image available						Next
Previous	GC Q 325.5 .G47 2019 Hands-on machine learning with scikit-learn, keras, and tensorflow : concepts, tools, and techniques to build intelligent systems /	GC QA 39.2 .J64 1993 Discrete mathematics /	GC QA 39.2 .J64 2001 c.1 Discrete mathematics /	GC QA 39.2 .J64 2001 c.2 Discrete mathematics /	GC QA 39.2 .J64 2006 c.1 Introduction to discrete mathematics /	GC QA 39.2 .J64 2006 c.2 Introduction to discrete mathematics /	GC QA 39.2 .J64 2006 c.3 Introduction to discrete mathematics /	Next

Includes index.

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.

There are no comments on this title.

to post a comment.