University of Michigan - Shanghai Jiao Tong University Joint Institute

Pages

Ve 477: Introduction to Algorithms


Course description: Fundamental techniques for designing efficient algorithms and basic mathematical methods for analyzing their performance. Paradigms for algorithm design: divide-and-conquer, greedy methods, graph search techniques, dynamic programming. Design of efficient data structures and analysis of the running time and space requirements of algorithms in the worst and average cases. 
Credit hours: 4 credits
Pre-requisites: Ve281 or graduate standing 
Syllabus