Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera) Apr 29th 2024 Course Auditing Coursera Stanford University Categories CS: Software Engineering CS: Theory Effort Intermediate 4 Weeks 1-4 Hours/Week Languages English Spanish Russian Portuguese French English The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees). Algorithms Specialization Algorithms Greedy Algorithms Dynamic Programming Programming Minimum Spanning Trees Huffman Codes Clustering Scheduling Computer Science View more details Apr 29th 2024 Course Auditing Coursera Stanford University CS: Software Engineering CS: Theory Intermediate 4 Weeks 1-4 Hours/Week 41.00 EUR/month English Spanish Russian Portuguese French English
