Spring 2009

Dr. Gur Saran Adhar

Old Final exams are linked near bottom of this page...

Catalogue Description

csc532: Design and Analysis of Algorithms (3) Prerequisite:csc332

Theory of the design of efficient computer algorithms. Algorithms for sorting, searching, matrix operations, Fast Fourier Transforms, Pattern Matching, Polynomial Arithmetic and operations on graphs. Additional topics selected from NP-Completeness, recursion, Data Structure Selection and complexity.

Meeting Day, Time, Place:  

 Tuesday Thursday, 4:30-5:45pm, CIS 1006 CIS 2011 (conference room)

Important Dates:  
        Drop/add closes:  January 14, 2009                
        Last date to withdraw with W:  February 24, 2009

Final-Spring08  Final-Spring06