Picture 1 of 3

Stock photo

New-Discrete Mathematics by Kenneth A. Ross 5ed INTL ED - Picture 1 of 3

New-Discrete Mathematics by Kenneth A. Ross 5ed INTL ED - Picture 2 of 3

New-Discrete Mathematics by Kenneth A. Ross 5ed INTL ED - Picture 3 of 3

Discrete Mathematics by Charles Wright and Kenneth Ross (2002, Trade Paperback)

NewBoxSetBooks (681)

99.4% positive Feedback

Price:

US $27.15

Approximately£20.22

+ $26.59 postage

Estimated delivery Mon, 20 Oct - Tue, 28 Oct

Returns:

30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount. Policy depends on postage service.

Condition:

New

About this product

Product Identifiers

PublisherPearson Education

ISBN-100130652474

ISBN-139780130652478

eBay Product ID (ePID)2379179

Product Key Features

Number of Pages632 Pages

Publication NameDiscrete Mathematics

LanguageEnglish

SubjectGeneral, Discrete Mathematics

Publication Year2002

FeaturesRevised

TypeTextbook

Subject AreaMathematics

AuthorCharles Wright, Kenneth Ross

FormatTrade Paperback

Dimensions

Item Height1.3 in

Item Weight49.6 Oz

Item Length10.9 in

Item Width8.3 in

Additional Product Features

Edition Number5

Intended AudienceCollege Audience

LCCN2002-030802

IllustratedYes

Edition DescriptionRevised edition

Table Of Content1. 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.

SynopsisKey Benefit: This book presents a sound mathematical treatment that increases smoothly in sophistication. Key Topics: The book presents utility-grade discrete math tools so that any reader can understand them, use them, and move on to more advanced mathematical topics. Market: A handy reference for computer scientists., 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.

LC Classification NumberQA76.9.M35R67 2002