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).
Spring 2025
Instructors
Meeting Patterns
Classes Start:
January 6, 2025
Classes End:
April 22, 2025
Location:
02015 Engineering Building I
Class Days:
T H
Class Start Time:
11:45am
Class End Time:
1:00pm
Class Type:
Lecture
Credits:
3.00
Restrictions:
Restriction: CSC Grads, 14DSFCTG, 14DSFZCTG, 14CSCCTG, 14CSCZCTG, 14CNCMS, and CN Grads
