diff --git a/README.md b/README.md index a67d4d3..7d85eeb 100644 --- a/README.md +++ b/README.md @@ -1004,7 +1004,7 @@ and anti-analysis techniques. - This is a graduate course in scientific computing created and taught by [Oliver Serang](http://colorfulengineering.org/) in 2014, which covers topics in computer science and statistics with applications from biology. The course is designed top-down, starting with a problem and then deriving a variety of solutions from scratch. - Topics include memoization, recurrence closed forms, string matching (sorting, hash tables, radix tries, and suffix tries), dynamic programming (e.g. Smith-Waterman and Needleman-Wunsch), Bayesian statistics (e.g. the envelope paradox), graphical models (HMMs, Viterbi, junction tree, belief propagation), FFT, and the probabilistic convolution tree. - [Lecture videos on Youtube](https://www.youtube.com/user/fillwithlight/videos) and for direct [download](http://mlecture.uni-bremen.de/ml/index.php?option=com_content&view=article&id=233) -- [14-740](http://ini740.com/F19/) **Fundamentals of Computer Networks** *CMU* Lecture Videos Assignments Readings Lecture Notes +- [14-740](http://www.ini740.rocks/F20) **Fundamentals of Computer Networks** *CMU* Lecture Videos Assignments Readings Lecture Notes - This is an introductory course on Networking for graduate students. It follows a top-down approach to teaching Computer Networks, so it starts with the Application layer which most of the students are familiar with and as the course unravels we learn more about transport, network and link layers of the protocol stack. - As far as prerequisites are concerned - basic computer, programming and probability theory background is required. - The course site contains links to the lecture videos, reading material and assignments.