COL351: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 4: | Line 4: | ||
| credits = 4 | | credits = 4 | ||
| credit_structure = 3-1-0 | | credit_structure = 3-1-0 | ||
| pre_requisites = COL106 | | pre_requisites = [[COL106]] | ||
| overlaps = MTL342, COL702 | | overlaps = [[MTL342]], [[COL702]] | ||
}} | }} | ||
== COL351 : Analysis and Design of Algorithms == | == COL351 : Analysis and Design of Algorithms == | ||
Checking 2-edge, 2-node and strong connectivity using DFS, Strongly connected components. Greedy algorithms, minimum spanning trees (Prim/Kruskal), Union-find data structure. Matroids. Divide and conquer algorithms. Polynomial multiplication, DFT and FFT. Dynamic Programming, All pairs shortest paths (Bellman-Ford, Floyd Warshall). s-t flows, Ford-Fulkerson, Edmonds-Karp, applications of maxflow Intractability, NP-completeness, Polynomial time reductions. String matching, KMP and Rabin-Karp. Universal hashing and applications. Geometric algorithms like convex hulls, multidimensional data structures, plane sweep paradigm. | Checking 2-edge, 2-node and strong connectivity using DFS, Strongly connected components. Greedy algorithms, minimum spanning trees (Prim/Kruskal), Union-find data structure. Matroids. Divide and conquer algorithms. Polynomial multiplication, DFT and FFT. Dynamic Programming, All pairs shortest paths (Bellman-Ford, Floyd Warshall). s-t flows, Ford-Fulkerson, Edmonds-Karp, applications of maxflow Intractability, NP-completeness, Polynomial time reductions. String matching, KMP and Rabin-Karp. Universal hashing and applications. Geometric algorithms like convex hulls, multidimensional data structures, plane sweep paradigm. | ||
Latest revision as of 16:25, 14 April 2026
| COL351 | |
|---|---|
| Analysis and Design of Algorithms | |
| Credits | 4 |
| Structure | 3-1-0 |
| Pre-requisites | COL106 |
| Overlaps | MTL342, COL702 |
COL351 : Analysis and Design of Algorithms
Checking 2-edge, 2-node and strong connectivity using DFS, Strongly connected components. Greedy algorithms, minimum spanning trees (Prim/Kruskal), Union-find data structure. Matroids. Divide and conquer algorithms. Polynomial multiplication, DFT and FFT. Dynamic Programming, All pairs shortest paths (Bellman-Ford, Floyd Warshall). s-t flows, Ford-Fulkerson, Edmonds-Karp, applications of maxflow Intractability, NP-completeness, Polynomial time reductions. String matching, KMP and Rabin-Karp. Universal hashing and applications. Geometric algorithms like convex hulls, multidimensional data structures, plane sweep paradigm.