This course consists of four modules, focusing on key topics in algorithms and data structures. You'll explore shortest-path algorithms such as Bellman-Ford, Floyd-Warshall, and Johnson. The course also covers NP-completeness, explaining its significance for algorithm designers and strategies for managing computationally intractable problems through heuristic analysis and local search techniques. Throughout the course, you will learn data structures, algorithms, NP-completeness, and dynamic programming, equipping you with a solid foundation in these essential areas.
🆓 Free to Audit
🕒 Approx. 13 Hours
✏️Intermediate Level
🧾 Paid Certificate Available Upon Completion
🎓 Offered by Stanford University via Coursera
