Fundamentals of Algorithm Introduction Notion of Algorithm Necessary Mathematical Foundation Proof Techniques Algorithm Specifications Analysis Framework Asymptotic Notations Recurrence Equations Mathematical Analysis of Non Recursive Algorithms Mathematical Analysis of Recursive Algorithms Fibonacci Numbers Probabilistic Analysis and Randomized Algorithm Randomized Algorithm Amortized Analysis Brute Force Method Introduction Selection Sort Bubble Sort Sequential Search Brute Force String Matching Algorithm Exhaustive Search Divide and Conquer General Method Binary Search Merge Sort Quick Sort Exponentiation Strassen’s Matrix Multiplication Finding Minimum and Maximum Greedy Method Introduction The Greedy Method Job Sequencing with Deadlines Knapsack Problem Minimum Cost Spanning Tree Single Source Shortest Paths Optimal Merge Pattern Container Loading Dynamic Programming Introduction The General Method Difference between Divide and Conquer and Dynamic Programming Difference between Greedy Algorithm and Dynamic Programming Steps of Dynamic Programming Principles of Optimality Elements of Dynamic Programming Applications of Dynamic Programming 0/1 Knapsack Problem Optimal Binary Search Tree (OBST) Traveling Salesperson Problem Multistage Graph Reliability Design Matrix Chain Multiplication Longest Common Subsequence Warshall Algorithm Floyd's Algorithm Assembly Line Scheduling Backtracking General Method Basic Terminologies used in Backtracking Algorithms for Backtracking Applications of Backtracking The 8-Queen's Problem Sum of Subset Hamiltonian Circuit Problem Graph Coloring Knapsack Problem Branch and Bound Introduction Assignment Problem Knapsack Problem Travelling Salesperson Problem Difference between Backtracking and Branch and Bound Selected Topics Algebraic Computation The P and NP Class Problems Non Deterministic Algorithms Non Deterministic Algorithm for 0/1 Knapsack The Class of NP-Hard and NP-Complete Problems NP Complete Problems Satisfiability Problems Vertex Cover Problem Cook's Theorem NP Hard Problems NP Hard Graph Problems NP-Hard Scheduling Problem NP Hard Code Generation Problem Simplified NP Hard Problems Parallel Algorithms Introduction Computational Model Study of Different Graph Problems Implementation of Different Sorting Problems on Multiprocessor System Basic Techniques and Algorithms Complete Binary Tree Pointer Doubling Prefix Computation List Ranking Selection Merging Sorting Graph Problems. - from Amzon