Introduction to discrete mathematics / (Record no. 4966)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03529nam a2200229Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250520094855.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 250520s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9789810699338 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA 39.2 .J64 2006 |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Johnsonbaugh, Richard |
| Relator term | author |
| 245 #0 - TITLE STATEMENT | |
| Title | Introduction to discrete mathematics / |
| Statement of responsibility, etc. | Richard Johnsonbaugh |
| 250 ## - EDITION STATEMENT | |
| Edition statement | Sixth edition. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | Upper Saddle River, New Jersey : |
| Name of publisher, distributor, etc. | Pearson/Prentice Hall, |
| Date of publication, distribution, etc. | c2006 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xvi, 672 pages : |
| Other physical details | illustrations ; |
| Dimensions | 23 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Includes bibliographical references and index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | (NOTE: All Chapters end with Notes, Chapter Review, Chapter Self-Test, and Computer Exercises.) Preface. 1. Logic and Proofs. Propositions. Conditional Propositions and Logical Equivalence. Quantifiers. Proofs. Resolution Proofs. Mathematical Induction. Strong Form of Induction and well ordering Property. 2. The Language of Mathematics Sets. Functions. Sequences and Strings. Relations. 3. Relations. Relations. Equivalence Relations. Matrices of Relations. Relational Databases.4. Algorithms. Introduction. Correctness of Algorithms. Analysis of Algorithms. Recursive Algorithms. 5. Introduction to Number Theory. Divisors. Representation of Integers and Integer Algorithims. The Euclidean Algorithm. The RSA Public-Key Cryptosystem. 6. Counting Methods and the Pigeonhole Principle. Basic Principles. Permutations and Combinations. Algorithms for Generating Permutations and Combinations. Introduction to Discrete Probability. Discrete Probability Theory. Generalized Permutations and Combinations. Binomial Coefficients and Combinatorial Identities. The Pigeonhole Principle. 7. Recurrence Relations. Introduction. Solving Recurrence Relations. Applications to the Analysis of Algorithms. 8. Graph Theory. Introduction. Paths and Cycles. Hamiltonian Cycles and the Traveling Salesperson Problem. A Shortest-Path Algorithm. Representations of Graphs. Isomorphisms of Graphs. Planar Graphs. Instant Insanity. 9. Trees. Introduction. Terminology and Characterizations of Trees. Spanning Trees. Minimal Spanning Trees. Binary Trees. Tree Traversals. Decision Trees and the Minimum Time for Sorting. Isomorphisms of Trees. Game Trees. 10. Network Models. Introduction. A Maximal Flow Algorithm. The Max Flow, Min Cut Theorem. Matching. 11. Boolean Algebras and Combinatorial Circuits. Combinatorial Circuits. Properties of Combinatorial Circuits. Boolean Algebras. Boolean Functions and Synthesis of Circuits. Applications 12. Automata, Grammars, and Languages. Sequential Circuits and Finite-State Machines. Finite-State Automata. Languages and Grammars. Nondeterministic Finite-State Automata. Relationships Between Languages and Automata. 13. Computational Geometry. The Closest-Pair Problem. An Algorithm to Compute the Convex Hull. Appendices. Matrices. Algebra Review. References. Hints and Solutions to Selected Exercises. Index. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem-solving techniques. The book 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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | MATHEMATICS |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Library of Congress Classification |
| Koha item type | Books |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Total checkouts | Full call number | Barcode | Date last seen | Copy number | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Library of Congress Classification | Gen. Ed. - CCIT | LRC - Main | National University - Manila | General Circulation | 11/29/2011 | Reaccessioned | GC QA 39.2 .J64 2006 c.3 | NULIB000002725 | 05/20/2025 | c.3 | 05/20/2025 | Books |