Introductory Discrete Mathematics (Dover Books on Computer Science) - Softcover
Book 3 of 19: Dover Books on Computer Science
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Introductory Discrete Mathematics (Dover Books on Computer...
Seller Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: Bay State Book Company, North Smithfield, RI, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing. Seller Inventory # BSM.16DC3
Stock Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: 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! Seller Inventory # S_456973006
Stock Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: Roundabout Books, Greenfield, MA, U.S.A.
Seller rating 4 out of 5 stars
paperback. Condition: 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. Seller Inventory # 1736052
Stock Image
Introductory Discrete Mathematics Format: Paperback
Seller: INDOO, Avenel, NJ, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Brand New. Seller Inventory # 9780486691152
Stock Image
Introductory Discrete Mathematics
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 438705
Stock Image
Introductory Discrete Mathematics
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 438705-n
Seller Image
Introductory Discrete Mathematics
Published by
Dover Publications Inc., US, 2000
ISBN 10: 0486691152
ISBN 13: 9780486691152
New
Paperback
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # LU-9780486691152
Buy New
US$ 23.24
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Seller Image
Introductory Discrete Mathematics (Paperback)
Published by
Dover Publications Inc., New York, 2000
ISBN 10: 0486691152
ISBN 13: 9780486691152
New
Paperback
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9780486691152
Stock Image
Introductory Discrete Mathematics
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # S1-9780486691152
Buy New
US$ 21.43
US$ 5.60 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available
Stock Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Published by
Dover Publications, Incorporated, 2010
ISBN 10: 0486691152
ISBN 13: 9780486691152
New
Softcover
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. pp. 256. Seller Inventory # 6287428
Buy New
US$ 23.33
US$ 8.74 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 3 available