Discrete mathematics / Richard Johnsonbaugh
Material type:
- 9789810695927
- QA 39.2 .J64 2009

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
National University - Manila | LRC - Main General Circulation | Gen. Ed. - CCIT | GC QA 39.2 .J64 2009 (Browse shelf(Opens below)) | c.1 | Available | NULIB000007006 |
Includes bibliographical references and index.
Preface -- Sets and logic -- Proofs -- Functions, sequences, and relations -- Algorithms -- Introduction to number theory -- Counting methods and the pigeonhole principle -- Recurrence relations -- Graph theory -- Trees -- Network models -- Boolean algebras and combinatorial circuits -- Automata, grammars, and languages -- Computational geometry -- Appendix: A. Matrices ; B. Algebra review ; C. Pseudocode -- References -- Hints and solutions to selected exercises -- Index.
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.
There are no comments on this title.