In this Subject, I will share my class notes of Design and Analysis of Algorithm that includes (Theory of Asymptotic Notations, Time Complexity of Iterative and Recursive Algorithm, Solution of Homogeneous and Non Homogeneous Equations, Master Theorem with examples, Divide and Conquer, Greedy Algorithm, Dynamic Programming, Backtracking, Branch and Bound, Graph Theory, Lower Bound Theory, Np Completeness and Various sorting techniques). I have included lots of Gate Questions which may helpful for the students for competitive examination like GATE, DRDO, ISRO and GPSC.