Introduction to Algorithms Lecture Notes
This note concentrates on the design of algorithms and the rigorous analysis of their efficiency. Topics covered includes: the basic definitions of algorithmic complexity, basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications, graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths, design of online algorithms and competitive analysis.
Author(s): Michael Dinitz
NA Pages 
This book contains below topics, Recursion, Backtracking, Dynamic Programming, Greedy Algorithms, Basic Graph Algorithms, Depth First Search, Minimum Spanning Trees, Shortest Paths, All Pairs Shortest Paths, Maximum Flows and Minimum Cuts, Applications of Flows and Cuts, NP Hardness.
Author(s): Jeff Erickson, University of Illinois Urbana-Champaign
472 Pages
This book contains below topics, Array based lists, Linked lists, Skiplists, Hash tables, Binary trees, Random binary search trees, Scapegoat trees, Red black trees, Heaps, Sorting algorithms, Graphs, Data structures for integers, External memory searching.
Author(s): Pat Morin, Carleton University
334 Pages
Lecture Notes on Design and Analysis of Algorithms
This note describes the following topics, Greedy methods, Dynamic programming, Backtracking, Branch and bound.
Author(s): Annamalai University
96 Pages
Advanced Algorithms by BMS College of Engineering
he PDF covers the following topics related to Computer Algorithms, Dynamic programming, Application domain of DP, Matrix Chain Multiplication, MCP DP Steps, Recursive Tree, Longest Increasing Subsequence, Dynamic programming, Rod cutting 4 inch rod example, DP for rod cutting, Bottom up approach.
Author(s): BMS College of Engineering
152 Pages
Lecture Notes On Design And Analysis Of Algorithms
This note covers the following topics, Design and analysis of algorithms, Growth of Functions, Recurrences, Solution of Recurrences by substitution, Recursion tree method, Master Method, Worst case analysis of merge sort, quick sort and binary search, Design and analysis of Divide and Conquer Algorithms, Heaps and Heap sort, Priority Queue, Lower Bounds for Sorting, Dynamic Programming algorithms, Matrix Chain Multiplication, Elements of Dynamic Programming, Longest Common Subsequence, Greedy Algorithms, Activity Selection Problem, Elements of Greedy Strategy, Fractional Knapsack Problem, Huffman Codes, Graph Algorithm BFS and DFS, Minimum Spanning Trees, Kruskal algorithm, Prims Algorithm, Fourier transforms and RabinKarp Algorithm.
Author(s): Dr. Subasish Mohapatra
125 Pages
Lecture Notes On Design And Analysis Of Algorithms
This note explains the following topics related to Algorithm Analysis and Design, Introduction to Design and analysis of algorithms, Growth of Functions, Recurrences, Solution of Recurrences by substitution,Recursion tree method, Master Method, Design and analysis of Divide and Conquer Algorithms, Worst case analysis of merge sort, quick sort and binary search, Heaps and Heap sort, Priority Queue, Lower Bounds for Sorting.
Author(s): Mr. S.K. Sathua, Dr. M.R. Kabat and Dr. R. Mohanty
80 Pages
