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.
"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.
- PublisherDover Publications
- Publication date2010
- ISBN 10 0486691152
- ISBN 13 9780486691152
- BindingPaperback
- LanguageEnglish
- Number of pages256
- Rating
Other Popular Editions of the Same Title
Search results for Introductory Discrete Mathematics (Dover Books on Computer...
Stock Image
Introductory Discrete Mathemat
Seller: SecondSale, Montgomery, IL, U.S.A.
Seller rating 5 out of 5 stars
Condition: Very Good. Very Good. Seller Inventory # 00081327262
Quantity: 1 available
Stock Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: Book Deals, Tucson, AZ, U.S.A.
Seller rating 5 out of 5 stars
Condition: Fair. Acceptable/Fair condition. Book is worn, but the pages are complete, and the text is legible. Has wear to binding and pages, may be ex-library. 0.7. Seller Inventory # 353-0486691152-acp
Quantity: 1 available
Seller Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: Goodwill of Greater Milwaukee and Chicago, Racine, WI, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. Book is considered to be in good or better condition. The actual cover image may not match the stock photo. Hard cover books may show signs of wear on the spine, cover or dust jacket. Paperback book may show signs of wear on spine or cover as well as having a slight bend, curve or creasing to it. Book should have minimal to no writing inside and no highlighting. Pages should be free of tears or creasing. Stickers should not be present on cover or elsewhere, and any CD or DVD expected with the book is included. Book is not a former library copy. Seller Inventory # SEWV.0486691152.G
Quantity: 1 available
Seller Image
Introductory Discrete Mathematics
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 4 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 438705
Quantity: 3 available
Seller Image
Introductory Discrete Mathematics
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 438705-n
Quantity: 3 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: GF Books, Inc., Hawthorne, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Book is in NEW condition. 0.7. Seller Inventory # 0486691152-2-1
Quantity: 1 available
Stock Image
Introductory Discrete Mathematics (Dover Books on Computer Science)
Seller: Book Deals, Tucson, AZ, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. New! This book is in the same immaculate condition as when it was published 0.7. Seller Inventory # 353-0486691152-new
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, Fairfield, 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