Class 4 design and analysis of algorithms Syllabus

• Asymptotic Notations
• Complexity Analysis
• Recurrence Relations
• Divide and Conquer
• Dynamic Programming
• Greedy Method
• BFS and DFS
• Minimum Spanning Trees
• Shortest Path Algorithms
• Backtracking
• Branch and Bound
• NP Completeness
• P and NP Problems