Discrete Mathematics by S. K. ChakrabortyDiscrete Mathematics by S. K. Chakraborty

Discrete Mathematics

byS. K. Chakraborty, B. K. Sarkar

Paperback | January 31, 2011

Pricing and Purchase Info

$36.95

Earn 185 plum® points
Quantity:

Ships within 1-3 weeks

Ships free on orders over $25

Not available in stores

about

Discrete Mathematics is designed to serve as a textbook for undergraduate engineering students of computer science and postgraduate students of Computer Applications. The book would also prove useful to post graduate students of mathematics. The book seeks to provide a thorough understandingof the subject and present its practical applications to computer science. Beginning with an overview of basic concepts like Sets, Relation and Functions, and Matrices, the book delves into core concepts of discrete mathematics like Combinatorics, Logic and Truth Tables, Groups, Order Relation and Lattices, Boolean Algebra, Trees, and Graphs. Special emphasis is also laidon certain advanced topics like Complexity and Formal Language and Automata. Algorithms and programmes have been used wherever required to illustrate the applications. Written in a simple, student-friendly style, the book provides numerous solved examples and chapter end exercises to help students apply the mathematical tools to computer-related concepts.
S.K. Chakraborty is currently Reader at the Department of Mathematics, BIT, Mesra, Ranchi. He holds a PhD in Applied Mathematics from Uppsala University, Sweden, and has over 15 years of academic experience. He has published several research papers in various journals of national and international repute. He is also a member of Indian...
Loading
Title:Discrete MathematicsFormat:PaperbackDimensions:552 pagesPublished:January 31, 2011Publisher:Oxford University PressLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0198065434

ISBN - 13:9780198065432

Reviews

Table of Contents

1. Set Relation Function2. Combinatorics3. Mathematical Logic4. Algebraic Structure5. Matrix Algebra6. Order Relation and Lattice7. Boolean Algebra8. Complexity9. Graph10. Tree11. Formal Language and AutomataAppendix 1References