CS345A - Algorithms -II
Prerequisites:
3-0-0-9
Course Contents
Max Flows: Max Flows (Ford Fulkerson and bipartite matching), Linear Algebra: LUP decomposition, inverting matrices, Fast Fourier Transform. Polynomial multiplication, integer multiplication and division, Number Theoretic Algorithms: gcd, modulo arithmetic, Chinese remaindering, RSA, Linear Programming: formulation, simplex, primal dual, Geometric algorithms: convex hull, closest pair, intersection of line segments, polygon triangulation, Randomized Algorithms: identity testing, primality and min cut, Approximation Algorithms: max cut, tsp, vertex cover etc, Backtracking, Other topics. These may include string matching, parallel algorithms, amortized analysis etc.
Topics
Current Course Information
Instructor(s):
Number of sections:
Tutors for each section:
Schedule for Lectures:
Schedule for Tutorial:
Schedule for Labs: