Introductory Discrete Mathematics
V. K . Balakrishnan
Abr 2012 · Courier Corporation
3.0star
1 reviewreport
E-book
256
Mga Page
reportHindi na-verify ang mga rating at review Matuto Pa
Tungkol sa ebook na ito
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.
Mga rating at review
3.0
1 review
Tungkol sa may-akda
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
I-rate ang e-book na ito
Ipalaam sa amin ang iyong opinyon.
Impormasyon sa pagbabasa
Mga smartphone at tablet
I-install ang Google Play Books app para sa Android at iPad/iPhone. Awtomatiko itong nagsi-sync sa account mo at nagbibigay-daan sa iyong magbasa online o offline nasaan ka man.
Mga laptop at computer
Maaari kang makinig sa mga audiobook na binili sa Google Play gamit ang web browser ng iyong computer.
Mga eReader at iba pang mga device
Para magbasa tungkol sa mga e-ink device gaya ng mga Kobo eReader, kakailanganin mong mag-download ng file at ilipat ito sa iyong device. Sundin ang mga detalyadong tagubilin sa Help Center para mailipat ang mga file sa mga sinusuportahang eReader.
