Introductory Discrete Mathematics
$20.00
1 in stock
Refresh Stock LevelInformation
Shipping
We currently offer free shipping on all orders over $100. Standard media mail shipping is $5 plus $1 for each additional book. Electronics are $35 shipping on all items.
Books
We get our books from a national distributor and although we strive to present up to date stock counts, stock constantly fluctuates. We perform a stock check when you add your book to the cart to ensure that it is available for shipping from the distributor. You can also check stock status by clicking the refresh stock link on the product page for the most up to date stock at the distributor. If an item is on backorder, you may place an order and we will update you on the estimated ship date as soon as we can confirm with the distributor.
Return & exchange
If you are not satisfied with your purchase you can return it to us within 14 days for an exchange or refund. More info.
Assistance
Can’t find what you’re looking for? We have access to over 13 million titles, reach out and see if we can help!
Contact us on (575) 322-6867, or email us at [email protected].
| Weight | 0.85 lbs |
|---|---|
| Dimensions | 9.16 × 6.53 × 0.5 in |
Description
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.
Dover Publications
Reviews
There are no reviews yet.