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
Summer I 10W 2025
Instructors
Meeting Patterns
Classes Start:
May 14, 2025
Classes End:
July 25, 2025
Distance Education:
Yes
Class Days:
[TBA]
Class Type:
Lecture
Credits:
3.00
Restrictions:
Enrollment for this course is through the Engineering Online Registration System. Go to http://go.ncsu.edu/eol_registration