CSCI 6323 Design and Analysis of Algorithms

Advanced topics in data structures and algorithms, including divide and conquer method, dynamic programming, greedy method, local search, polynomial time reductions, NP-complete problems, approximation algorithms and randomized algorithms. Applications of various algorithms and data structures will be discussed and implemented. 

Credits

3

Schedule Type

Lecture

Grading Basis

Standard Letter (A-F)

Administrative Unit

Computer Science

Offered

As scheduled