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.

Reference: Discrete Mathematics and its Applications, fourth edition, by K. H. Rosen, McGraw Hill, 1999.

Prerequisites: CSC 3102 and EE 3755 or equivalent

Phone: (225) 578-5238
Fax: (225) 578-5200
E-mail: