mirror of
https://github.com/ossu/computer-science.git
synced 2024-10-01 01:26:01 -04:00
Added Reliable Distributed Algorithms
This commit is contained in:
parent
fd19e09274
commit
236acc84e8
@ -353,6 +353,11 @@ if you are struggling, you can find a physics MOOC or utilize the materials from
|
|||||||
formal languages;
|
formal languages;
|
||||||
Turing machines;
|
Turing machines;
|
||||||
computability;
|
computability;
|
||||||
|
event-driven concurrency;
|
||||||
|
automata;
|
||||||
|
distributed shared memory;
|
||||||
|
consensus algorithms;
|
||||||
|
state machine replication;
|
||||||
computational geometry theory;
|
computational geometry theory;
|
||||||
propositional logic;
|
propositional logic;
|
||||||
relational logic;
|
relational logic;
|
||||||
@ -365,6 +370,8 @@ Courses | Duration | Effort | Prerequisites
|
|||||||
:-- | :--: | :--: | :--:
|
:-- | :--: | :--: | :--:
|
||||||
[Introduction to Logic](https://www.coursera.org/learn/logic-introduction) | 10 weeks | 4-8 hours/week | set theory
|
[Introduction to Logic](https://www.coursera.org/learn/logic-introduction) | 10 weeks | 4-8 hours/week | set theory
|
||||||
[Automata Theory](https://lagunita.stanford.edu/courses/course-v1:ComputerScience+Automata+Fall2016/about) | 8 weeks | 10 hours/week | discrete mathematics, logic, algorithms
|
[Automata Theory](https://lagunita.stanford.edu/courses/course-v1:ComputerScience+Automata+Fall2016/about) | 8 weeks | 10 hours/week | discrete mathematics, logic, algorithms
|
||||||
|
[Reliable Distributed Systems, Part 1](https://www.edx.org/course/reliable-distributed-algorithms-part-1-kthx-id2203-1x) | 5 weeks | 5 hours/week | Scala, intermediate CS
|
||||||
|
[Reliable Distributed Systems, Part 2](https://www.edx.org/course/reliable-distributed-algorithms-part-2-kthx-id2203-2x) | 5 weeks | 5 hours/week | Part 1
|
||||||
[Computational Geometry](https://www.edx.org/course/computational-geometry-tsinghuax-70240183x) | 16 weeks | 8 hours/week | algorithms, C++
|
[Computational Geometry](https://www.edx.org/course/computational-geometry-tsinghuax-70240183x) | 16 weeks | 8 hours/week | algorithms, C++
|
||||||
[Introduction to Formal Concept Analysis](https://www.coursera.org/learn/formal-concept-analysis) | 6 weeks | 4-6 hours/week | logic, probability
|
[Introduction to Formal Concept Analysis](https://www.coursera.org/learn/formal-concept-analysis) | 6 weeks | 4-6 hours/week | logic, probability
|
||||||
[Game Theory](https://www.coursera.org/learn/game-theory-1) | 8 weeks | x hours/week | mathematical thinking, probability, calculus
|
[Game Theory](https://www.coursera.org/learn/game-theory-1) | 8 weeks | x hours/week | mathematical thinking, probability, calculus
|
||||||
|
Loading…
Reference in New Issue
Block a user