Design and Analysis of Algorithms
Design and Analysis of Algorithms
This book offers an in-depth exploration of designing and analysing algorithms. It covers topics such as algorithmic analysis, design principles, theoretical proofs, and practical applications. The content includes a logical example explaining the concepts, accompanied by a diverse range of solved and unsolved problems. Each problem is accompanied by step-by-step solutions, providing readers with a comprehensive understanding of algorithmic design and analysis. With its systematic approach, programming-based solutions, and thorough examples, this book serves as an ideal resource for those curious to learn basic to high level concept of algorithm design.
Salient Features:
- Content of the book aligned with the mapping of Course Outcomes, Programs Outcomes and Unit Outcomes.
- In the beginning of each unit learning outcomes are listed to make the student understand what is expected of him/ her after completing that unit.
- Book provides lots of recent information, interesting facts, logical examples, and solved programming exercises. Theorems and their proofs are added to provide detailed insight of analysis.
- Student and teacher centric subject material included in book in balanced and chronological manner.
- Figures, tables, and image-based elaborate examples are inserted to improve clarity of the topics. Salient Features:
- Short and long answer questions are given for practice of students after every chapter for practice of students after every chapter.
- Solved and Unsolved programming exercises are included in the appendix of the book.
- QR Code at the start of every chapter provide convenient access to electronic resources, including solutions to programming problems, discussions on key concepts, and project topics for students
- Foreword
- Acknowledgement
- Preface
- Outcome Based Education
- Course Outcomes
- Guidelines for Teachers
- Guidelines for Students
- List of Figures
- List of Table
- Introduction to Algorithms
- Analysis of Algorithms
- Analysis of Recursive Algorithms
- Graph and tree Algorithms
- Brute-Force Methodology
- Greedy Algorithms
- Dynamic Programming
- Divide-and-Conquer
- NP-Completeness
- Advanced Topics in Algorithms
- Annexure: List of Experiments
- Co and PO Attainment Table
- Appendices
- Index
Customer Feedback
No reviews yet. Be the first to review this product!