Bernard Kolman, Robert Busby, Sharon C. Ross
Discrete Mathematical Structures (eBook, PDF)
Pearson New International Edition
42,95 €
42,95 €
inkl. MwSt.
Sofort per Download lieferbar
21 °P sammeln
42,95 €
Als Download kaufen
42,95 €
inkl. MwSt.
Sofort per Download lieferbar
21 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
42,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
21 °P sammeln
Bernard Kolman, Robert Busby, Sharon C. Ross
Discrete Mathematical Structures (eBook, PDF)
Pearson New International Edition
- Format: PDF
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung

Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei
bücher.de, um das eBook-Abo tolino select nutzen zu können.
Hier können Sie sich einloggen
Hier können Sie sich einloggen
Sie sind bereits eingeloggt. Klicken Sie auf 2. tolino select Abo, um fortzufahren.

Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei bücher.de, um das eBook-Abo tolino select nutzen zu können.
Discrete Mathematical Structures
- Geräte: PC
- ohne Kopierschutz
- eBook Hilfe
Andere Kunden interessierten sich auch für
- Richard JohnsonbaughDiscrete Mathematics, Global Edition (eBook, PDF)42,95 €
- Robert V. HoggIntroduction to Mathematical Statistics, Global Edition (eBook, PDF)42,95 €
- Ralph P. GrimaldiDiscrete and Combinatorial Mathematics (eBook, PDF)42,95 €
- Gary ChartrandMathematical Proofs: A Transition to Advanced Mathematics (eBook, PDF)42,95 €
- Raymond A. BarnettCollege Math for Business, Economics, Life Sciences & Social Sciences PDF eBook, Global Edition (eBook, PDF)43,95 €
- Margaret L. LialFinite Mathematics with Applications In the Management, Natural, and Social Sciences, Global Edition (eBook, PDF)42,95 €
- Raymond A. Barnette Book Instant Access for Finite Mathematics for Business, Economics, Life Sciences and Social Sciences,Global Edition (eBook, PDF)42,95 €
-
-
-
Discrete Mathematical Structures
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: Pearson HigherEducation
- Seitenzahl: 544
- Altersempfehlung: ab 18 Jahre
- Erscheinungstermin: 29. August 2013
- Englisch
- ISBN-13: 9781292037509
- Artikelnr.: 41939669
- Verlag: Pearson HigherEducation
- Seitenzahl: 544
- Altersempfehlung: ab 18 Jahre
- Erscheinungstermin: 29. August 2013
- Englisch
- ISBN-13: 9781292037509
- Artikelnr.: 41939669
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
1. 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
2. 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
3. Counting
3.1 Permutations
3.2 Combinations
3.3 Pigeonhole Principle
3.4 Elements of Probability
3.5 Recurrence Relations 112
4. 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
5. Functions
5.1 Functions
5.2 Functions for Computer Science
5.3 Growth of Functions
5.4 Permutation Functions
6. 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
7. Trees
7.1 Trees
7.2 Labeled Trees
7.3 Tree Searching
7.4 Undirected Trees
7.5 Minimal Spanning Trees
8. 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
9. 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
10. Groups and Coding
10.1 Coding of Binary Information and Error Detection
10.2 Decoding and Error Correction
10.3 Public Key Cryptology
11. Languages and Finite-State Machines
11.1 Languages
11.2 Representations of Special Grammars and Languages
11.3 Finite-State Machines
11.4 Monoids, Machines, and Languages
11.5 Machines and Regular Languages
11.6 Simplification of Machines
Appendix A: Algorithms and Pseudocode
Appendix B: Additional Experiments in Discrete Mathematics
Appendix C: Coding Exercises
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
2. 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
3. Counting
3.1 Permutations
3.2 Combinations
3.3 Pigeonhole Principle
3.4 Elements of Probability
3.5 Recurrence Relations 112
4. 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
5. Functions
5.1 Functions
5.2 Functions for Computer Science
5.3 Growth of Functions
5.4 Permutation Functions
6. 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
7. Trees
7.1 Trees
7.2 Labeled Trees
7.3 Tree Searching
7.4 Undirected Trees
7.5 Minimal Spanning Trees
8. 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
9. 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
10. Groups and Coding
10.1 Coding of Binary Information and Error Detection
10.2 Decoding and Error Correction
10.3 Public Key Cryptology
11. Languages and Finite-State Machines
11.1 Languages
11.2 Representations of Special Grammars and Languages
11.3 Finite-State Machines
11.4 Monoids, Machines, and Languages
11.5 Machines and Regular Languages
11.6 Simplification of Machines
Appendix A: Algorithms and Pseudocode
Appendix B: Additional Experiments in Discrete Mathematics
Appendix C: Coding Exercises
1. 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
2. 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
3. Counting
3.1 Permutations
3.2 Combinations
3.3 Pigeonhole Principle
3.4 Elements of Probability
3.5 Recurrence Relations 112
4. 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
5. Functions
5.1 Functions
5.2 Functions for Computer Science
5.3 Growth of Functions
5.4 Permutation Functions
6. 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
7. Trees
7.1 Trees
7.2 Labeled Trees
7.3 Tree Searching
7.4 Undirected Trees
7.5 Minimal Spanning Trees
8. 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
9. 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
10. Groups and Coding
10.1 Coding of Binary Information and Error Detection
10.2 Decoding and Error Correction
10.3 Public Key Cryptology
11. Languages and Finite-State Machines
11.1 Languages
11.2 Representations of Special Grammars and Languages
11.3 Finite-State Machines
11.4 Monoids, Machines, and Languages
11.5 Machines and Regular Languages
11.6 Simplification of Machines
Appendix A: Algorithms and Pseudocode
Appendix B: Additional Experiments in Discrete Mathematics
Appendix C: Coding Exercises
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
2. 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
3. Counting
3.1 Permutations
3.2 Combinations
3.3 Pigeonhole Principle
3.4 Elements of Probability
3.5 Recurrence Relations 112
4. 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
5. Functions
5.1 Functions
5.2 Functions for Computer Science
5.3 Growth of Functions
5.4 Permutation Functions
6. 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
7. Trees
7.1 Trees
7.2 Labeled Trees
7.3 Tree Searching
7.4 Undirected Trees
7.5 Minimal Spanning Trees
8. 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
9. 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
10. Groups and Coding
10.1 Coding of Binary Information and Error Detection
10.2 Decoding and Error Correction
10.3 Public Key Cryptology
11. Languages and Finite-State Machines
11.1 Languages
11.2 Representations of Special Grammars and Languages
11.3 Finite-State Machines
11.4 Monoids, Machines, and Languages
11.5 Machines and Regular Languages
11.6 Simplification of Machines
Appendix A: Algorithms and Pseudocode
Appendix B: Additional Experiments in Discrete Mathematics
Appendix C: Coding Exercises