Items related to Introductory Discrete Mathematics (Dover Books on Computer...
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...
Stock Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: Books Liquidation, Sacramento, CA, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Good. Seller Inventory # 53IN3G003HMB
Quantity: 1 available
Seller Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: clickgoodwillbooks, Indianapolis, IN, U.S.A.
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 3O6JUN001MJX_ns
Quantity: 1 available
Stock Image
Introductory Discrete Mathemat
Seller: SecondSale, Montgomery, IL, U.S.A.
Seller rating 5 out of 5 stars
Condition: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Seller Inventory # 00092598121
Quantity: 2 available
Stock Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: Used Book Company, Egg Harbor Township, NJ, U.S.A.
Seller rating 5 out of 5 stars
Condition: 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). Seller Inventory # 584XQ4000BSA_ns
Quantity: 1 available
Seller 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
Quantity: 2 available
Seller Image
Introductory Discrete Mathematics
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 438705-n
Quantity: 2 available
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
Quantity: Over 20 available
Stock Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: gwdetroit, Detroit, MI, U.S.A.
Seller rating 3 out of 5 stars
Condition: Good. This Book is in GOOD condition. It is perfectly readable with cosmetic issues. It may have curled corners or stickers on the cover. The pages are clean, but may include light highlighting. Buyer should assume that no extra materials such as codes or disks will be included. The cover is like new! WE DO NOT SELL TOYS! Fast Shipping - Safe and Secure Bubble Mailer! Thank you for supporting Goodwill Detroit! Seller Inventory # 4HQRTM001P69
Quantity: 1 available
Stock Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2215580230257
Quantity: 1 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, Mason, OH, 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
Quantity: 1 available