CSC 505 Design and Analysis of Algorithms
    Syllabus    |    Video Lectures & Notes     |     Logistics   

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). 3 hour credits.



Dr. Steffen Heber, Associate Professor
Dept. of Computer Science
2260 EB2, Box 8206
NCSU Campus
Raleigh, NC 27695

Phone: 919-513-1118
Fax: 919-515-7896
Email: sheber@ncsu.edu

  CSC 505 Course Website