Awesome-Mirrors/OSSU-computer-science
1
0
Fork 0
mirror of https://github.com/ossu/computer-science.git synced 2025-04-18 06:35:58 -04:00
Code Issues Packages Projects Releases Wiki Activity

Progress updated

Browse Source
This commit is contained in:
Reborn 2024-09-29 17:29:40 -03:00
parent 1e7c0a5ca1
commit 51d00a040c
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@ -136,7 +136,7 @@ If you've never written a for-loop, or don't know what a string is in programmin
Completed | Courses | Duration | Effort | Prerequisites | Discussion
:--: | :-- | :--: | :--: | :--: | :--:
✅ | [Introduction to programming](coursepages/intro-programming/README.md) | 10 weeks | 10 hours/week | none | [chat](https://discord.gg/syA242Z)
❌ | [Introduction to programming](coursepages/intro-programming/README.md) | 10 weeks | 10 hours/week | none | [chat](https://discord.gg/syA242Z)
### Introduction to Computer Science
@ -256,7 +256,7 @@ Completed | Courses | Duration | Effort | Prerequisites | Discussion
Completed | Courses | Duration | Effort | Prerequisites | Discussion
:--: | :-- | :--: | :--: | :--: | :--:
❌ | [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 | [chat](https://discord.gg/mKRS7tY)
🕒 | [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 | [chat](https://discord.gg/mKRS7tY)
❌ | [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 | [chat](https://discord.gg/Qstqe4t)
❌ | [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 | [chat](https://discord.gg/dWVvjuz)
❌ | [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 | [chat](https://discord.gg/dYuY78u)