Discrete Mathematical Structures (Classic Version) (Pearson Modern Classics for Advanced Mathematics Series) (6TH)

個数:

Discrete Mathematical Structures (Classic Version) (Pearson Modern Classics for Advanced Mathematics Series) (6TH)

  • 在庫がございません。海外の書籍取次会社を通じて出版社等からお取り寄せいたします。
    通常6~9週間ほどで発送の見込みですが、商品によってはさらに時間がかかることもございます。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合がございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 560 p.
  • 言語 ENG
  • 商品コード 9780134696447
  • DDC分類 004

Full Description

Discrete Mathematical Structures, 6th Edition offers a clear and concise presentation of the fundamental concepts of discrete mathematics. Ideal for a one-semester introductory course, it contains more genuine computer science applications than any other text in the field. It is written at an appropriate level for a wide variety of majors and non-majors, and assumes a college algebra course as a prerequisite.

This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price.

Contents

Table of Contents

Fundamentals

1.1 Sets and Subsets
1.2 Operations on Sets
1.3 Sequences
1.4 Properties of Integers
1.5 Matrices
1.6 Mathematical Structures

Logic

2.1 Propositions and Logical Operations
2.2 Conditional Statements
2.3 Methods of Proof
2.4 Mathematical Induction
2.5 Mathematical Statements
2.6 Logic and Problem Solving

Counting

3.1 Permutations
3.2 Combinations
3.3 Pigeonhole Principle
3.4 Elements of Probability
3.5 Recurrence Relations 112

Relations and Digraphs

4.1 Product Sets and Partitions
4.2 Relations and Digraphs
4.3 Paths in Relations and Digraphs
4.4 Properties of Relations
4.5 Equivalence Relations
4.6 Data Structures for Relations and Digraphs
4.7 Operations on Relations
4.8 Transitive Closure and Warshall's Algorithm

Functions

5.1 Functions
5.2 Functions for Computer Science
5.3 Growth of Functions
5.4 Permutation Functions

Order Relations and Structures

6.1 Partially Ordered Sets
6.2 Extremal Elements of Partially Ordered Sets
6.3 Lattices
6.4 Finite Boolean Algebras
6.5 Functions on Boolean Algebras
6.6 Circuit Design

Trees

7.1 Trees
7.2 Labeled Trees
7.3 Tree Searching
7.4 Undirected Trees
7.5 Minimal Spanning Trees

Topics in Graph Theory

8.1 Graphs
8.2 Euler Paths and Circuits
8.3 Hamiltonian Paths and Circuits
8.4 Transport Networks
8.5 Matching Problems
8.6 Coloring Graphs

Semigroups and Groups

9.1 Binary Operations Revisited
9.2 Semigroups
9.3 Products and Quotients of Semigroups
9.4 Groups
9.5 Products and Quotients of Groups
9.6 Other Mathematical Structures

Languages and Finite-State Machines

10.1 Languages
10.2 Representations of Special Grammars and Languages
10.3 Finite-State Machines
10.4 Monoids, Machines, and Languages
10.5 Machines and Regular Languages
10.6 Simplification of Machines

Groups and Coding

11.1 Coding of Binary Information and Error Detection
11.2 Decoding and Error Correction
11.3 Public Key Cryptology

Appendix A: Algorithms and Pseudocode Appendix B: Additional Experiments in Discrete Mathematics Appendix C: Coding Exercises

最近チェックした商品