Sobre aquest llibre
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...
Descobreix-ne més
Puntuacions i ressenyes
1 ressenya
Sobre l'autor
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
Puntua aquest llibre electrònic
Dona'ns la teva opinió.
Informació de lectura
Telèfons intel·ligents i tauletes
Instal·la l'aplicació Google Play Llibres per a Android i per a iPad i iPhone. Aquesta aplicació se sincronitza automàticament amb el compte i et permet llegir llibres en línia o sense connexió a qualsevol lloc.
Ordinadors portàtils i ordinadors de taula
Pots escoltar els audiollibres que has comprat a Google Play amb el navegador web de l'ordinador.
Lectors de llibres electrònics i altres dispositius
Per llegir en dispositius de tinta electrònica, com ara lectors de llibres electrònics Kobo, hauràs de baixar un fitxer i transferir-lo al dispositiu. Segueix les instruccions detallades del Centre d'ajuda per transferir els fitxers a lectors de llibres electrònics compatibles.
