CSCI 5451 - Algorithms

Advanced design and analysis techniques: dynamic programming, greedy algorithms, amortized analysis. Advanced data structures: Fibonacci heaps, union-find data structures. Study of variety of special topics, which may include: graph algorithms, optimization problems, Fast Fourier Transform, string matching, geometric algorithms, NP-completeness and approximation algorithms. Restriction: Restricted to students with graduate standing. Note: Expected knowledge of algorithms equivalent to CSCI 3412. Max hours: 3 Credits. Semester Hours: 3 to 3