Discrete mathematics / Richard Johnsonbaugh.
By: Johnsonbaugh, Richard
.
Series: The JK computer science and mathematics series: Publisher: Upper Saddle River, New Jersey : Pearson / Prentice Hall, c2005Edition: 6th ed., Int. ed.Description: xvi, 672 p. : ill. ; 27 cm.ISBN: 0131277677 (pbk.); 9780131277670 (pbk.).Subject(s): Computer science -- Mathematics | MathematicsDDC classification: 510
Contents:
Preface - 1. Logic and Proofs - 2. The Language of Mathematics - 3. Relations - 4. Algorithms - 5. Introduction to number theory - 6. Counting methods and the Pigeonhole principle - 7. Recurrence relations - 8. Graph theory - 9. Trees - 10. Network models - 11. Boolean Algebras and Combinatorial Circuits - 12. Automata, Grammars and Languages - 13. Computational Geometry.
| Item type | Current location | Call number | Copy number | Status | Notes | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| Main Collection | Taylor's Library-TU | 510 JOH (Browse shelf) | 1 | Available | SOCIT,15004,03,RM | 5000048033 | |
| Main Collection | Taylor's Library-TU | 510 JOH (Browse shelf) | 1 | Available | SOCIT,15003,03,RM | 5000048567 |
Browsing Taylor's Library-TU Shelves Close shelf browser
| 510 HUT Logic in computer science : | 510 JEF 2009 Decision. | 510 JOH Discrete mathematics / | 510 JOH Discrete mathematics / | 510 JOH Discrete mathematics / | 510 JOH Discrete mathematics / | 510 JOH Discrete mathematics / |
Includes bibliographical references (p. 577-581) and index.
Preface - 1. Logic and Proofs - 2. The Language of Mathematics - 3. Relations - 4. Algorithms - 5. Introduction to number theory - 6. Counting methods and the Pigeonhole principle - 7. Recurrence relations - 8. Graph theory - 9. Trees - 10. Network models - 11. Boolean Algebras and Combinatorial Circuits - 12. Automata, Grammars and Languages - 13. Computational Geometry.