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 13,28
EUR 2,26 per la spedizione in U.S.A.
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Introductory Discrete Mathematics
Foto dell'editore
Introductory Discrete Mathematics (Dover Books on Computer Science)
Editore:
Dover Publications, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Antico o usato
paperback
Da: Books Liquidation, Sacramento, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
paperback. Condizione: Good. Codice articolo 53IN3G003HMB
Quantità: 1 disponibili
Foto dell'editore
Introductory Discrete Mathemat
Editore:
Dover Publications, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Antico o usato
Brossura
Da: SecondSale, Montgomery, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Codice articolo 00089758304
Quantità: 1 disponibili
Foto dell'editore
Introductory Discrete Mathematics (Dover Books on Computer Science)
Editore:
Dover Publications, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Antico o usato
Paperback
Da: HPB-Ruby, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Codice articolo S_445836273
Quantità: 1 disponibili
Immagini fornite dal venditore
Introductory Discrete Mathematics
Editore:
Dover Publications, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Antico o usato
Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 438705
Quantità: 3 disponibili
Foto dell'editore
Introductory Discrete Mathematics (Dover Books on Computer Science)
Editore:
Dover Publications, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Antico o usato
Brossura
Da: Used Book Company, Egg Harbor Township, NJ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: LikeNew. Shows very minimal signs of wear and previous use. A portion of your purchase benefits nonprofits! - Note: Edition format may differ from what is shown in stock photo item details. May not include supplementary material (toys, access code, dvds, etc). Codice articolo 584XQ4000BSA_ns
Quantità: 1 disponibili
Immagini fornite dal venditore
Introductory Discrete Mathematics (Dover Books on Computer Science)
Editore:
Dover Publications, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Antico o usato
Brossura
Da: clickgoodwillbooks, Indianapolis, IN, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may be missing bundled media. Codice articolo 3O6JUN001MJX_ns
Quantità: 1 disponibili
Immagini fornite dal venditore
Introductory Discrete Mathematics
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 438705-n
Quantità: 3 disponibili
Foto dell'editore
Introductory Discrete Mathematics Format: Paperback
Da: INDOO, Avenel, NJ, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Brand New. Codice articolo 9780486691152
Quantità: Più di 20 disponibili
Foto dell'editore
Introductory Discrete Mathematics (Dover Books on Computer Science)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2215580230257
Quantità: 1 disponibili
Immagini fornite dal venditore
Introductory Discrete Mathematics (Paperback)
Editore:
Dover Publications Inc., New York, 2000
ISBN 10: 0486691152
ISBN 13: 9780486691152
Nuovo
Paperback
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9780486691152
Quantità: 1 disponibili