ΠΠ° Π΅-ΠΊΠ½ΠΈΠ³Π°Π²Π°
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.
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 algebrai...
ΠΡΠΊΡΠΈΡΡΠ΅ ΠΏΠΎΠ²Π΅ΡΠ΅
ΠΡΠ΅Π½ΠΈ ΠΈ ΡΠ΅ΡΠ΅Π½Π·ΠΈΠΈ
1 ΡΠ΅ΡΠ΅Π½Π·ΠΈΡΠ°
ΠΠ° Π°Π²ΡΠΎΡΠΎΡ
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
ΠΡΠ΅Π½Π΅ΡΠ΅ ΡΠ° Π΅-ΠΊΠ½ΠΈΠ³Π°Π²Π°
ΠΠ°ΠΆΠ΅ΡΠ΅ Π½ΠΈ ΡΡΠΎ ΠΌΠΈΡΠ»ΠΈΡΠ΅.
ΠΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΈ Π·Π° ΡΠΈΡΠ°ΡΠ΅
ΠΠ°ΠΌΠ΅ΡΠ½ΠΈ ΡΠ΅Π»Π΅ΡΠΎΠ½ΠΈ ΠΈ ΡΠ°Π±Π»Π΅ΡΠΈ
ΠΠ½ΡΡΠ°Π»ΠΈΡΠ°ΡΡΠ΅ ΡΠ° Π°ΠΏΠ»ΠΈΠΊΠ°ΡΠΈΡΠ°ΡΠ° Google Play Books Π·Π° Android ΠΈ iPad/iPhone. ΠΠ²ΡΠΎΠΌΠ°ΡΡΠΊΠΈ ΡΠ΅ ΡΠΈΠ½Ρ
ΡΠΎΠ½ΠΈΠ·ΠΈΡΠ° ΡΠΎ ΡΠΌΠ΅ΡΠΊΠ°ΡΠ° ΠΈ Π²ΠΈ ΠΎΠ²ΠΎΠ·ΠΌΠΎΠΆΡΠ²Π° Π΄Π° ΡΠΈΡΠ°ΡΠ΅ ΠΎΠ½Π»Π°ΡΠ½ ΠΈΠ»ΠΈ ΠΎΡΠ»Π°ΡΠ½ ΠΊΠ°Π΄Π΅ ΠΈ Π΄Π° ΡΡΠ΅.
ΠΠ°ΠΏΡΠΎΠΏΠΈ ΠΈ ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠΈ
ΠΠΎΠΆΠ΅ Π΄Π° ΡΠ»ΡΡΠ°ΡΠ΅ Π°ΡΠ΄ΠΈΠΎΠΊΠ½ΠΈΠ³ΠΈ ΠΊΡΠΏΠ΅Π½ΠΈ ΠΎΠ΄ Google Play ΡΠΎ ΠΊΠΎΡΠΈΡΡΠ΅ΡΠ΅ Π½Π° Π²Π΅Π±-ΠΏΡΠ΅Π»ΠΈΡΡΡΠ²Π°ΡΠΎΡ Π½Π° ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠΎΡ.
Π-ΡΠΈΡΠ°ΡΠΈ ΠΈ Π΄ΡΡΠ³ΠΈ ΡΡΠ΅Π΄ΠΈ
ΠΠ° Π΄Π° ΡΠΈΡΠ°ΡΠ΅ Π½Π° ΡΡΠ΅Π΄ΠΈ ΡΠΎ Π΅-ΠΌΠ°ΡΡΠΈΠ»ΠΎ, ΠΊΠ°ΠΊΠΎ ΡΡΠΎ ΡΠ΅ Π΅-ΡΠΈΡΠ°ΡΠΈΡΠ΅ Kobo, ΡΠ΅ ΡΡΠ΅Π±Π° Π΄Π° ΠΏΡΠ΅Π·Π΅ΠΌΠ΅ΡΠ΅ Π΄Π°ΡΠΎΡΠ΅ΠΊΠ° ΠΈ Π΄Π° ΡΠ° ΠΏΡΠ΅ΡΡΠ»ΠΈΡΠ΅ Π½Π° ΡΡΠ΅Π΄ΠΎΡ. Π‘Π»Π΅Π΄Π΅ΡΠ΅ Π³ΠΈ Π΄Π΅ΡΠ°Π»Π½ΠΈΡΠ΅ ΡΠΏΠ°ΡΡΡΠ²Π° Π²ΠΎ Π¦Π΅Π½ΡΠ°ΡΠΎΡ Π·Π° ΠΏΠΎΠΌΠΎΡ Π·Π° ΠΏΡΠ΅ΡΡΠ»Π°ΡΠ΅ Π½Π° Π΄Π°ΡΠΎΡΠ΅ΠΊΠΈΡΠ΅ Π½Π° ΠΏΠΎΠ΄Π΄ΡΠΆΠ°Π½ΠΈ Π΅-ΡΠΈΡΠ°ΡΠΈ.
