Discrete Mathematics (The Jk Computer Science and Mathematics Series) （5 SUB）

Discrete Mathematics (The Jk Computer Science and Mathematics Series) （5 SUB）

  • ただいまウェブストアではご注文を受け付けておりません。 ⇒古書を探す
  • 製本 Hardcover:ハードカバー版／ページ数 621 p.
  • 言語 ENG
  • 商品コード 9780130890085
  • DDC分類 510

Full Description


For one or two term introductory courses in discrete mathematics.This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has woven techniques of proofs into the text as a running theme. Each chapter has a problem-solving corner that shows students how to attack and solve problems.

Contents

(NOTESelf-Test, and Computer Exercises.)1. Logic and Proofs. Propositions. Conditional Propositions and Logical Equivalence. Quantifiers. Proofs. Resolutions Proofs. Mathematical Induction.2. The Language of Mathematics. Sets. Sequences and Strings. Number Systems. Relations. Equivalence Relations. Matrices of Relations. Relational Databases. Functions.3. Algorithms. Introduction. Notation for Algorithms. The Euclidean Algorithm. Recursive Algorithms. Complexity of Algorithms. Analysis of the Ruclidean Algorithm. The RSA Public-Key Cryptosystem.4. 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.5. Recurrence Relations. Introduction. Solving Recurrence Relations. Applications to the Analysis of Algorithms.6. Graph Theory. Introduction. Paths and Cycles. Hamiltonian Cycles and the Traveling Salesperson Problem. A Shortest-Path Algorithm. Representation of Graphs. Isomorphisms of Graphs. Planar Graphs. Instant Insanity.7. 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.8. Network Models. Introduction. A Maximal Flow Algorithm. The Max Flow, Min Cut Theorem. Matching.9. Boolean Algebra and Combinatorial Circuits. Combinatorial Circuits. Properties of Combinatorial Circuits. Boolean Algebras. Boolean Functions and Synthesis of Circuits. Applications.10. 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.11. Computational Geometry. The Closest-Pair Problem. A Lower Bound for the Closest-Pair Problem. An Algorithm to Compute the Convex Hull.Appendix A: Matrices. Appendix B: Algebra Review. References. Hints and Solutions to Selected Exercises. Index.