Virtually every setting in which a computer is used today involves algorithm
design. Examples of such settings range from software development and
hardware design for a PC, to mobile systems, networking and manufacturing.
This course will study algorithm design techniques and the mathematical tools
needed to analyze their performance.
Text: Introduction to Algorithms, second edition by T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, McGraw Hill, 2001.
Prerequisites: CSC 3102 or equivalent
Topics (tentative): Analysis techniques, sorting and order statistics, dynamic programming, greedy algorithms, graph algorithms, strings and number theory algorithms.
Phone: (225) 578-5238
Fax: (225) 578-5200
E-mail: