Stanford University Online Course Highlights
- 4 weeks long
- 4-8 hours per week
- Learn for FREE, Upgradable
- Self-Paced
- Taught by: Tim Roughgarden, Professor, Computer Science
- View Course Syllabus
Online Course Details:
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). Like this course there are many other courses which are on top for this you can visit Top University Courses.
SKILLS YOU WILL GAIN:
- Spanning Tree
- Algorithms
- Dynamic Programming
- Greedy Algorithm
