The Georgia Institute of Technology
Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
4.87 ratingsDelve into Pattern Matching algorithms from KMP to Rabin-Karp. Tackle essential algorithms that traverse the graph data structure like Dijkstra’s Shortest Path. Study algorithms that construct a Minimum Spanning Tree (MST) from a graph. Explore Dynamic Programming algorithms. Use the course visuali…
- edX
- 5 weeks, 9 - 10 hours per week
- Self-paced
- Free to audit
- Paid certificate
- Intermediate























