COT 5407 - Introduction to Algorithms (3)
Description: Design of efficient date structures and algorithms; analysis of algorithms and asymptotic time complexity; graph, string, and geometric algorithms; NP-completeness.
Prerequistes: NONE
Notes: COT 5993 Experimental course for Spring 2005.