-500x500.jpg "Discrete Mathematics for Computer Science")
Discrete Mathematics for Computer Science
- Author R.S. Salaria
- ISBN: 978-93-9254-911-3
- ₹ 369.00
-
₹ 295.20
| Book Detail | |
| Category | B.Tech |
| What's special / Useful in this book | Key Features • Suitable for a variety of courses for students in both Mathematics and Computer Science. • Extensive, in-depth coverage of classical logic, combined with a solid exposition of a selection of the most important fields of discrete mathematics. • Concise, clear and uncluttered presentation with numerous examples. • Numerous solved problems and practice problems to throw intellectual challenges. • Numerous multiple choice questions to assess your grasping of the subject. |
| ISBN-13 | 978-93-9254-911-3 |
| ASIN | 92549113 |
| Edition | 1st |
| Pages | 398 |
| Preface | |
| Preface | This textbook aims mainly at undergraduate courses for students in Mathematics and Computer Science, but the book will also be a valuable resource for postgraduate students and for self-study. The main areas of study are set, relations, functions, combinatorics, recurrence relations, groups and monoids, and graph theory, in that order. Keeping in mind the requirements of the 21" Century, and the academic background of the students, special care has been taken to keep the language simple and lucid, and to provide illustrative examples to empower an average reader to grasp the subject matter with quite an ease. |
| Table of Contents | |
| Table of Contents | Chapter 1: Sets Chapter 2: Relations Chapter 3: Functions Chapter 4: Boolean Algebra Chapter 5: Combinatorial Mathematics Chapter 6: Recurrence Relations and Generating Functions Chapter 7: Groups and Monoids Chapter 8: Rings and Fields Chapter 9: Graph Theory |