(eBook PDF) Analysis and Design of Algorithms 3rd ed. Edition by Amrinder Arora – Digital Ebook – Instant Delivery Download
Product details:
- ISBN-10 : 1516513088
- ISBN-13 : 978-1516513086
- Author:
Analysis and Design of Algorithms provides a structured view of algorithm design techniques in a concise, easy-to-read manner. The book was written with an express purpose of being easy — to understand, read, and carry.
It presents a pioneering approach in the teaching of algorithms, based on learning algorithm design techniques, and not merely solving a collection of problems. This allows students to master one design technique at a time and apply it to a rich variety of problems.
Analysis and Design of Algorithms covers the algorithmic design techniques of divide and conquer, greedy, dynamic programming, branch and bound, and graph traversal. For each of these techniques, there are templates and guidelines on when to use and not to use each technique. Many sections contain innovative mnemonics to aid the readers in remembering the templates and key takeaways. Additionally, the book covers NP-completeness and the inherent hardness of problems. The third edition includes a new section on polynomial multiplication, as well as additional exercise problems, and an updated appendix.
Table contents:
SECTION I: THE BASICS
CHAPTER 1: INTRODUCTION AND BARE ESSENTIALS
CHAPTER 2: ASYMPTOTIC ANALYSIS AND NOTATION
CHAPTER 3: DATA STRUCTURES
SECTION II: ALGORITHM DESIGN TECHNIQUES
CHAPTER 4: DIVIDE AND CONQUER
CHAPTER 5: GREEDY METHOD
CHAPTER 6: DYNAMIC PROGRAMMING
CHAPTER 7: GRAPH TRAVERSAL TECHNIQUES
CHAPTER 8: BRANCH AND BOUND
SECTION III: INTRINSIC HARDNESS OF PROBLEMS
CHAPTER 9: NP COMPLETENESS
CHAPTER 10: SLAYING THE NP-HARDNESS DRAGON
CHAPTER 11: THEORY OF LOWER BOUNDS
SECTION IV: CONCLUSIONS AND AUXILIARY MATERIALS
CHAPTER 12: WRAPPING UP
People also search:
Analysis and Design of Algorithms
What is analysis and design of algorithms?
What are the 3 algorithm analysis techniques?
What is DAA in engineering?