Found 2 records with CourseId:6150 in academic section database. Picking the first.

Course Name: CS6100 : Topics in Design & Analysis of Algorithms

Description: Review of basic concepts? Worst case and average case analysis: big oh? small oh, omega and theta notations, Solving recurrence equations. Overview of basic design paradigms such as incremental approach? divide and conquer? greedy paradigm? dynamic programming backtracking? branch and bound? pruning? transformations? preprocessing and case studies illustrating each design methodologies with complete analysis of algorithms. Advanced graph algorithms? Matching? Network flows? Applications to OR / optimization? Geometric algorithms? Linesweep paradigm? Incremental design? Closest pair problem? Convex hull? Triangulations? Planar point location? Segment intersection? Applications to data bases and computer graphics. Stringology? Pattern matching? 8M algorithms? KMP algorithms? Computational number theory? GCD algorithm? Primality tests? Quadratic residues? Applications to cryptography. Lower bound theory? Information theoretic bounds? Adversary arguments? NP completeness? Basic techniques for proving NP completen

Slot: T

RoomNo:

Instructor: Sreenivasa Kumar P

Period: JAN-MAY 2013

This page was created on: Thursday 19th of September 2013 09:38:03 PM