C S 472-3.  Design and Analysis of Algorithms.        
Design methodologies; divide-and-conquer, exhaustive  
search, dynamic programming. Time and space           
complexity measures, analysis of algorithms. Survey of
important algorithms for searching, sorting, graph    
manipulation.  Tractability:  class P and NP,         
NP complete problems.                                 


"Press the Back button on your browser to return".