 
| PDC4S:\CODING\GATE 2021 RavindraBabu Ravula\Algorithms | ||
|  Up one directory... | ||
|  | ||
|  1.Instruction Note | ||
|  10.Zero by one Knapsack | ||
|  11.Subset sum | ||
|  12.Travelling salesman problem | ||
|  13.All pairs shortest path -- Floyd Warshall | ||
|  14.NP Completeness (Not required for GATE) Complexity Classes | ||
|  2.Time and Space analysis | ||
|  3.Sorting Techniques | ||
|  4.Greedy algorithms | ||
|  5.Dijkstra Algorithm | ||
|  6.Dynamic programming | ||
|  7.Matrix chain multiplication -- Dynamic Programming | ||
|  8.Longest common subsequence | ||
|  9.Multi stage graph | ||