Introductory Discrete Mathematics (Dover Books on Mathematics)
V. K . Balakrishnan
ISBN 10: 0486691152 ISBN 13: 9780486691152
Editore: Dover Pubns, 1996
Nuovi
Paperback
Da
Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 6 gennaio 2003
Questo articolo specifico non è più disponibile.
Riguardo questo articolo
Descrizione:
236 pages. 9.25x6.75x0.50 inches. In Stock. Codice articolo x-0486691152
Riassunto:
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.
Informazioni sull'autore:
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Dati bibliografici
Titolo: Introductory Discrete Mathematics (Dover ...
Casa editrice: Dover Pubns
Data di pubblicazione: 1996
Legatura: Paperback
Condizione: Brand New