离散数学(第5版)
|
|
| 新书城图书编号:1388 |
| 图书ISBN:7302074631 |
| 出版时间:2003-11-1 |
| 出版社:清华大学出版社 |
| 作者:[美]Kenneth A.Ross,Charles R.B.Wright |
|
市场价格:¥56 |
|
普通会员:¥44.8
|
80折 |
|
VIP会员:¥42
|
75折 |
|
|
|
|
|
|
|
【图书简介】
|
|
本书通过大量示例深入浅出地介绍了离散数学的主要内容,包括集合、序和函数,基础逻辑,关系,归纳与递归,计数,图与树,递归、树与算法,有向图,离散概率,布尔代数,代数结构,谓词演算与无限集等。各章节配有相当数量的练习题,书后给出了提示和答案,对教师授课和读者迅速掌握有关知识很有帮助。本书内容丰富,结构清晰、系统,讲解通俗易懂,而且注重实用性,既可作为计算机科学和计算机数学等专业的本科生和研究生的教科书,又可作为工程技术人员的参考书。
|
|
|
|
【图书目录】
|
1. Sets, Sequences, and Functions. Some Warm-up Questions. Factors and Multiples. Office Hours 1.2. Some Special Sets. Set Operations. Functions. Sequences. Properties of Functions. Office Hours 1.7. Supplementary Exercises. 2. Elementary Logic. Informal Introduction. Propositional Calculus. Getting Started with Proofs. Methods of Proof. Office Hours 2.4. Logic in Proofs. Analysis of Arguments. Supplementary Exercises. 3. Relations. Relations. Digraphs and Graphs. Matrices. Equivalence Relations and Partitions. The Division Algorithm and Integers Mod p. Supplementary Exercises. 4. Induction and Recursion. Loop Invariants. Mathematical Induction. Office Hours 4.2. Big-Oh Notation. Recursive Definitions. Recurrence Relations. More Induction. The Euclidean Algorithm. Supplementary Exercises. 5. Counting. Basic Counting Techniques. Elementary Probability. Inclusion-Exclusion and Binomial Methods. Counting and Partitions. Office Hours 5.4. Pigeon-Hole Principle. Supplementary Exercises. 6. Introduction to Graphs and Trees. Graphs. Edge Traversal Problems. Trees. Rooted Trees. Vertex Traversal Problems. Minimum Spanning Trees. Supplementary Exercises. 7. Recursion, Trees and Algorithms. General Recursion. Recursive Algorithms. Depth-First Search Algorithms. Polish Notation. Weighted Trees. Supplementary Exercises. 8. Digraphs. Digraphs Revisited. Weighted Digraphs and Scheduling Networks. Office Hours 8.2. Digraph Algorithms. Supplementary Exercises. 9. Discrete Probability. Independence in Probability. Random Variables. Expectation and Standard Deviation. Probability Distributions. Supplementary Exercises. 10. Boolean Algebra. Boolean Algebras. Boolean Expressions. Logic Networks. Karnaugh Maps. Isomorphisms of Boolean Algebras. Supplementary Exercises. 11. More on Relations. Partially Ordered Sets. Special Orderings. Multiplication of Matrices. Properties of General Relations. Closures of Relations. Supplementary Exercises. 12. Algebraic Structures. Groups Acting on Sets. Fixed Points and Subgroups. Counting Orbits. Group Homomorphisms. Semigroups. Other Algebraic Systems. Supplementary Exercises. 13. Predicate Calculus and Infinite Sets. Quantifiers and Predicates. Elementary Predicate Calculus. Infinite Sets. Supplementary Exercises. Dictionary.
|
|
|
|