Algorithms Specialization
- Breaks down specialization into individual courses See: https://github.com/ossu/computer-science/issues/645#issuecomment-588705984pull/670/head
parent
db2aab4d4f
commit
b6d50b14f0
|
@ -275,9 +275,12 @@ Courses | Duration | Effort | Additional Text / Assignments| Prerequisites
|
||||||
`NP-completeness`
|
`NP-completeness`
|
||||||
`and more`
|
`and more`
|
||||||
|
|
||||||
Courses | Duration | Prerequisites
|
Courses | Duration | Effort | Prerequisites
|
||||||
:-- | :--: | :--:
|
:-- | :--: | :--: | :--:
|
||||||
[Algorithms](https://www.coursera.org/specializations/algorithms) | 80 hours | any programming language, Mathematics for Computer Science
|
[Divide and Conquer, Sorting and Searching, and Randomized Algorithms](https://www.coursera.org/learn/algorithms-divide-conquer) | 4 weeks | 4-8 hours/week | any programming language, Mathematics for Computer Science
|
||||||
|
[Graph Search, Shortest Paths, and Data Structures](https://www.coursera.org/learn/algorithms-graphs-data-structures) | 4 weeks | 4-8 hours/week | Divide and Conquer, Sorting and Searching, and Randomized Algorithms
|
||||||
|
[Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming](https://www.coursera.org/learn/algorithms-greedy) | 4 weeks | 4-8 hours/week | Graph Search, Shortest Paths, and Data Structures
|
||||||
|
[Shortest Paths Revisited, NP-Complete Problems and What To Do About Them](https://www.coursera.org/learn/algorithms-npcomplete) | 4 weeks | 4-8 hours/week | Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
|
||||||
|
|
||||||
|
|
||||||
### Core applications
|
### Core applications
|
||||||
|
|
Loading…
Reference in New Issue