Sponsored
Introductory Discrete Mathematics - (Dover Books on Computer Science) by V K Balakrishnan (Paperback)
$14.99 sale price when purchased online
$20.00 list price
Target Online store #3991
About this item
Highlights
- This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics.
- About the Author: V. K. Balakrishnan is Professor Emeritus at the University of Maine.
- 256 Pages
- Mathematics, Discrete Mathematics
- Series Name: Dover Books on Computer Science
Description
About the Book
This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. It emphasizes combinatorics, graph theory with applications to some standard network optimization problems, and algorithms to solve these problems. Numerous exercises help students test their grasp of the material. 65 illustrations.Book 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.
About the Author
V. K. Balakrishnan is Professor Emeritus at the University of Maine.Dimensions (Overall): 9.16 Inches (H) x 6.53 Inches (W) x .5 Inches (D)
Weight: .85 Pounds
Suggested Age: 22 Years and Up
Number of Pages: 256
Genre: Mathematics
Sub-Genre: Discrete Mathematics
Series Title: Dover Books on Computer Science
Publisher: Dover Publications
Format: Paperback
Author: V K Balakrishnan
Language: English
Street Date: October 18, 2010
TCIN: 77718382
UPC: 9780486691152
Item Number (DPCI): 247-59-9625
Origin: Made in the USA or Imported
If the item details above aren’t accurate or complete, we want to know about it.
Shipping details
Estimated ship dimensions: 0.5 inches length x 6.53 inches width x 9.16 inches height
Estimated ship weight: 0.85 pounds
We regret that this item cannot be shipped to PO Boxes.
This item cannot be shipped to the following locations: American Samoa (see also separate entry under AS), Guam (see also separate entry under GU), Northern Mariana Islands, Puerto Rico (see also separate entry under PR), United States Minor Outlying Islands, Virgin Islands, U.S., APO/FPO
Return details
This item can be returned to any Target store or Target.com.
This item must be returned within 90 days of the date it was purchased in store, shipped, delivered by a Shipt shopper, or made ready for pickup.
See the return policy for complete information.