Discrete Mathematics with Combinatorics, 2/e (Hardcover)
James A. Anderson
- 出版商: Prentice Hall
- 出版日期: 2003-08-29
- 售價: $500
- 貴賓價: 9.8 折 $490
- 語言: 英文
- 頁數: 928
- 裝訂: Hardcover
- ISBN: 0130457914
- ISBN-13: 9780130457912
貴賓價: $2,983Concrete Mathematics: A Foundation for Computer Science, 2/e (Hardcover)
售價: $2,431The Unix Programming Environment (Paperback)
貴賓價: $1,140Computer Organization and Design: The Hardware/Software Interface, 3/e(IE) (美國版ISBN:1558606041)
貴賓價: $627Visual C++ 2008: How to Program, 2/e (IE-Paperback)
售價: $299Regular Expressions Cookbook (Paperback)
貴賓價: $1,045Operating System Principles, 7/e(IE) (美國版ISBN:0471694665－Operating System Concepts, 7/e) (平裝)
貴賓價: $1,068Fundamentals of Multimedia (IE-Paperback)
For one-/two- semester, freshman courses in Discrete Mathematics.
This carefully organized, very readable text covers every essential topic in discrete mathematics in a logical fashion. Placing each topic in context, it covers concepts associated with discrete mathematical systems that have applications in computer science, engineering, and mathematics. The author introduces more basic concepts at the freshman level than are found in other texts, in a simple, accessible form. Introductory material is balanced with extensive coverage of graphs, trees, recursion, algebra, theory of computing, and combinatorics. Extensive examples throughout the text reinforce concepts.
Table of Contents
1. Truth Tables, Logic, and Proofs.Statements and Connectives. Conditional Statements. Equivalent Statements. Axiomatic Systems: Arguments and Proofs. Completeness in Propositional Logic. Karnaugh Maps. Circuit Diagrams.
2. Set Theory.Introduction to Sets. Set Operations. Venn Diagrams. Boolean Algebras. Relations. Partially Ordered Sets. Equivalence Relations. Functions.
3. Logic, Integers, and Proofs.Predicate Calculus. Basic Concepts of Proofs and the Structure of Integers. Mathematical Induction. Divisibility. Prime Integers. Congruence Relations.
4. Functions and Matrices.Functions. Special Functions. Matrices. Cardinality. Cardinals Revisited.
5. Algorithms and Recursion.The “for” Procedure and Algorithms for Matrices. Recursive Functions and Algorithms. Complexity of Algorithms. Sorting Algorithms. Prefix and Suffix Notation. Binary and Hexadecimal Numbers. Signed Numbers. Matrices Continued.
6. Graphs, Directed Graphs and Trees.Graphs. Directed Graphs. Trees. Instant Insanity. Euler Paths and Cycles. Incidence and Adjacency Matrices. Hypercubes and Gray Code.
7. Number Theory.Sieve of Eratosthenes. Fermat's Factorization Method. The Division and Euclidean Algorithms. Continued Fractions. Convergents.
8. Counting and Probability.Basic Counting Principles. Inclusion-Exclusion Introduced. Permutations and Combinations. Generating Permutations and Combinations. Probability Introduced. Generalized Permutations and Combinations. Permutations and Combinations with Repetition. Pigeonhole Principle. Probability Revisited. Bayes' Theorem. Markov Chains.
9. Algebraic Structures.Partially Ordered Sets Revisited. Semigroups and Semilattices. Lattices. Groups. Groups and Homomorphisms. Linear Algebra.
10. Number Theory Revisited.Integral Solutions of Linear Equations. Solutions of Congruence Equations. Chinese Remainder Theorem. Order of an Integer.
11. Recursion Revisited.Homogeneous Linear Recurrence Relations. Nonhomogeneous Linear Recurrence Relations. Finite Differences. Factorial Polynomials. Sums of Differences.
12. Counting Continued.Occupancy Problems. Catalan Numbers. General Inclusion-Exclusion and Derangements. Rook Polynomials and Forbidden Positions.
13. Generating Functions.Defining the Generating Function (optional). Generating Functions and Recurrence Relations. Generating Functions and Counting. Partitions. Exponential Generating Functions.
14. Graphs Revisited.Algebraic Properties of Graphs. Planar Graphs. Coloring Graphs. Hamiltonian Paths and Cycles. Weighted Graphs and Shortest Path Algorithms.
15. Trees.Properties of Trees. Binary Search Trees. Weighted Trees. Traversing Binary Trees. Spanning Trees. Minimal Spanning Trees.
16. Networks.Networks and Flows. Matching. Petri Nets.
17. Theory of Computation.Regular Languages. Automata. Finite State Machines with Output. Grammars. Turing Machines.
18. Theory of Codes.Introduction. Generator Matrices. Hamming Codes.
19. Enumeration of Colors.Burnside's Theorem. Polya's Theorem.
20. Rings, Integral Domains, and Fields.Rings and Integral Domains. Integral Domains. Polynomials. Algebra and Polynomials.
21. Group and Semigroup Characters.Complex Numbers. Group Characters. Semigroup Characters.
22. Applications of Number Theory.Application: Pattern Matching. Application: Hashing Functions. Application: Cryptography.
Hints and Solutions to Selected Exercises.