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.
Altre 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: HPB-Red, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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! Codice articolo S_456973006
Compra usato
EUR 6,20
Spedizione EUR 3,23
Spedito in U.S.A.
Spedito in U.S.A.
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: Roundabout Books, Greenfield, MA, U.S.A.
Valutazione del venditore 4 su 5 stelle
paperback. Condizione: Near Fine. Condition Notes: Excellent, unmarked copy with little wear and tight binding. We ship in recyclable American-made mailers. 100% money-back guarantee on all orders. Codice articolo 1736052
Compra usato
EUR 10,07
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 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
Compra nuovo
EUR 15,82
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
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
Compra usato
EUR 16,97
Spedizione EUR 2,27
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Introductory Discrete Mathematics
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 438705-n
Compra nuovo
EUR 18,25
Spedizione EUR 2,27
Spedito in U.S.A.
Spedito in U.S.A.
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
Compra nuovo
EUR 20,60
Spedizione gratuita
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 2 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, Bensenville, IL, 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
Compra nuovo
EUR 22,28
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Introductory Discrete Mathematics
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo S1-9780486691152
Compra nuovo
EUR 18,44
Spedizione EUR 4,82
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 15 disponibili
Foto dell'editore
Introductory Discrete Mathematics (Dover Books on Computer Science)
Editore:
Dover Publications, Incorporated, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
Nuovo
Brossura
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 256. Codice articolo 6287428
Compra nuovo
EUR 20,68
Spedizione EUR 7,52
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 3 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
Compra nuovo
EUR 20,61
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.
Spedito da Irlanda a U.S.A.
Quantità: 3 disponibili