PDC4S:\CODING\GATE 2021 RavindraBabu Ravula\Algorithms for GATE | ||
 Up one directory... | ||
 | ||
 9.Practice Questions | ||
| 8.Problems on NP completeness(Not required for GATE) | ||
| 7.Longest common sub sequence | ||
| 6.Matrix chain multiplication -- Dynamic Programming | ||
| 5.shortest paths in DAGs | ||
| 4.Bellman-ford algorithm | ||
| 3.Dijkstra Algorithm | ||
| 2.Sorting Techniques | ||
| 1.Searching Algorithms | ||