Design and Analysis of Algorithms
☞ Algorithm Introduction And process for Design and Analysis of Algorithms☞ Pseduo code conventions for designing an algorithm
☞ Performance measurement -Time Complexity with examples
☞ Space complexity with examples
☞ Asymptotic notations- Design and analysis of algorithms
☞ DIVIDE AND CONQUER - BINARY SEARCH
☞ MERGE SORT-DIVIDE AND CONQUER
☞ QUICK SORT-DIVIDE AND CONQUER
☞ Introduction to greedy method and knapsack problem using greedy
☞ Job sequencing with dead lines
☞ Dijkstra's single source shortest path problem using greedy method
☞ t v nagaraju a technical channel minimum cost spanning tree
☞ 0/1 Knapsack problem using Dynamic programming with example
☞ OPTIMAL BINARY SEARCH TREE WITH EXAMPLE USING DYNAMIC PROGRAMMING- ALGORITHMS
☞ Travelling sales man problem - dynamic programming with example
☞ All pairs shortest path with example by dynamic programming
☞ N queens problem by using back tracking
☞ sum of sub sets problem
☞ graph coloring
☞ Hamiltonian cycle
☞ 0/1 knapsack problem using FIFO Branch and Bound
☞ 0/1 knapsack problem using least cost Branch and Bound by tv nagaraju
☞ travelling sales person problem using least cost branch and bound
☞ MASTER THEOREM to solve recurrence relations with examples