edX MOOC / Non-credit 0

Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms

Name: Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
Price: 189 USD
Availability: InStock

The Georgia Institute of Technology

About this course

Delve 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 visualization tool to understand the algorithms and their performance.

75/100

CourseAsk score

What the provider tells you: 24/45
Who stands behind it: 35/35
How complete the listing is: 16/20

Scores how much the provider publishes and who stands behind it — not how well it is taught.

What you'll learn

understand and implement pattern matching algorithms like KMP and Rabin-Karp
apply Dijkstra's algorithm for shortest path problems
construct Minimum Spanning Trees using relevant algorithms
develop solutions using dynamic programming techniques

Machine Learning #algorithms #graph algorithms #data structures #dynamic programming #pattern matching #Dijkstra's algorithm #minimum spanning tree #kmp #rabin-karp #algorithm visualization

$189.00

Price shown by edX — confirm on their site.

Enroll on edX

You'll be redirected to edX to complete enrollment.