Π ΠΎΠ²ΠΎΡ Π΅-ΠΊΡΠΈΠ·ΠΈ
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 ΠΊΡΠΈΠ³Π΅ Π·Π° Android ΠΈ iPad/iPhone. ΠΡΡΠΎΠΌΠ°ΡΡΠΊΠΈ ΡΠ΅ ΡΠΈΠ½Ρ
ΡΠΎΠ½ΠΈΠ·ΡΡΠ΅ ΡΠ° Π½Π°Π»ΠΎΠ³ΠΎΠΌ ΠΈ ΠΎΠΌΠΎΠ³ΡΡΠ°Π²Π° Π²Π°ΠΌ Π΄Π° ΡΠΈΡΠ°ΡΠ΅ ΠΎΠ½Π»Π°ΡΠ½ ΠΈ ΠΎΡΠ»Π°ΡΠ½ Π³Π΄Π΅ Π³ΠΎΠ΄ Π΄Π° ΡΠ΅ Π½Π°Π»Π°Π·ΠΈΡΠ΅.
ΠΠ°ΠΏΡΠΎΠΏΠΎΠ²ΠΈ ΠΈ ΡΠ°ΡΡΠ½Π°ΡΠΈ
ΠΠΎΠΆΠ΅ΡΠ΅ Π΄Π° ΡΠ»ΡΡΠ°ΡΠ΅ Π°ΡΠ΄ΠΈΠΎ-ΠΊΡΠΈΠ³Π΅ ΠΊΡΠΏΡΠ΅Π½Π΅ Π½Π° Google Play-Ρ ΠΏΠΎΠΌΠΎΡΡ Π²Π΅Π±-ΠΏΡΠ΅Π³Π»Π΅Π΄Π°ΡΠ° Π½Π° ΡΠ°ΡΡΠ½Π°ΡΡ.
Π-ΡΠΈΡΠ°ΡΠΈ ΠΈ Π΄ΡΡΠ³ΠΈ ΡΡΠ΅ΡΠ°ΡΠΈ
ΠΠ° Π±ΠΈΡΡΠ΅ ΡΠΈΡΠ°Π»ΠΈ Π½Π° ΡΡΠ΅ΡΠ°ΡΠΈΠΌΠ° ΠΊΠΎΡΠ΅ ΠΊΠΎΡΠΈΡΡΠ΅ Π΅-ΠΌΠ°ΡΡΠΈΠ»ΠΎ, ΠΊΠ°ΠΎ ΡΡΠΎ ΡΡ Kobo Π΅-ΡΠΈΡΠ°ΡΠΈ, ΡΡΠ΅Π±Π° Π΄Π° ΠΏΡΠ΅ΡΠ·ΠΌΠ΅ΡΠ΅ ΡΠ°ΡΠ» ΠΈ ΠΏΡΠ΅Π½Π΅ΡΠ΅ΡΠ΅ Π³Π° Π½Π° ΡΡΠ΅ΡΠ°Ρ. ΠΡΠ°ΡΠΈΡΠ΅ Π΄Π΅ΡΠ°ΡΠ½Π° ΡΠΏΡΡΡΡΠ²Π° ΠΈΠ· ΡΠ΅Π½ΡΡΠ° Π·Π° ΠΏΠΎΠΌΠΎΡ Π΄Π° Π±ΠΈΡΡΠ΅ ΠΏΡΠ΅Π½Π΅Π»ΠΈ ΡΠ°ΡΠ»ΠΎΠ²Π΅ Ρ ΠΏΠΎΠ΄ΡΠΆΠ°Π½Π΅ Π΅-ΡΠΈΡΠ°ΡΠ΅.
