Discrete Mathematics

Häftad, Engelska, 2002

2 631 kr

Beställningsvara. Skickas inom 3-6 vardagar. Fri frakt över 249 kr.

Beskrivning

Revised for extra clarity, the distinguishing characteristic of Ross and Wright is a sound mathematical treatment that increases smoothly in sophistication. The text presents utility-grade discrete math tools so students can understand them, use them, and move on to more advanced mathematical topics.

Produktinformation

Utgivningsdatum:2002-09-12
Mått:211 x 278 x 29 mm
Vikt:1 520 g
Format:Häftad
Språk:Engelska
Antal sidor:632
Upplaga:5
Förlag:Pearson Education (US)
ISBN:9780130652478

Utforska kategorier

Matematik inom Naturvetenskap och teknik

Innehållsförteckning

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.

Mer från samma författare

Christianity in North America

Kenneth Ross, Grace Ji-Sun Kim, Todd Johnson, Kenneth R. Ross, Grace Ji-Sun Kim, Todd M. Johnson

Inbunden, 2023

2 339 kr

Ross: Malawi's First Presbyterian Ministers

Kenneth Ross

E-bok

2024

299 kr

Church of Central Africa Presbyterian 1924-2024

Mwawi Chilongozi, Kenneth Ross

E-bok

2024

628 kr

Warm Heart

Kenneth Ross

E-bok

2024

488 kr

Malawian Missionaries in Tanzania's Sout

Kenneth Ross

E-bok

2023

270 kr

Du kanske också är intresserad av

Christianity in North America

Kenneth Ross, Grace Ji-Sun Kim, Todd Johnson, Kenneth R. Ross, Grace Ji-Sun Kim, Todd M. Johnson

Inbunden, 2023

2 339 kr

Warm Heart

Kenneth Ross

E-bok

2024

488 kr

Church of Central Africa Presbyterian 1924-2024

Mwawi Chilongozi, Kenneth Ross

E-bok

2024

628 kr

Malawian Missionaries in Tanzania's Sout

Kenneth Ross

E-bok

2023

270 kr

Ross: Malawi's First Presbyterian Ministers

Kenneth Ross

E-bok

2024

299 kr

Appalachia: Poems

Charles Wright

Häftad, 2004

108 kr

Poems, on Several Occasions, Chiefly Divine and Moral. Principally Designed to Create an awe for the Supreme Creator, and Enlighten the Vain Notions of an Abandoned and Lukewarm age. By Charles Wright

Charles Wright

Inbunden, 2018

335 kr

Outtakes

Charles Wright

Häftad, 2011

181 kr

Chickamauga

Charles Wright

Häftad, 1996

134 kr

Way of the Heart

Charles Wright

E-bok

2024

568 kr

Discrete Mathematics

AvKenneth Ross,Charles Wright

Häftad, Engelska, 2002

2 631 kr

Beställningsvara. Skickas inom 3-6 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:2002-09-12
Mått:211 x 278 x 29 mm
Vikt:1 520 g
Format:Häftad
Språk:Engelska
Antal sidor:632
Upplaga:5
Förlag:Pearson Education (US)
ISBN:9780130652478

Utforska kategorier

Matematik inom Naturvetenskap och teknik

Innehållsförteckning

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.