CSC 505 Design and Analysis Of Algorithms Section: 601
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).
Engineering Online GRAD
- Classes Start:January 7, 2019
- Classes End:April 26, 2019
- Distance Education: Yes
- Class Type: Lecture
- Credits: 3.00
- Delivery Method: Internet
- Restrictions: ONLY distance-track students with grad standing in Computer Networking (CS or EE) or Computer Science may continue with registration. All other students must request enrollment through the EOL Registration System (http://go.ncsu.edu/eol_registration).