Analysis,design and Algorithm

Chapter 1 : Review

• http://www.onestopgate.com/gate-study-material/1.1.asp - Concept of algorithm
• http://www.onestopgate.com/gate-study-material/1.2.asp - Components of algorithms

Chapter 2 : Different perspectives of algorithm

• http://www.onestopgate.com/gate-study-material/2.1.asp - Numerical algorithm
• http://www.onestopgate.com/gate-study-material/2.2.asp - Review of searching algorithm
• http://www.onestopgate.com/gate-study-material/2.3.asp - Review of sorting algorithm
• http://www.onestopgate.com/gate-study-material/2.4.asp - Recursion v/s iteration

Chapter 3 : Graph theory and related data structure

• http://www.onestopgate.com/gate-study-material/3.1.asp - Introduction to graph theory
• http://www.onestopgate.com/gate-study-material/3.2.asp - Matrix representation
• http://www.onestopgate.com/gate-study-material/3.3.asp - Trees

Chapter 4 : Divide and Conquer

• http://www.onestopgate.com/gate-study-material/4.1.asp - Divide & Conquer : Binary search
• http://www.onestopgate.com/gate-study-material/4.2.asp - Max- Min Search & Merge sort
• http://www.onestopgate.com/gate-study-material/4.3.asp - Integer Multiplication

Chapter 5 : Greedy method

• http://www.onestopgate.com/gate-study-material/5.1.asp - Cassette filling
• http://www.onestopgate.com/gate-study-material/5.2.asp - Knapsack problem
• http://www.onestopgate.com/gate-study-material/5.3.asp - Job scheduling

Chapter 6 : Backtracking and Branch and Bound

• http://www.onestopgate.com/gate-study-material/6.1.asp - Backtracking
• http://www.onestopgate.com/gate-study-material/6.2.asp - Branch & Bound

Chapter 7 : Graph theoretic algorithms

• http://www.onestopgate.com/gate-study-material/7.1.asp - Shortest path
• http://www.onestopgate.com/gate-study-material/7.2.asp - Minimal spanning trees
• http://www.onestopgate.com/gate-study-material/7.3.asp - Techniques for Graphs