Introductory Discrete Mathematics
V. K . Balakrishnan
2012 අප්‍රේල් · Courier Corporation
3.0star
සමාලෝචන 1ක්report
ඉ-පොත
256
පිටු
reportඇගයීම් සහ සමාලෝචන සත්‍යාපනය කර නැත වැඩිදුර දැන ගන්න
මෙම ඉ-පොත ගැන
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.
ඇගයීම් සහ සමාලෝචන
3.0
1 සමාලෝචනයක්
කර්තෘ පිළිබඳ
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
මෙම ඉ-පොත අගයන්න
ඔබ සිතන දෙය අපට කියන්න.
කියවීමේ තොරතුරු
ස්මාර්ට් දුරකථන සහ ටැබ්ලට්
Android සහ iPad/iPhone සඳහා Google Play පොත් යෙදුම ස්ථාපනය කරන්න. එය ඔබේ ගිණුම සමඟ ස්වයංක්‍රීයව සමමුහුර්ත කරන අතර ඔබට ඕනෑම තැනක සිට සබැඳිව හෝ නොබැඳිව කියවීමට ඉඩ සලසයි.
ලැප්ටොප් සහ පරිගණක
ඔබට ඔබේ පරිගණකයේ වෙබ් බ්‍රව්සරය භාවිතයෙන් Google Play මත මිලදී ගත් ශ්‍රව්‍යපොත්වලට සවන් දිය හැක.
eReaders සහ වෙනත් උපාංග
Kobo eReaders වැනි e-ink උපාංග පිළිබඳ කියවීමට, ඔබ විසින් ගොනුවක් බාගෙන ඔබේ උපාංගයට එය මාරු කිරීම සිදු කළ යුතු වේ. ආධාරකරු ඉ-කියවනයට ගොනු මාරු කිරීමට විස්තරාත්මක උදවු මධ්‍යස්ථාන උපදෙස් අනුගමනය කරන්න.
