You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
[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
280
281
[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
281
282
283
+
### Core Security
284
+
**Topics covered**
285
+
`Confidentiality, Integrity, Availability`
286
+
`Secure Design`
287
+
`Defensive Programming`
288
+
`Threats and Attacks`
289
+
`Network Security`
290
+
`Cryptography`
291
+
`and more`
292
+
293
+
Note: These courses are provisionally recommended. There is an open [Request For Comment](https://github.com/ossu/computer-science/issues/639) on security course selection. Contributors are encouraged to compare the various courses in the RFC and offer feedback.
0 commit comments