From cdb0cf09a0db3cc6f0c2dffa7904f77451b323d4 Mon Sep 17 00:00:00 2001 From: Baochen Hu Date: Tue, 17 Nov 2015 16:34:37 -0500 Subject: [PATCH 1/3] fix break link, add UC berkeley network course --- README.md | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 1d8b70e..fae2543 100644 --- a/README.md +++ b/README.md @@ -777,7 +777,11 @@ Topics covered include probability theory and Bayesian inference; univariate dis - 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://www.ini740.com/F15/index.html) **Fundamentals of Computer Networks** *CMU* Lecture Videos Assignments Readings Lecture Notes +- [14-740](http://www.cs.cmu.edu/~prs/15-441-F13/) **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. +- [CS 168](https://inst.eecs.berkeley.edu/~cs168/fa15/) Assignments Readings Lecture Notes + - This is an undergraduate level course covering the fundamental concepts of networking as embodied in the Internet. The course will cover a wide range of topics; see the lecture schedule for more details. While the class has a textbook, we will not follow its order of presentation but will instead use the text as a reference when covering each individual topic. The course will also have several projects that involve programming (in Python). + - You should know programming, data structures, and software engineering. In terms of mathematics, your algebra should be very solid, you need to know basic probability, and you should be comfortable with thinking abstractly. The TAs will spend very little time reviewing material that is not specific to networking. We assume that you either know the material covered in those courses, or are willing to learn the material as necessary. We won't cover any of this material in lecture. + From 851789442a0f229c1f568643da43e7aace025eb3 Mon Sep 17 00:00:00 2001 From: Baochen Hu Date: Tue, 17 Nov 2015 16:37:08 -0500 Subject: [PATCH 2/3] Add Title --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index fae2543..6de5318 100644 --- a/README.md +++ b/README.md @@ -781,7 +781,7 @@ Topics covered include probability theory and Bayesian inference; univariate dis - 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. -- [CS 168](https://inst.eecs.berkeley.edu/~cs168/fa15/) Assignments Readings Lecture Notes +- [CS 168](https://inst.eecs.berkeley.edu/~cs168/fa15/) **Computer Networds** *UC Berkeley*Assignments Readings Lecture Notes - This is an undergraduate level course covering the fundamental concepts of networking as embodied in the Internet. The course will cover a wide range of topics; see the lecture schedule for more details. While the class has a textbook, we will not follow its order of presentation but will instead use the text as a reference when covering each individual topic. The course will also have several projects that involve programming (in Python). - You should know programming, data structures, and software engineering. In terms of mathematics, your algebra should be very solid, you need to know basic probability, and you should be comfortable with thinking abstractly. The TAs will spend very little time reviewing material that is not specific to networking. We assume that you either know the material covered in those courses, or are willing to learn the material as necessary. We won't cover any of this material in lecture. From 8a9a131c5392e0d67b8d2898c2b1d38ccaf7b772 Mon Sep 17 00:00:00 2001 From: Baochen Hu Date: Tue, 17 Nov 2015 16:38:26 -0500 Subject: [PATCH 3/3] fix typo --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 6de5318..035a83c 100644 --- a/README.md +++ b/README.md @@ -781,7 +781,7 @@ Topics covered include probability theory and Bayesian inference; univariate dis - 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. -- [CS 168](https://inst.eecs.berkeley.edu/~cs168/fa15/) **Computer Networds** *UC Berkeley*Assignments Readings Lecture Notes +- [CS 168](https://inst.eecs.berkeley.edu/~cs168/fa15/) **Computer Networks** *UC Berkeley*Assignments Readings Lecture Notes - This is an undergraduate level course covering the fundamental concepts of networking as embodied in the Internet. The course will cover a wide range of topics; see the lecture schedule for more details. While the class has a textbook, we will not follow its order of presentation but will instead use the text as a reference when covering each individual topic. The course will also have several projects that involve programming (in Python). - You should know programming, data structures, and software engineering. In terms of mathematics, your algebra should be very solid, you need to know basic probability, and you should be comfortable with thinking abstractly. The TAs will spend very little time reviewing material that is not specific to networking. We assume that you either know the material covered in those courses, or are willing to learn the material as necessary. We won't cover any of this material in lecture.