Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Introductory Discrete Mathematics

by V. K. Balakrishnan
Save 35% Save 35%
Current price ₹1,235.00
Original price ₹1,899.00
Original price ₹1,899.00
Original price ₹1,899.00
(-35%)
₹1,235.00
Current price ₹1,235.00

Ships in 4-7 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9780486691152
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Dover Publications
  • Publisher Imprint: Dover Publications
  • Publication Date:
  • Pages: 256
  • Original Price: INR 1899.0
  • Language: English
  • Edition: N/A
  • Item Weight: 386 grams
  • BISAC Subject(s): Discrete Mathematics

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.

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

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us