- Main
- Mathematics - Discrete Mathematics
- Introductory Discrete Mathematics
Introductory Discrete Mathematics
V. K . Balakrishnanكم أعجبك هذا الكتاب؟
ما هي جودة الملف الذي تم تنزيله؟
قم بتنزيل الكتاب لتقييم الجودة
ما هي جودة الملفات التي تم تنزيلها؟
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.
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.
عام:
2010
الناشر:
Dover Publications
اللغة:
english
الصفحات:
256
ISBN 10:
0486691152
ISBN 13:
9780486691152
سلسلة الكتب:
Dover Books on Computer Science
ملف:
PDF, 5.16 MB
الشعارات الخاصة بك:
IPFS:
CID , CID Blake2b
english, 2010
سيتم إرسال الملف إلى عنوان بريدك الإلكتروني. قد يستغرق الأمر ما يصل إلى 1-5 دقائق قبل استلامه.
في غضون 1-5 دقائق ، سيتم تسليم الملف إلى حساب Telegram الخاص بك.
برجاء الإنتباه: تأكد من ربط حسابك ببوت Z-Library Telegram.
في غضون 1-5 دقائق ، سيتم تسليم الملف إلى جهاز Kindle الخاص بك.
ملاحظة: أنت بحاجة للتحقق من كل كتاب ترسله إلى Kindle. تحقق من صندوق بريدك الإلكتروني بحثًا عن رسالة تأكيد بالبريد الإلكتروني من Amazon Kindle Support.
جاري التحويل إلى
التحويل إلى باء بالفشل
مميزات الحساب المميز
- أرسل إلى القراء الإلكترونيين
- زيادة حد التنزيل
- حول الملفات
- المزيد من نتائج البحث
- مميزات أخري