mirrors/computer-science
mirrors
/
computer-science
mirror of https://github.com/ossu/computer-science.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Algorithms Specialization 

- Breaks down specialization into individual courses
 See: https://github.com/ossu/computer-science/issues/645#issuecomment-588705984
This commit is contained in:
saif.sohomow 2020-03-06 12:06:47 +04:00 committed by waciumawanjohi
parent db2aab4d4f
commit b6d50b14f0
1 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
README.md
View File

@ -275,9 +275,12 @@ Courses | Duration | Effort | Additional Text / Assignments| Prerequisites
`NP-completeness`
`and more`
Courses | Duration | Prerequisites
:-- | :--: | :--:
[Algorithms](https://www.coursera.org/specializations/algorithms) | 80 hours | any programming language, Mathematics for Computer Science
Courses | Duration | Effort | Prerequisites
:-- | :--: | :--: | :--:
[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