Title
Introductory Discrete Mathematics (Dover Books On Computer Science),New
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
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 03 Cover Fundamental Operations Involving Sets And The Principle Of Mathematical Induction, And Standard Combinatorial Topics: Basic Counting Principles, Permutations, Combinations, The Inclusionexclusion 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 Npcompleteness Is Outlined In The Appendix.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: How many pages does this book have? A: This book has two hundred fifty-six pages. It provides a comprehensive introduction to discrete mathematics.
- Q: What is the binding type of this book? A: This book is available in paperback binding. This makes it lightweight and easy to handle for students.
- Q: What are the dimensions of this book? A: The book measures six point five four inches in length, zero point five one inches in width, and nine point one seven inches in height. These dimensions make it portable and convenient for study.
- Q: What topics are covered in this book? A: The book covers combinatorics, graph theory, and algorithms among other discrete mathematics topics. It emphasizes applications to computer science and mathematics.
- Q: Who is the author of this book? A: The author of this book is V. K. Balakrishnan. He is known for his contributions to mathematics education.
- Q: Is this book suitable for beginners? A: Yes, this book is suitable for beginners in discrete mathematics. It is designed for undergraduate students new to the subject.
- Q: How can I apply the concepts learned from this book? A: You can apply the concepts from this book in computer science and mathematical problem-solving. It provides practical examples and exercises.
- Q: Are there exercises included in this book? A: Yes, there are more than two hundred exercises at the end of the chapters. These exercises help reinforce the learning material.
- Q: What is the focus of the chapters in this book? A: The chapters focus on mathematical induction, combinatorial topics, and graph theory applications. This approach aids in understanding the interplay of mathematics and computer science.
- Q: Can this book help with understanding network optimization? A: Yes, the book includes sections on network optimization problems, such as minimal spanning trees and shortest distance problems. These are crucial for practical applications.
- Q: Does this book discuss computational complexity? A: Yes, there is a brief exposition of computational complexity and NP-completeness in the appendix. This provides insights into advanced topics.
- Q: Is there any emphasis on applications in this book? A: Yes, applications are emphasized throughout the book. It connects theoretical concepts with real-world scenarios.
- Q: What is the genre of this book? A: This book falls under the category of applied mathematics. It focuses on practical applications of discrete mathematics.
- Q: What kind of exercises does this book offer? A: The book offers a variety of exercises, including problem-solving and theoretical questions. These are designed to test comprehension of the material.
- Q: Is this book recommended for mathematics educators? A: Yes, this book is highly recommended for mathematics educators. It provides essential content for teaching discrete mathematics effectively.