Introductory Discrete Mathematics
V. K . Balakrishnan
04/2012 · Courier Corporation
3,0star
1 críticareport
Livro eletrónico
256
Páginas
reportAs classificações e as críticas não são validadas Saiba mais
Acerca deste livro eletrónico
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.
Classificações e críticas
3,0
1 crítica
Acerca do autor
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
Classifique este livro eletrónico
Dê-nos a sua opinião.
Informações de leitura
Smartphones e tablets
Instale a app Google Play Livros para Android e iPad/iPhone. A aplicação é sincronizada automaticamente com a sua conta e permite-lhe ler online ou offline, onde quer que esteja.
Portáteis e computadores
Pode ouvir audiolivros comprados no Google Play através do navegador de Internet do seu computador.
eReaders e outros dispositivos
Para ler em dispositivos e-ink, como e-readers Kobo, tem de transferir um ficheiro e movê-lo para o seu dispositivo. Siga as instruções detalhadas do Centro de Ajuda para transferir os ficheiros para os e-readers suportados.
