Discrete Mathematics 5th Edition Dossey Otto ISBN 9780321305152 Hardcover Used

Outside Since
(1741)
Vendedor particularRegistrado como vendedor particular
Por tanto, no se aplican las normas de protección de los consumidores derivadas de la legislación de la UE en materia de consumidores. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más información
Otros artículos del vendedor
Contactar con el vendedor
USD16,00
Aproximadamente13,76 EUR
o Mejor oferta
Estado:
Como nuevo
Respira tranquilidad. Devoluciones gratis.
Envío:
USD6,79 (aprox. 5,84 EUR) USPS Ground Advantage®.
Ubicado en: Atlanta, Georgia, Estados Unidos
Entrega:
Entrega prevista entre el lun. 15 dic. y el lun. 22 dic. a 94104
Calculamos el plazo de entrega con un método patentado que combina diversos factores, como la proximidad del comprador a la ubicación del artículo, el servicio de envío seleccionado, el historial de envíos del vendedor y otros datos. Los plazos de entrega pueden variar, especialmente en épocas de mucha actividad.
Devoluciones:
60 días para devoluciones. El vendedor paga el envío de la devolución.
Pagos:
    Diners Club

Compra con confianza

Garantía al cliente de eBay
Si no recibes el artículo que has pedido, te devolvemos el dinero. Más informaciónGarantía al cliente de eBay - se abre en una nueva ventana o pestaña
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:277550843439

Características del artículo

Estado
Como nuevo: Libro en perfecto estado y poco leído. La tapa no tiene desperfectos y si procede, con ...
Pages
664
Publication Date
2005-11-28
Book Title
Discrete Mathematics
Edition Number
5
ISBN
9780321305152
Categoría

Acerca de este producto

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
Author
Charles Vanden Eynden, Albert D. Otto, John A. Dossey, Lawrence E. Spence
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

Descripción del artículo del vendedor

Acerca de este vendedor

Outside Since

99,2% de votos positivos•5,4 mil artículos vendidos

Se unió el oct 2012
Registrado como vendedor particularPor tanto, no se aplican los derechos de los consumidores derivados de las leyes de protección de los consumidores de la UE. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más informaciónMás información
New Sports wear, Work wear and Outdoors wear Posted Daily!
Visitar tiendaContactar

Valoraciones detalladas sobre el vendedor

Promedio durante los últimos 12 meses
Descripción precisa
4.9
Gastos de envío razonables
4.8
Rapidez de envío
5.0
Comunicación
4.9

Votos de vendedor (1.758)

Todas las valoracionesselected
Positivas
Neutras
Negativas
Ver todos los votos