Discrete Mathematics: A Concept-Based Approach

Contents: Foreword. Preface. 1. Overview of Disciplines in Mathematics. 2. Fundamentals of Mathematical Logic. 3. Mathematical Induction. 4. Introduction to Set Theory. 5. Relations and Operations. 6. General Functions and Growth Functions. 7. Algebraic Structures. 8. Coding Theory. 9. Fundamentals of Counting Principles. 10. Introduction to Probability. 11. Finite State Machine. 12. Introduction to Recurrence Relations. 13. Introduction to Graph Theory. Bibliography. Index. Discrete Mathematics A Concept-based Approach focuses on the applications of discrete mathematical concepts to real-life scenarios and makes the subject appealing to the student. It caters to the syllabus requirement of students of mathematics and computer science at the undergraduate and postgraduate levels in distinguished engineering colleges. The flow of the topics is gradual and designed to lead the students step by step from the first principles to the advanced topics. The sequencing of the book s contents reflect the order and manner in which the subject in normally approached in the classroom. Each topic is supported by appropriate examples from computer science to showcase the application of discrete mathematics in the field of computers. This book can also be used as a foundation course for studying advanced mathematical concepts. PowerPoint slides that encapsulate the essential points of each chapter, solutions to chapter-end exercises and solved university question papers are available as online supplements that can be accessed at . (jacket).…