Verwandte Artikel zu Introductory Discrete Mathematics (Dover Books on Mathematic...
Introductory Discrete Mathematics (Dover Books on Mathematics) - Softcover
Buch 3 von 19: Dover Books on Computer Science
Inhaltsangabe
This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.
Chapters 0&;3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material.
Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization &; the minimal spanning tree problem and the shortest distance problem &; are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix.
Chapters 0&;3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material.
Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph coloring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization &; the minimal spanning tree problem and the shortest distance problem &; are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Introductory Discrete Mathematics (Dover Books on Mathematic...
Beispielbild für diese ISBN
Introductory Discrete Mathematics (Dover Books on Computer Science)
Anbieter: HPB-Red, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Bestandsnummer des Verkäufers S_460728475
Gebraucht kaufen
EUR 6,28
EUR 3,21 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Foto des Verkäufers
Introductory Discrete Mathematics (Dover Books on Computer Science)
Anbieter: Goodwill of Central and Coastal Virginia, Richmond, VA, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: acceptable. Bestandsnummer des Verkäufers CCVV.0486691152.A
Gebraucht kaufen
EUR 8,33
EUR 4,92 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Introductory Discrete Mathematics
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 438705
Gebraucht kaufen
EUR 12,69
EUR 2,26 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Introductory Discrete Mathematics (Dover Books on Computer Science)
Anbieter: Lakeside Books, Benton Harbor, MI, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books! Bestandsnummer des Verkäufers OTF-S-9780486691152
Neu kaufen
EUR 11,92
EUR 3,42 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: 3 verfügbar
Foto des Verkäufers
Introductory Discrete Mathematics
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 438705-n
Neu kaufen
EUR 13,10
EUR 2,26 Versand
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Introductory Discrete Mathematics
Anbieter: Rarewaves USA, OSWEGO, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. Geared toward mathematics and computer science majors, it emphasizes applications, offering more than 200 exercises to help students test their grasp of the material and providing answers to selected exercises. 1991 edition. Bestandsnummer des Verkäufers LU-9780486691152
Beispielbild für diese ISBN
Introductory Discrete Mathematics Format: Paperback
Anbieter: INDOO, Avenel, NJ, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Brand New. Bestandsnummer des Verkäufers 9780486691152
Neu kaufen
EUR 15,74
Versand gratis
Versand innerhalb von USA
Versand innerhalb von USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Introductory Discrete Mathematics (Paperback or Softback)
Verlag:
Dover Publications 10/18/2010, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Neu
Paperback or Softback
Anbieter: BargainBookStores, Grand Rapids, MI, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback or Softback. Zustand: New. Introductory Discrete Mathematics. Book. Bestandsnummer des Verkäufers BBS-9780486691152
Beispielbild für diese ISBN
Introductory Discrete Mathematics (Dover Books on Computer Science)
Anbieter: California Books, Miami, FL, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers I-9780486691152
Foto des Verkäufers
Introductory Discrete Mathematics (Paperback)
Verlag:
Dover Publications Inc., New York, 2000
ISBN 10: 0486691152
ISBN 13: 9780486691152
Neu
Paperback
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: new. Paperback. This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.Chapters 0-3 cover fundamental operations involving sets and the principle of mathematical induction, and standard combinatorial topics: basic counting principles, permutations, combinations, the inclusion-exclusion principle, generating functions, recurrence relations, and an introduction to the analysis of algorithms. Applications are emphasized wherever possible and more than 200 exercises at the ends of these chapters help students test their grasp of the material. Chapters 4 and 5 survey graphs and digraphs, including their connectedness properties, applications of graph colouring, and more, with stress on applications to coding and other related problems. Two important problems in network optimization - the minimal spanning tree problem and the shortest distance problem - are covered in the last two chapters. A very brief nontechnical exposition of the theory of computational complexity and NP-completeness is outlined in the appendix. This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9780486691152