Unit-3.2 All Pairs Shortest Path Flyod Warshall

Unit 2 13 Single Source Shortest Path Dijkstras Algorithm

Unit 2 11 Prims Algorithm

Unit 2 12 Kruskal Algorithm

Unit 2 7 Greedy Method Introduction

Unit 2 6 Convex Hull

Unit 2 8 Knapsack Greedy Method

Unit 2 9 Job Sequencing

Unit 2 10 Minimum Cost Spanning Tree

Unit-4.8 (a-b) Trees and B-Trees

Unit-4.5 Topological Ordering

Unit-4.6 Network Flow Algorithm Ford Fulkerson

Unit-4.3 Depth First Seaarch

Unit-4.7 Tries

Unit-4.4 Connected Components

Unit-3.6 Travelling Salesperson Problem using Dynamic Programming

Unit-3.7 Backtracking

Unit-4.1 Graph Traversal

Unit-4.2 Breadth First Search

Unit-3.2 All Pairs Shortest Path Flyod Warshall

Unit-3.5 Reliability Design

Unit-3.4 0/1 Knapsack using Dynamic Programming

Unit-3.3 Optimal Binary Search Trees

Unit-3.1 Dynamic Programming

Unit-2 5.Closest Pair