Awesome-Mirrors/OSSU-computer-science
1
0
Fork 0
mirror of https://github.com/ossu/computer-science.git synced 2024-10-01 01:26:01 -04:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #990 from MattRieke/master

Browse Source 
Cosmetic updates to headings
This commit is contained in:
waciumawanjohi 2022-03-02 01:05:45 -05:00 committed by GitHub
commit f321ce2425
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
README.md
View File

@ -93,8 +93,9 @@ just remember that you can't purchase success!
- [CS Tools](#cs-tools)
- [Core systems](#core-systems)
- [Core theory](#core-theory)
- [Core applications](#core-applications)
- [Core security](#core-security)
- [Core applications](#core-applications)
- [Core ethics](#core-ethics)
- [Advanced CS](#advanced-cs)
- [Advanced programming](#advanced-programming)
- [Advanced systems](#advanced-systems)
@ -171,7 +172,7 @@ Courses | Duration | Effort | Prerequisites | Discussion
[Design Patterns](https://www.coursera.org/learn/design-patterns) | 4 weeks | 4 hours/week | Object-Oriented Design
[Software Architecture](https://www.coursera.org/learn/software-architecture) | 4 weeks | 2-5 hours/week | Design Patterns
### Core Math
### Core math
Discrete math (Math for CS) is a prerequisite and closely related to the study of algorithms and data structures. Calculus both prepares students for discrete math and helps students develop mathematical maturity.
**Topics covered**:
@ -251,7 +252,7 @@ Courses | Duration | Effort | Prerequisites | Discussion
[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)
### Core Security
### Core security
**Topics covered**
`Confidentiality, Integrity, Availability`
`Secure Design`
@ -302,7 +303,7 @@ Courses | Duration | Effort | Prerequisites | Discussion
[Computer Graphics](https://www.edx.org/course/computer-graphics-2)| 6 weeks | 12 hours/week | C++ or Java, linear algebra | [chat](https://discord.gg/68WqMNV)
[Software Engineering: Introduction](https://www.edx.org/course/software-engineering-introduction) | 6 weeks | 8-10 hours/week | Core Programming, and a [sizable project](FAQ.md#why-require-experience-with-a-sizable-project-before-the-Software-Engineering-courses) | [chat](https://discord.gg/5Qtcwtz)
### Core Ethics
### Core ethics
**Topics covered**:
`Social Context`