Credits: 4 (3-0-2)
Prerequisites: COL351 OR Equivalent
Description
Advanced data structures: self-adjustment, persistence and multidimensional trees. Randomized algorithms: Use of probabilistic inequalities in analysis, Geometric algorithms: Point location, Convex hulls and Voronoi diagrams, Arrangements applications using examples. Graph algorithms: Matching and Flows. Approximation algorithms: Use of Linear programming and primal dual, Local search heuristics. Parallel algorithms: Basic techniques for sorting, searching, merging, list ranking in PRAMs and Interconnection networks.
Prerequisite Tree
flowchart TD
COL758-216[COL758]
COL106-216 --> COL100-216[COL100]
COL351-216 --> COL106-216[COL106]
COL758-216 --> COL351-216[COL351]
classDef empty height:17px, fill:transparent, stroke:transparent;
classDef trueEmpty height:0px, width:0px;