Shipping Estimate
USA
- USA
- CAN
- USA
- CAN
Ships within 48 hours · Estimated delivery Jul 14 - Jul 19
Promo Codes Available:
For Your Every Summer RSVP, with Code: SUMMER15
Description
Introductory Discrete MathematicsThis 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
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.
Binding Type: Paperback
Publisher: Dover Publications
Published: 10/18/2010
ISBN: 9780486691152
Pages: 256
Weight: 0.85lbs
Size: 9.16h x 6.53w x 0.50d
Shipping Notes
- Free Standard Shipping on $100+ Orders to the USA.
- Except Preorder products are shipped in 48 hours.
- Delivery to the USA:
- Standard Shipping : 3-10 business days
- If time is of the essence, please consider selecting expedited delivery for faster service.
Exchange/Return Notes
- We offer a 30-day return/exchange service after receiving.
- Final sale items are not eligible for returns or exchanges.
- To process your return/exchange, please contact us at [email protected]
- Please click here for more details>>> Return & Exchange Policy
4.3 ★★★★★
Based on 1552 reviews
Sort
Product Reviews
★★★★★ 5
Excellent stylish organizer!
Excellent design and quality of material, practical and functional!
WAS THIS REVIEW HELPFUL?YesReportShare
Reviewed in the United States on October 1, 2025
★★★★★ 5
Love it
It looks good and is well made.
WAS THIS REVIEW HELPFUL?YesReportShare
Reviewed in the United States on November 2, 2025
★★★★★ 5
Bedside organizer
Perfect gift for my boyfriend. It is sturdy and is able to get all his stuff in it, they size is perfect it fits great on his nightstand stand, it was easy to use/organize all his stuff and it is light weight
WAS THIS REVIEW HELPFUL?YesReportShare
Reviewed in the United States on January 3, 2026
★★★★★ 4
Low quality leather
Good product but the leather is kinda cheap, already pealing back a little.
WAS THIS REVIEW HELPFUL?YesReportShare
Reviewed in the United States on August 8, 2025
★★★★★ 5
Great Organizer!
I use this next to my humidor to organize my EDC, lighters, and cutters for my cigars...right color and declutters this area.
WAS THIS REVIEW HELPFUL?YesReportShare
Reviewed in the United States on January 10, 2026