Buy Introductory Discrete Mathematics - (Dover Books on Computer Science) by V K Balakrishnan (Paperback) in United States - Cartnear.com

Introductory Discrete Mathematics - (Dover Books on Computer Science) by V K Balakrishnan (Paperback)

CTNR4277 09780486691152 CTNR4277

Fujitsu

Fujitsu
2024-02-02 USD 15.24

$ 15.24 $ 15.39

Item Added to Cart

*Product availability is subject to suppliers inventory

Introductory Discrete Mathematics - (Dover Books on Computer Science) by  V K Balakrishnan (Paperback)
SHIPPING ALL OVER UNITED STATES
Introductory Discrete Mathematics - (Dover Books on Computer Science) by  V K Balakrishnan (Paperback)
100% MONEY BACK GUARANTEE
Introductory Discrete Mathematics - (Dover Books on Computer Science) by  V K Balakrishnan (Paperback)
EASY 30 DAYSRETURNS & REFUNDS
Introductory Discrete Mathematics - (Dover Books on Computer Science) by  V K Balakrishnan (Paperback)
24/7 CUSTOMER SUPPORT
Introductory Discrete Mathematics - (Dover Books on Computer Science) by  V K Balakrishnan (Paperback)
TRUSTED AND SAFE WEBSITE
Introductory Discrete Mathematics - (Dover Books on Computer Science) by  V K Balakrishnan (Paperback)
100% SECURE CHECKOUT
Number of Pages: 256
Genre: Mathematics
Sub-Genre: Discrete Mathematics
Series Title: Dover Books on Computer Science
Format: Paperback
Publisher: Dover Publications
Age Range: Adult
Author: V K Balakrishnan
Language: English



About the Book



This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. It emphasizes combinatorics, graph theory with applications to some standard network optimization problems, and algorithms to solve these problems. Numerous exercises help students test their grasp of the material. 65 illustrations.



Book Synopsis



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.



About the Author



V. K. Balakrishnan is Professor Emeritus at the University of Maine.

Related Products

See More

You May Also Like

See More