Discrete Mathematics and Combinatorics
Discrete Mathematics and Combinatorics provides a concise and practical introduction to the core components of discrete mathematics, featuring a balanced mix of basic theories and applications. The book covers both fundamental concepts such as sets and logic, as well as advanced topics such as graph theory and Turing machines. The example-driven approach will help readers in understanding and applying the concepts. Other pedagogical tools—illustrations, practice questions, and suggested reading—facilitate learning and mastering the subject.
Table of Content
- Equations, Inequalities and Basic Logic
- Sets, Functions and Relations
- Logic
- Permutations and Combinations
- Mathematical Induction, Principle of Inclusion and Exclusion and Pigeon Hole Principle
- Recurrence Relations
- Number Theory
- Groups, Rings and Fields
- Graph Theory
- Posets, Lattices and Boolean Algebras
- Formal Languages and Language Acceptors
- Turing Machines and Computable Functions
- Coding Theory
- Discrete Probability
|
Salient Features
- Mathematical concepts explained in a simple and understandable form.
- Well-structured organization of chapters, moving from simple to complex.
- Numerous worked examples and illustrations to introduce concepts
- A rich and varied set of practice questions to reinforce the concepts.
- Appendices on mathematical prerequisites— trigonometry, matrices and basic algebra.
|
|
|
|
|