Discrete mathematics / Richard Johnsonbaugh
Material type:
TextPublication details: New York : Macmillan Publishing Company, c1993Edition: Third editionDescription: xiv, 800 p. : illustrations ; 20 cmISBN: - 23607211
- QA 39.2 .J64 1993
Books
| 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 1993 (Browse shelf(Opens below)) | c.1 | Available | NULIB000002335 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Gen. Ed. - CCIT Close shelf browser (Hides shelf browser)
|
|
|
No cover image available |
|
|
|
||
| GC Q 325.5 .B53 2019 c.2 Machine learning A-Z : introduction to AI digital brains of the future / | GC Q 325.5 .B66 2020 Mastering machine learning algorithms : expert techniques for implementing popular machine learning algorithms, fine-tuning your models, and understanding how they work / | 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 / |
Includes bibliographical references and index.
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 and Petri Nets -- 9. Boolean Algebras and Combinational Circuits -- 10. Automata, Grammars and Languages -- 11. Computational Geometry -- Appendix: Matrices -- References -- Hints and Solutions to Selected Exercises -- Index.
This book is intended for a one- or two-term introductory course in discrete mathematics. Formal mathematics prerequisites are minimal; calculus is not required. There are no computer science prerequisites. The book includes examples, exercises, figures, notes, chapter reviews, and self-tests to help the reader master introductory discrete mathematics. In addition to the book, an Instructor's Guide is available.
There are no comments on this title.