Course Description
Algorithm design techniques: use of data structures, divide and conquer, dynamic programming, greedy techniques, local and global search. Complexity and analysis of algorithms: asymptotic analysis, worst case and average case, recurrences, lower bounds, NP-completeness. Algorithms for classical problems including sorting, searching and graph problems (connectivity, shortest paths, minimum spanning trees).
DE Fee
Engineering Online GRAD
DE Program
MS E
Fall 2026
Instructors
Meeting Patterns
Classes Start:
August 17, 2026
Classes End:
December 1, 2026
Distance Education:
Yes
Class Days:
[TBA]
Course Information
Class Type:
Lecture
Credits:
3.00
Restrictions:
Restriction: Engineering Online Students Only