- Main
- Mathematics - Discrete Mathematics
- Introductory Discrete Mathematics
Introductory Discrete Mathematics
V. K . BalakrishnanAvez-vous aimé ce livre?
Quelle est la qualité du fichier téléchargé?
Veuillez télécharger le livre pour apprécier sa qualité
Quelle est la qualité des fichiers téléchargés?
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.
Catégories:
Année:
2010
Editeur::
Dover Publications
Langue:
english
Pages:
256
ISBN 10:
0486691152
ISBN 13:
9780486691152
Collection:
Dover Books on Computer Science
Fichier:
PDF, 5.16 MB
Vos balises:
IPFS:
CID , CID Blake2b
english, 2010
Le fichier sera envoyé à votre adresse de courriel dans 1 à 5 minutes.
Dans 1-5 minutes, le fichier sera delivré à votre compte Telegram.
Note : Assurez-vous que vous avez lié votre compte au bot Telegram de Z-Library.
Dans 1-5 minutes, le fichier sera delivré à votre appareil Kindle.
Remarque: vous devez valider chaque livre avant de l'envoyer à Kindle. Veuillez vérifier votre messagerie pour voir le mail avec la confirmation par Amazon Kindle Support.
La conversion en est effectuée
La conversion en a échoué
Avantages du statut Premium
- Envoyez aux e-lecteurs
- Limite de téléchargement augmentée
- Convertissez des fichiers
- Plus de résultats de recherche
- Autres avantages