Bild 1 von 3


Galerie
Bild 1 von 3



Discrete Mathematics 5th Edition Dossey Otto ISBN 9780321305152 Hardcover Used
US $16,00
Ca.EUR 13,74
oder Preisvorschlag
Artikelzustand:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
US $6,79 (ca. EUR 5,83) USPS Ground Advantage®.
Standort: Atlanta, Georgia, USA
Lieferung:
Lieferung zwischen Sa, 13. Dez und Mi, 17. Dez nach 94104 bei heutigem Zahlungseingang
Rücknahme:
60 Tage Rückgabe. Kostenloser Rückversand.
Zahlungen:
Sicher einkaufen
- Gratis Rückversand im Inland
- Punkte für jeden Kauf und Verkauf
- Exklusive Plus-Deals
Info zum Artikel
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:277550843439
Artikelmerkmale
- Artikelzustand
- Pages
- 664
- Publication Date
- 2005-11-28
- Book Title
- Discrete Mathematics
- Edition Number
- 5
- ISBN
- 9780321305152
Über dieses Produkt
Product Identifiers
Publisher
Addison Wesley
ISBN-10
0321305159
ISBN-13
9780321305152
eBay Product ID (ePID)
46969542
Product Key Features
Number of Pages
688 Pages
Publication Name
Discrete Mathematics
Language
English
Publication Year
2005
Subject
General, Discrete Mathematics
Features
Revised
Type
Textbook
Subject Area
Mathematics
Format
Hardcover
Dimensions
Item Height
1.2 in
Item Weight
43.2 Oz
Item Length
9.3 in
Item Width
7.8 in
Additional Product Features
Edition Number
5
Intended Audience
College Audience
LCCN
2005-045880
Dewey Edition
22
Illustrated
Yes
Dewey Decimal
511/.1
Table Of Content
(Each Chapter concludes with "Historical Notes," "Supplementary Exercises," "Computer Projects," and "Suggested Readings."). 1: An Introduction to Combinatorial Problems and Techniques Section 1.1 The Time to Complete a Project Section 1.2 A Matching Problem Section 1.3 A Knapsack Problem Section 1.4 Algorithms and Their Efficiency Historical Notes Supplementary Exercises Computer Projects Suggested Readings 2: Sets, Relations, and Functions Section 2.1 Set Operations Section 2.2 Equivalence Relations Section 2.3_ Partial Ordering Relations Section 2.4 Functions Section 2.5 Mathematical Induction Section 2.6 Applications Historical Notes Supplementary Exercises Computer Projects Suggested Readings 3: Coding Theory Section 3.1 Congruence Section 3.2 The Euclidean Algorithm and Diophantine Equations Section 3.3 The RSA Method Section 3.4 Error-Detecting and Error-Correcting Codes Section 3.5 Matrix Codes Section 3.6 Matrix Codes That Correct All Single-Digit Errors Historical Notes Supplementary Exercises Computer Projects Suggested Readings 4: Graphs Section 4.1 Graphs and Their Representations Section 4.2 Paths and Circuits Section 4.3 Shortest Paths and Distance Section 4.4 Coloring a Graph Section 4.5 Directed Graphs and Multigraphs Historical Notes Supplementary Exercises Computer Projects Suggested Readings 5: Trees Section 5.1 Properties of Trees Section 5.2 Spanning Trees Section 5.3 Depth-First Search Section 5.4 Rooted Trees Section 5.5 Binary Trees and Traversals Section 5.6 Optimal Binary Trees and Binary Search Trees Historical Notes Supplementary Exercises Computer Projects Suggested Readings 6: Matching Section 6.1 Systems of Distinct Representatives Section 6.2 Matchings in Graphs Section 6.3 A Matching Algorithm Section 6.4 Applications of the Algorithm Section 6.5 The Hungarian Method Historical Notes Supplementary Exercises Computer Projects Suggested Readings 7: Network Flows Section 7.1 Flows and Cuts Section 7.2 A Flow Augmentation Algorithm Section 7.3 The Max-Flow Min-Cut Theorem Section 7.4 Flows and Matchings Historical Notes Supplementary Exercises Computer Projects Suggested Readings 8: Counting Techniques Section 8.1 Pascal''s Triangle and the Binomial Theorem Section 8.3 Permutations and Combinations Section 8.4 Arrangements and Selections with Repetitions Section 8.5 Probability Section 8.6* The Principle of Inclusion-Exclusion Section 8.7* Generating Permutations and r -Combinations Historical Notes Supplementary Exercises Computer Projects Suggested Readings 9: Recurrence Relations and Generating Functions Section 9.1 Recurrence Relations Section 9.2 The Method of Iteration Section 9.3 Linear Difference Equations with Constant Coefficients Section 9.4* Analyzing the Efficiency of Algorithms with Recurrence Relations Section 9.5 Counting with Generating Functions Section 9.6 The Algebra of Generating Functions Historical Notes Supplementary Exercises Computer Projects Suggested Readings 10: Combinatorial Circuits and Finite State Machines Section 10.1 Logical Gates Section 10.2 Creating Combinatorial Circuits Section 10.3 Karnaugh Maps Section 10.4 Finite State Machines Historical Notes Supplementary Exercises Computer Projects Suggested Readings Appendix A: An Introduction to Logic and Proof Section A.1 Statements and Connectives Section A.2 Logical Equivalence Section A.3 Methods of Proof Historical Notes Supplementary Exercises Suggested Readings Appendix B Matrices Historical Notes Appendix C The Algorithms in This Book Bibliography Answers to odd-numbered exercises Index
Edition Description
Revised edition
Synopsis
The strong algorithmic emphasis of Discrete Mathematics is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students. Algorithms are presented in English, eliminating the need for knowledge of a particular programming language. Computational and algorithmic exercise sets follow each chapter section and supplementary exercises and computer projects are included in the end-of-chapter material. This Fifth Edition features a new Chapter 3 covering matrix codes, error correcting codes, congruence, Euclidean algorithm and Diophantine equations, and the RSA algorithm. MARKET : Intended for use in a one-semester introductory course in discrete mathematics., An ever-increasing percentage of mathematic applications involve discrete rather than continuous models. Driving this trend is the integration of the computer into virtually every aspect of modern society. Intended for a one-semester introductory course, the strong algorithmic emphasis of Discrete Mathematics is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students., The strong algorithmic emphasis of "Discrete Mathematics" is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students. Algorithms are presented in English, eliminating the need for knowledge of a particular programming language. Computational and algorithmic exercise sets follow each chapter section and supplementary exercises and computer projects are included in the end-of-chapter material. This Fifth Edition features a new Chapter 3 covering matrix codes, error correcting codes, congruence, Euclidean algorithm and Diophantine equations, and the RSA algorithm. MARKET Intended for use in a one-semester introductory course in discrete mathematics., The strong algorithmic emphasis of Discrete Mathematics is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students. Algorithms are presented in English, eliminating the need for knowledge of a particular programming language. Computational and algorithmic exercise sets follow each chapter section and supplementary exercises and computer projects are included in the end-of-chapter material. This Fifth Edition features a new Chapter 3 covering matrix codes, error correcting codes, congruence, Euclidean algorithm and Diophantine equations, and the RSA algorithm. MARKET Intended for use in a one-semester introductory course in discrete mathematics.
LC Classification Number
QA39.3.D58 2006
Artikelbeschreibung des Verkäufers
Info zu diesem Verkäufer
Outside Since
99,2% positive Bewertungen•5.433 Artikel verkauft
Angemeldet als privater VerkäuferDaher finden verbraucherschützende Vorschriften, die sich aus dem EU-Verbraucherrecht ergeben, keine Anwendung. Der eBay-Käuferschutz gilt dennoch für die meisten Käufe. Mehr erfahrenMehr erfahren
Verkäuferbewertungen (1.754)
- a***r (610)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufExcellent transaction with great communication! Great shipping, packaging, value, and as described. A++++. THANKS!
- 0***0 (313)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufGreat deal. Fair pricing. Shipped fast. Only issue was packaging was not great. No bubble wrap. Box was damaged when I received it. Overall, I got a good deal. Thanks. I would do business again!
- e***e (392)- Bewertung vom Käufer.Letzter MonatBestätigter Kaufvery slow to ship, but i did eventually get it, great deal, as described, real photos, affordable packaging, recommended seller
Produktbewertungen & Rezensionen
Relevanteste Rezensionen
- 26. Sep. 2018
So amazing
Bestätigter Kauf: JaZustand: NeuVerkauft von: bestvebsdeal
Noch mehr entdecken:
- Fachbücher über Rechtswissenschaften von Otto-Palandt,
- Otto Palandt Rechtswissenschaften Deutsche Studium und Erwachsenenbildung,
- Otto-Palandt-Rechtswissenschaften-Gebundene - Ausgabe Studium und Erwachsenenbildung,
- Hörbücher und Hörspiele Action Europa Editions,
- Europa-Editions-Erwachsene Hörbücher und Hörspiele,
- Hörbücher und Hörspiele Europa Editions Kassette,
- Hörbücher und Hörspiele Europa Editions Action,
- Hörbücher und Hörspiele Europa Editions mit Audio-CD,
- Hörbücher und Hörspiele Europa Editions Kassette,
- Hörbücher und Hörspiele Europa Editions Horror

