Articoli correlati a Introductory Discrete Mathematics
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 17,92
EUR 3,41 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Introductory Discrete Mathematics
Immagini fornite dal venditore
Introductory Discrete Mathematics
Editore:
Dover Publications Inc., US, 2000
ISBN 10: 0486691152
ISBN 13: 9780486691152
Nuovo
Paperback
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9780486691152
Quantità: 3 disponibili
Immagini fornite dal venditore
Introductory Discrete Mathematics
Editore:
Dover Publications Inc., US, 2000
ISBN 10: 0486691152
ISBN 13: 9780486691152
Nuovo
Paperback
Da: Rarewaves USA United, OSWEGO, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9780486691152
Quantità: 3 disponibili
Immagini fornite dal venditore
Introductory Discrete Mathematics
Editore:
Dover Publications Inc., US, 2000
ISBN 10: 0486691152
ISBN 13: 9780486691152
Nuovo
Paperback
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9780486691152
Quantità: 3 disponibili
Immagini fornite dal venditore
Introductory Discrete Mathematics (Paperback or Softback)
Editore:
Dover Publications 10/18/2010, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Nuovo
Paperback or Softback
Da: BargainBookStores, Grand Rapids, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback or Softback. Condizione: New. Introductory Discrete Mathematics 0.85. Book. Codice articolo BBS-9780486691152
Quantità: 3 disponibili
Foto dell'editore
Introductory Discrete Mathematics (Dover Books on Computer Science)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9780486691152
Quantità: 8 disponibili
Foto dell'editore
Introductory Discrete Mathematics
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
Condizione: New. Series: Dover Books on Computer Science. Num Pages: 256 pages, 65ill. BIC Classification: PDE; TBJ. Category: (G) General (US: Trade). Dimension: 160 x 236 x 15. Weight in Grams: 364. . 2010. Paperback. . . . . Codice articolo V9780486691152
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Introductory Discrete Mathematics
Editore:
Dover Publications Inc., US, 2000
ISBN 10: 0486691152
ISBN 13: 9780486691152
Nuovo
Paperback
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo LU-9780486691152
Quantità: 3 disponibili
Foto dell'editore
Introductory Discrete Mathematics (Dover Books on Computer Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780486691152_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Introductory Discrete Mathematics
Editore:
Dover Publications, Inc, Garden City, 1996
ISBN 10: 0486691152
ISBN 13: 9780486691152
Antico o usato
Paperback
Da: San Francisco Book Company, Paris, Francia
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very good. Paperback Octavo. wraps, 236 pp Standard shipping (no tracking or insurance) / Priority (with tracking) / Custom quote for large or heavy orders. Codice articolo 106440
Quantità: 1 disponibili
Foto dell'editore
Introductory Discrete Mathematics
Editore:
Dover Publications Inc., 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days. 388. Codice articolo B9780486691152
Quantità: 7 disponibili