From 41e7a5430b2cb05e2055758626b09af0d1465b16 Mon Sep 17 00:00:00 2001 From: sharihunt Date: Sun, 31 Dec 2017 21:48:38 -0600 Subject: [PATCH 01/23] Updated 14-740 link in README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 736d8b0..2bb0a85 100644 --- a/README.md +++ b/README.md @@ -986,7 +986,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://www.ini740.com/S17/index.html) **Fundamentals of Computer Networks** *CMU* Lecture Videos Assignments Readings Lecture Notes +- [14-740](http://ini740.com/F17/) **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. From 7b48d5a76e42f1d766a2348a8932cd471dbe6bbb Mon Sep 17 00:00:00 2001 From: Frederick-S Date: Fri, 23 Feb 2018 09:56:42 +0800 Subject: [PATCH 02/23] Fix cs 106a/106b/107 broken links --- README.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/README.md b/README.md index 736d8b0..3800b65 100644 --- a/README.md +++ b/README.md @@ -509,18 +509,18 @@ Courses - Lectures videos will available for free after registration. - [CS 106A](https://see.stanford.edu/Course/CS106A) **Programming Methodology** *Stanford University* Lecture Videos Assignments Lecture Notes - This course is the largest of the introductory programming courses and is one of the largest courses at Stanford. Topics focus on the introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design, decomposition, encapsulation, abstraction, and testing. Programming Methodology teaches the widely-used Java programming language along with good software engineering principles. - - [Lecture Videos](http://see.stanford.edu/see/lecturelist.aspx?coll=824a47e1-135f-4508-a5aa-866adcae1111) - - [Assignments](http://see.stanford.edu/see/materials/icspmcs106a/assignments.aspx) + - [Lecture Videos](https://see.stanford.edu/Course/CS106A) + - [Assignments](https://see.stanford.edu/Course/CS106A) - [All materials in a zip file](http://see.stanford.edu/materials/icspmcs106a/ProgrammingMethodologyAllMaterials.zip) - [CS 106B](https://see.stanford.edu/Course/CS106B) **Programming Abstractions** *Stanford University* Lecture Videos Assignments Lecture Notes - This course is the natural successor to Programming Methodology and covers such advanced programming topics as recursion, algorithmic analysis, and data abstraction using the C++ programming language, which is similar to both C and Java. - - [Lectures](http://see.stanford.edu/see/lecturelist.aspx?coll=11f4f422-5670-4b4c-889c-008262e09e4e) - - [Assignments](http://see.stanford.edu/see/materials/icspacs106b/assignments.aspx) + - [Lectures](https://see.stanford.edu/Course/CS106B) + - [Assignments](https://see.stanford.edu/Course/CS106B) - [All materials in a zip file](http://see.stanford.edu/materials/icspacs106b/ProgrammingAbstractionsAllMaterials.zip) - [CS 107](https://see.stanford.edu/Course/CS107) **Programming Paradigms** *Stanford University* Lecture Videos Assignments Lecture Notes - Topics: Advanced memory management features of C and C++; the differences between imperative and object-oriented paradigms. The functional paradigm (using LISP) and concurrent programming (using C and C++) - - [Lectures](http://see.stanford.edu/see/lecturelist.aspx?coll=2d712634-2bf1-4b55-9a3a-ca9d470755ee) - - [Assignments](http://see.stanford.edu/see/materials/icsppcs107/assignments.aspx) + - [Lectures](https://see.stanford.edu/Course/CS107) + - [Assignments](https://see.stanford.edu/Course/CS107) - [CS 109](http://otfried.org/courses/cs109/index.html) **Programming Practice Using Scala** *KAIST* Assignments Lecture Notes - This course introduces basic concepts of programming and computer science, such as dynamic and static typing, dynamic memory allocation, objects and methods, binary representation of numbers, using an editor and compiler from the command line, running programs with arguments from the command line, using libraries, and the use of basic data structures such as arrays, lists, sets, and maps. We will use Scala for this course. - [Lectures] (http://otfried.org/courses/cs109/index.html) From ba2296b8be464d16fc22ca66f1e4299d7d6a2397 Mon Sep 17 00:00:00 2001 From: wangb Date: Fri, 2 Mar 2018 16:36:12 +0800 Subject: [PATCH 03/23] fix course name error --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 736d8b0..eff0551 100644 --- a/README.md +++ b/README.md @@ -935,7 +935,7 @@ and anti-analysis techniques. - [Syllabus](http://courses2.cit.cornell.edu/cs5724/) - [Lectures](http://courses2.cit.cornell.edu/cs5724/schedule.htm) - [Assignments](http://courses2.cit.cornell.edu/cs5724/) -- [CS 6452](http://www.cs.cornell.edu/courses/CS6452/2012sp/index.php) **Evolutionary Computation** *Cornell University* Lecture Notes +- [CS 6452](http://www.cs.cornell.edu/courses/CS6452/2012sp/index.php) **Datacenter Networks and Services** *Cornell University* Lecture Notes - CS6452 focuses on datacenter networks and services. The emerging demand for web services and cloud computing have created need for large scale data centers. The hardware and software infrastructure for datacenters critically determines the functionality, performance, cost and failure tolerance of applications running on that datacenter. This course will examine design alternatives for both the hardware (networking) infrastructure, and the software infrastructure for datacenters. - [Syllabus](http://www.cs.cornell.edu/courses/CS6452/2012sp/lectures.php) - [Lectures](http://www.cs.cornell.edu/courses/CS6452/2012sp/lectures.php) From e67ca88c25564b4230d3d965158568e210d07b46 Mon Sep 17 00:00:00 2001 From: Pratyush Das Date: Tue, 20 Mar 2018 21:46:28 +0530 Subject: [PATCH 04/23] Fixed broken link --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 736d8b0..c70d9b5 100644 --- a/README.md +++ b/README.md @@ -731,7 +731,7 @@ Topics covered include probability theory and Bayesian inference; univariate dis - Course taught by [W. Owen Redwood](http://ww2.cs.fsu.edu/~redwood/) and [Xiuwen Liu](http://www.cs.fsu.edu/~liux/). It covers a wide range of computer security topics, starting from Secure C Coding and Reverse Engineering to Penetration Testing, Exploitation and Web Application Hacking, both from the defensive and the offensive point of view. - [Lectures and Videos](http://www.cs.fsu.edu/~redwood/OffensiveComputerSecurity/lectures.html) - [Assignments](http://www.cs.fsu.edu/~redwood/OffensiveComputerSecurity/assignments.html) -- [CS 155](https://courseware.stanford.edu/pg/courses/349991/cs155-spring-2013) **Computer and Network Security** *Stanford* Lecture Notes Readings +- [CS 155](https://crypto.stanford.edu/cs155/) **Computer and Network Security** *Stanford* Lecture Notes Readings - Principles of computer systems security. Attack techniques and how to defend against them. Topics include: network attacks and defenses, operating system holes, application security (web, email, databases), viruses, social engineering attacks, privacy, and digital rights management. Course projects focus on building reliable code. Recommended: Basic Unix. Primarily intended for seniors and first-year graduate students. - [CS 161](http://www-inst.eecs.berkeley.edu/~cs161/sp15/) **Computer Security** *UC Berkeley* Lecture Notes - Introduction to computer security. Cryptography, including encryption, authentication, hash functions, cryptographic protocols, and applications. Operating system security, access control. Network security, firewalls, viruses, and worms. Software security, defensive programming, and language-based security. Case studies from real-world systems. From d21e8b1e72691adb4f3ebc4c5214e53a3a5318e4 Mon Sep 17 00:00:00 2001 From: Abhishek Bhattacherjee Date: Mon, 4 Jun 2018 20:45:45 +0530 Subject: [PATCH 05/23] Fix position of CSCI 1230 in list --- README.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/README.md b/README.md index 311f04c..fbe79cd 100644 --- a/README.md +++ b/README.md @@ -821,11 +821,6 @@ and anti-analysis techniques. - This course provides a comprehensive introduction to computer graphics. Focuses on fundamental concepts and techniques, and their cross-cutting relationship to multiple problem domains in graphics (rendering, animation, geometry, imaging). Topics include: sampling, aliasing, interpolation, rasterization, geometric transformations, parameterization, visibility, compositing, filtering, convolution, curves & surfaces, geometric data structures, subdivision, meshing, spatial hierarchies, ray tracing, radiometry, reflectance, light fields, geometric optics, Monte Carlo rendering, importance sampling, camera models, high-performance ray tracing, differential equations, time integration, numerical differentiation, physically-based animation, optimization, numerical linear algebra, inverse kinematics, Fourier methods, data fitting, example-based synthesis. - [Lectures and Readings](http://15462.courses.cs.cmu.edu/fall2015/reading) - [Assignments and Quizes](http://15462.courses.cs.cmu.edu/fall2015/exercises) -- [CS 123](http://cs.brown.edu/courses/csci1230/index.html) **Introduction to Computer Graphics** *Brown University* Assignments Lecture Notes - - This course offers an in-depth exploration of fundamental concepts in 2D and 3D computer graphics. It introduces 2D raster graphics techniques, including scan conversion, simple image processing, interaction techniques and user interface design. The bulk of the course is devoted to 3D modeling, geometric transformations, and 3D viewing and rendering. - - [Lectures](http://cs.brown.edu/courses/csci1230/lectures.html) - - [Labs](http://cs.brown.edu/courses/csci1230/labs.html) - - [Demos](http://cs.brown.edu/courses/csci1230/demos.html) - [CS 378](https://github.com/ut-cs378-vision-2014fall/course-info) **3D Reconstruction with Computer Vision** *UTexas* Assignments Lecture Notes - In this lab-based class, we'll dive into practical applications of 3D reconstruction, combining hardware and software to build our own 3D environments from scratch. We'll use open-source frameworks like OpenCV to do the heavy lifting, with the focus on understanding and applying state-of-the art approaches to geometric computer vision - [Lectures](https://github.com/ut-cs378-vision-2014fall/course-info/tree/master/meeting-notes) @@ -845,6 +840,11 @@ and anti-analysis techniques. - [CSCI-GA.2270-001](https://mrl.nyu.edu/~perlin/courses/fall2015/) **Graduate Computer Graphics** *New York University* Assignments Lecture Notes Readings - Step-by-step study computer graphics, with reading and homework at each lecture (Fall2015) - [Lectures](https://mrl.nyu.edu/~perlin/courses/fall2015/) +- [CSCI 1230](http://cs.brown.edu/courses/csci1230/index.html) **Introduction to Computer Graphics** *Brown University* Assignments Lecture Notes + - This course offers an in-depth exploration of fundamental concepts in 2D and 3D computer graphics. It introduces 2D raster graphics techniques, including scan conversion, simple image processing, interaction techniques and user interface design. The bulk of the course is devoted to 3D modeling, geometric transformations, and 3D viewing and rendering. + - [Lectures](http://cs.brown.edu/courses/csci1230/lectures.html) + - [Labs](http://cs.brown.edu/courses/csci1230/labs.html) + - [Demos](http://cs.brown.edu/courses/csci1230/demos.html) ------- ### Misc From 93ad6c60f141a6536108904a7e7bc3b9d9f1260d Mon Sep 17 00:00:00 2001 From: Abhishek Bhattacherjee Date: Mon, 4 Jun 2018 20:51:02 +0530 Subject: [PATCH 06/23] Fix position of CSCI 1230 I swear it's correct this time --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index fbe79cd..3984f2b 100644 --- a/README.md +++ b/README.md @@ -837,14 +837,14 @@ and anti-analysis techniques. - [Syllabus](https://canvas.instructure.com/courses/904706/assignments/syllabus) - [Lectures](https://canvas.instructure.com/courses/904706) - [Assignments](https://canvas.instructure.com/courses/904706/assignments) -- [CSCI-GA.2270-001](https://mrl.nyu.edu/~perlin/courses/fall2015/) **Graduate Computer Graphics** *New York University* Assignments Lecture Notes Readings - - Step-by-step study computer graphics, with reading and homework at each lecture (Fall2015) - - [Lectures](https://mrl.nyu.edu/~perlin/courses/fall2015/) - [CSCI 1230](http://cs.brown.edu/courses/csci1230/index.html) **Introduction to Computer Graphics** *Brown University* Assignments Lecture Notes - This course offers an in-depth exploration of fundamental concepts in 2D and 3D computer graphics. It introduces 2D raster graphics techniques, including scan conversion, simple image processing, interaction techniques and user interface design. The bulk of the course is devoted to 3D modeling, geometric transformations, and 3D viewing and rendering. - [Lectures](http://cs.brown.edu/courses/csci1230/lectures.html) - [Labs](http://cs.brown.edu/courses/csci1230/labs.html) - [Demos](http://cs.brown.edu/courses/csci1230/demos.html) +- [CSCI-GA.2270-001](https://mrl.nyu.edu/~perlin/courses/fall2015/) **Graduate Computer Graphics** *New York University* Assignments Lecture Notes Readings + - Step-by-step study computer graphics, with reading and homework at each lecture (Fall2015) + - [Lectures](https://mrl.nyu.edu/~perlin/courses/fall2015/) ------- ### Misc From ab8d7671eab91c1a2717e52604368a0e2dfba7b4 Mon Sep 17 00:00:00 2001 From: Akash kumar singh Date: Tue, 12 Jun 2018 19:27:39 +0530 Subject: [PATCH 07/23] Previous link was not working --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 311f04c..f2dcdd0 100644 --- a/README.md +++ b/README.md @@ -648,7 +648,7 @@ Courses - [CS 395T](http://www.nr.com/CS395T/) **Statistical and Discrete Methods for Scientific Computing** *University of Texas* Lecture Videos Lecture Notes Assignments - Practical course in applying modern statistical techniques to real data, particularly bioinformatic data and large data sets. The emphasis is on efficient computation and concise coding, mostly in MATLAB and C++. Topics covered include probability theory and Bayesian inference; univariate distributions; Central Limit Theorem; generation of random deviates; tail (p-value) tests; multiple hypothesis correction; empirical distributions; model fitting; error estimation; contingency tables; multivariate normal distributions; phylogenetic clustering; Gaussian mixture models; EM methods; maximum likelihood estimation; Markov Chain Monte Carlo; principal component analysis; dynamic programming; hidden Markov models; performance measures for classifiers; support vector machines; Wiener filtering; wavelets; multidimensional interpolation; information theory. - - [Lectures and Assignments](http://granite.ices.utexas.edu/coursewiki/index.php/Main_Page) + - [Lectures and Assignments](http://wpressutexas.net/forum/) - [CS 4780](http://www.cs.cornell.edu/courses/CS4780/2014fa/) **Machine Learning** *Cornell University* Lecture NotesReadings - This course will introduce you to technologies for building data-centric information systems on the World Wide Web, show the practical applications of such systems, and discuss their design and their social and policy context by examining cross-cutting issues such as citizen science, data journalism and open government. Course work involves lectures and readings as well as weekly homework assignments, and a semester-long project in which the students demonstrate their expertise in building data-centric Web information systems. - [Syllabus](http://www.cs.cornell.edu/courses/CS4780/2014fa/) From c524c3a2e0ccb170992c08b889b85da0fd153f0f Mon Sep 17 00:00:00 2001 From: Abhishek Kumar <35186422+abhy-kumar@users.noreply.github.com> Date: Wed, 20 Jun 2018 14:28:51 +0530 Subject: [PATCH 08/23] Updated link for CS97SI Notebook The old one is dead. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 311f04c..61ff570 100644 --- a/README.md +++ b/README.md @@ -322,7 +322,7 @@ Courses - [Lecture Videos](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iC2Khb1B5NnbE7SHPQ1-W17) - [CS 97SI](http://web.stanford.edu/class/cs97si/) **Introduction to Competitive Programming** *Stanford University* Assignments Lecture Notes - Fantastic repository of theory and practice problems across various topics for students who are interested to participate in ACM-ICPC. - - [Lectures and Assignments](http://stanford.edu/~liszt90/acm/notebook.html) + - [Lectures and Assignments](https://github.com/jaehyunp/stanfordacm) - [CS 224](http://people.seas.harvard.edu/~minilek/cs224/fall14/index.html) **Advanced Algorithms** *Harvard University* Lecture Videos Assignments Lecture Notes - CS 224 is an advanced course in algorithm design, and topics we will cover include the word RAM model, data structures, amortization, online algorithms, linear programming, semidefinite programming, approximation algorithms, hashing, randomized algorithms, fast exponential time algorithms, graph algorithms, and computational geometry. - [Lecture Videos](http://people.seas.harvard.edu/~minilek/cs224/fall14/lec.html) ([Youtube](https://www.youtube.com/playlist?list=PL2SOU6wwxB0uP4rJgf5ayhHWgw7akUWSf)) From ab423f0a838f950b636cb8dac33383eda8d0df0e Mon Sep 17 00:00:00 2001 From: chaorrupted <37760447+chaorrupted@users.noreply.github.com> Date: Fri, 12 Oct 2018 00:37:14 +0300 Subject: [PATCH 09/23] added metu-ceng-nihil --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index 311f04c..5c22624 100644 --- a/README.md +++ b/README.md @@ -488,6 +488,8 @@ Courses - CS10 is UCB's introductory computer science class, taught using the beginners' drag-and-drop language. Students learn about history, social implications, great principles, and future of computing. They also learn the joy of programming a computer using a friendly, graphical language, and will complete a substantial team programming project related to their interests. - [Snap*!*](http://snap.berkeley.edu) (based on Scratch by MIT). - [Curriculum](http://bjc.berkeley.edu) +- [CENG 111](https://nihil.ceng.metu.edu.tr/opc/pcourse/course/1) **Introduction to Computer Engineering Concepts** *Middle East Technical University* Assignments Lecture Notes + - CENG111 is METU's introductory computer engineering class, taught using python. The course itself is more focused around computer science, it's history, principles, and applications. The given link is a collection of bite-size exercises, each accompanied with the respective topic's introduction. There is also an interpreter available within the browser. - [CS 50](https://cs50.harvard.edu/) **Introduction to Computer Science** *Harvard University* Lecture Videos Assignments Lecture Notes - CS50x is Harvard College's introduction to the intellectual enterprises of computer science and the art of programming for majors and non-majors alike, with or without prior programming experience. An entry-level course taught by David J. Malan. - [Lectures](https://cs50.harvard.edu/lectures) From 367fabe3a3cc766e2c938a9158ecc3b3ad7d34ae Mon Sep 17 00:00:00 2001 From: chaorrupted <37760447+chaorrupted@users.noreply.github.com> Date: Fri, 12 Oct 2018 13:16:28 +0300 Subject: [PATCH 10/23] fixed harvard-cs50 broken links --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 5c22624..0a247b0 100644 --- a/README.md +++ b/README.md @@ -492,8 +492,8 @@ Courses - CENG111 is METU's introductory computer engineering class, taught using python. The course itself is more focused around computer science, it's history, principles, and applications. The given link is a collection of bite-size exercises, each accompanied with the respective topic's introduction. There is also an interpreter available within the browser. - [CS 50](https://cs50.harvard.edu/) **Introduction to Computer Science** *Harvard University* Lecture Videos Assignments Lecture Notes - CS50x is Harvard College's introduction to the intellectual enterprises of computer science and the art of programming for majors and non-majors alike, with or without prior programming experience. An entry-level course taught by David J. Malan. - - [Lectures](https://cs50.harvard.edu/lectures) - - [Problem Sets](https://cs50.harvard.edu/psets) + - [Lectures](http://cs50.tv/2017/fall/#lectures) + - [Problem Sets](http://cs50.tv/2017/fall/#about,psets) - The course can also be taken from [edX](https://www.edx.org/course/introduction-computer-science-harvardx-cs50x). - [CS 61A](http://cs61a.org/) **Structure and Interpretation of Computer Programs [Python]** *UC Berkeley* Lecture Videos Assignments Lecture Notes - In CS 61A, we are interested in teaching you about programming, not about how to use one particular programming language. We consider a series of techniques for controlling program complexity, such as functional programming, data abstraction, and object-oriented programming. Mastery of a particular programming language is a very useful side effect of studying these general techniques. However, our hope is that once you have learned the essence of programming, you will find that picking up a new programming language is but a few days' work. From 877c6d79c77cf39d8bc912f232064be41d7c2fd8 Mon Sep 17 00:00:00 2001 From: chaorrupted <37760447+chaorrupted@users.noreply.github.com> Date: Fri, 12 Oct 2018 13:24:08 +0300 Subject: [PATCH 11/23] undo last commit in the ugliest way --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 0a247b0..5c22624 100644 --- a/README.md +++ b/README.md @@ -492,8 +492,8 @@ Courses - CENG111 is METU's introductory computer engineering class, taught using python. The course itself is more focused around computer science, it's history, principles, and applications. The given link is a collection of bite-size exercises, each accompanied with the respective topic's introduction. There is also an interpreter available within the browser. - [CS 50](https://cs50.harvard.edu/) **Introduction to Computer Science** *Harvard University* Lecture Videos Assignments Lecture Notes - CS50x is Harvard College's introduction to the intellectual enterprises of computer science and the art of programming for majors and non-majors alike, with or without prior programming experience. An entry-level course taught by David J. Malan. - - [Lectures](http://cs50.tv/2017/fall/#lectures) - - [Problem Sets](http://cs50.tv/2017/fall/#about,psets) + - [Lectures](https://cs50.harvard.edu/lectures) + - [Problem Sets](https://cs50.harvard.edu/psets) - The course can also be taken from [edX](https://www.edx.org/course/introduction-computer-science-harvardx-cs50x). - [CS 61A](http://cs61a.org/) **Structure and Interpretation of Computer Programs [Python]** *UC Berkeley* Lecture Videos Assignments Lecture Notes - In CS 61A, we are interested in teaching you about programming, not about how to use one particular programming language. We consider a series of techniques for controlling program complexity, such as functional programming, data abstraction, and object-oriented programming. Mastery of a particular programming language is a very useful side effect of studying these general techniques. However, our hope is that once you have learned the essence of programming, you will find that picking up a new programming language is but a few days' work. From 92b876953f62f0b70dbe895a9749d924228448f4 Mon Sep 17 00:00:00 2001 From: chaorrupted <37760447+chaorrupted@users.noreply.github.com> Date: Fri, 12 Oct 2018 13:30:41 +0300 Subject: [PATCH 12/23] fixed & updated harvard cs50 --- README.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 5c22624..ec742ce 100644 --- a/README.md +++ b/README.md @@ -492,9 +492,10 @@ Courses - CENG111 is METU's introductory computer engineering class, taught using python. The course itself is more focused around computer science, it's history, principles, and applications. The given link is a collection of bite-size exercises, each accompanied with the respective topic's introduction. There is also an interpreter available within the browser. - [CS 50](https://cs50.harvard.edu/) **Introduction to Computer Science** *Harvard University* Lecture Videos Assignments Lecture Notes - CS50x is Harvard College's introduction to the intellectual enterprises of computer science and the art of programming for majors and non-majors alike, with or without prior programming experience. An entry-level course taught by David J. Malan. - - [Lectures](https://cs50.harvard.edu/lectures) - - [Problem Sets](https://cs50.harvard.edu/psets) + - [Lectures](http://cs50.tv/2017/fall/#about,lectures) + - [Problem Sets](http://cs50.tv/2017/fall/#about,psets) - The course can also be taken from [edX](https://www.edx.org/course/introduction-computer-science-harvardx-cs50x). + - The course's OpenCourseware resides [here](http://cs50.tv) - [CS 61A](http://cs61a.org/) **Structure and Interpretation of Computer Programs [Python]** *UC Berkeley* Lecture Videos Assignments Lecture Notes - In CS 61A, we are interested in teaching you about programming, not about how to use one particular programming language. We consider a series of techniques for controlling program complexity, such as functional programming, data abstraction, and object-oriented programming. Mastery of a particular programming language is a very useful side effect of studying these general techniques. However, our hope is that once you have learned the essence of programming, you will find that picking up a new programming language is but a few days' work. - [Lecture Resources by Type](http://cs61a.org/by_type.html) From 45d2908613630036a3e3509c317d9c00a7355468 Mon Sep 17 00:00:00 2001 From: chaorrupted <37760447+chaorrupted@users.noreply.github.com> Date: Fri, 12 Oct 2018 13:33:23 +0300 Subject: [PATCH 13/23] undo the last commit so that the two pull requests are seperate --- README.md | 2 -- 1 file changed, 2 deletions(-) diff --git a/README.md b/README.md index ec742ce..7603b88 100644 --- a/README.md +++ b/README.md @@ -488,8 +488,6 @@ Courses - CS10 is UCB's introductory computer science class, taught using the beginners' drag-and-drop language. Students learn about history, social implications, great principles, and future of computing. They also learn the joy of programming a computer using a friendly, graphical language, and will complete a substantial team programming project related to their interests. - [Snap*!*](http://snap.berkeley.edu) (based on Scratch by MIT). - [Curriculum](http://bjc.berkeley.edu) -- [CENG 111](https://nihil.ceng.metu.edu.tr/opc/pcourse/course/1) **Introduction to Computer Engineering Concepts** *Middle East Technical University* Assignments Lecture Notes - - CENG111 is METU's introductory computer engineering class, taught using python. The course itself is more focused around computer science, it's history, principles, and applications. The given link is a collection of bite-size exercises, each accompanied with the respective topic's introduction. There is also an interpreter available within the browser. - [CS 50](https://cs50.harvard.edu/) **Introduction to Computer Science** *Harvard University* Lecture Videos Assignments Lecture Notes - CS50x is Harvard College's introduction to the intellectual enterprises of computer science and the art of programming for majors and non-majors alike, with or without prior programming experience. An entry-level course taught by David J. Malan. - [Lectures](http://cs50.tv/2017/fall/#about,lectures) From 824803f7d162ca051dda8582e11d05a193c4e3ad Mon Sep 17 00:00:00 2001 From: Lucas Gabriel Schneider Date: Fri, 12 Oct 2018 23:19:09 -0300 Subject: [PATCH 14/23] Update README.md --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index 311f04c..d1e1e44 100644 --- a/README.md +++ b/README.md @@ -110,7 +110,7 @@ Courses - [Lecture Notes](http://comp.uark.edu/~wingning/csce3613/CourseNote3613.html) - [Readings](http://comp.uark.edu/~wingning/csce3613/Link3613.html) - [CSCI-UA.0202: Operating Systems (Undergrad)](http://www.cs.nyu.edu/~mwalfish/classes/15sp/index.html) **Operating Systems** *NYU* Assignments Lecture Notes Readings - - NYU's operating system course. It's a fundamental course focusing basic ideas of operating systems, including memory management, process shceduling, file system, ect. It also includes some recomended reading materials. What's more, there are a series of hands-on lab materials, helping you easily understand OS. + - NYU's operating system course. It's a fundamental course focusing basic ideas of operating systems, including memory management, process shceduling, file system, ect. It also includes some recommended reading materials. What's more, there are a series of hands-on lab materials, helping you easily understand OS. - [Assignments](http://www.cs.nyu.edu/~mwalfish/classes/15sp/labs.html) - [Lectures](http://www.cs.nyu.edu/~mwalfish/classes/15sp/syllabus.html) - [Old Exams](http://www.cs.nyu.edu/~mwalfish/classes/15sp/exams.html) @@ -276,7 +276,7 @@ Courses - [Lecture Notes](https://www.dropbox.com/sh/zanwtoflw4pcfu8/5pdT6axS3y) - [Projects](http://matt.might.net/teaching/compilers/spring-2015/#projects) - [CS 6118](http://www.cs.cornell.edu/courses/CS6118/2012fa/) **Types and Semantics** *Cornell University* Lecture NotesReadings - - Types and Semantics is about designing and understand programming languages, whether they be domain specific or general purpose. The goal of this class is to provide a variety of tools for designing custom (programming) languages for whatever task is at hand. Part of that will be a variety of insights on how languages work along with experiences from working with academics and industry on creating new languages such as Ceylon and Kotlin. The class focuses on types and semantics and the interplay between them. This means category theory and constructive type theory (e.g. Coq and richer variations) are ancillary topics of the class. The class also covers unconventional semantic domains such as classical linear type theory in order to both break students from convential thinking and to provide powerful targets capable of formalizing thinks like networking protocols, resource-sensitive computation, and concurrency constructs. The class project is to design and formalize a (programming) language for a purpose of the student's choosing, and assignments are designed to ensure students have had a chance to practice applying the techniques learned in class before culminating these skills in the class project. + - Types and Semantics is about designing and understand programming languages, whether they be domain specific or general purpose. The goal of this class is to provide a variety of tools for designing custom (programming) languages for whatever task is at hand. Part of that will be a variety of insights on how languages work along with experiences from working with academics and industry on creating new languages such as Ceylon and Kotlin. The class focuses on types and semantics and the interplay between them. This means category theory and constructive type theory (e.g. Coq and richer variations) are ancillary topics of the class. The class also covers unconventional semantic domains such as classical linear type theory in order to both break students from conventional thinking and to provide powerful targets capable of formalizing thinks like networking protocols, resource-sensitive computation, and concurrency constructs. The class project is to design and formalize a (programming) language for a purpose of the student's choosing, and assignments are designed to ensure students have had a chance to practice applying the techniques learned in class before culminating these skills in the class project. - [Syllabus](http://www.cs.cornell.edu/courses/CS6118/2012fa/) - [Lectures](http://www.cs.cornell.edu/courses/CS6118/2012fa/) - [CSC 253](http://pgbovine.net/cpython-internals.htm) **CPython internals: A ten-hour codewalk through the Python interpreter source code** *University of Rochester* Lecture VideosReadings @@ -317,7 +317,7 @@ Courses - [CS 61B](http://datastructur.es/sp16/) **Data Structures** *UC Berkeley* Lecture Videos Assignments Lecture Notes Readings - In this course, you will study advanced programming techniques including data structures, encapsulation, abstract data types, interfaces, and algorithms for sorting and searching, and you will get a taste of “software engineering”—the design and implementation of large programs. - - [Full Lecture Materials](http://datastructur.es/sp16/) Lecture of Spring 2016. This website contains full matrials including video links, labs, homeworks, projects. Very good for self-learner. Also a good start for Java. And it includes some other usefull resources for Java Documentation, Data Structure Resources, Git/GitHub and Java Development Resources. [Resources](http://datastructur.es/sp16/resources.html) + - [Full Lecture Materials](http://datastructur.es/sp16/) Lecture of Spring 2016. This website contains full matrials including video links, labs, homeworks, projects. Very good for self-learner. Also a good start for Java. And it includes some other useful resources for Java Documentation, Data Structure Resources, Git/GitHub and Java Development Resources. [Resources](http://datastructur.es/sp16/resources.html) - [Labs](http://www.cs.berkeley.edu/~jrs/61b/lab/index.html) The link to labs and projects is included in the website. - [Lecture Videos](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iC2Khb1B5NnbE7SHPQ1-W17) - [CS 97SI](http://web.stanford.edu/class/cs97si/) **Introduction to Competitive Programming** *Stanford University* Assignments Lecture Notes @@ -759,7 +759,7 @@ skills in vulnerability research, reverse engineering, and binary exploitation. - [CSCI 4976](https://github.com/RPISEC/Malware) **Malware Analysis** *Rensselaer Polytechnic Institute* Lecture NotesAssignments - This repository contains the materials as developed and used by [RPISEC](http://rpis.ec) to teach Malware Analysis at [Rensselaer Polytechnic Institute](http://rpi.edu) in -Fall 2015. This was a university course developed and run soley by students, primarily using the +Fall 2015. This was a university course developed and run solely by students, primarily using the - [EECS 588](https://www.eecs.umich.edu/courses/eecs588/) **Computer & Network Security** *University of Michigan* Lecture Notes Readings - Taught by [J. Alex Halderman](https://jhalderm.com/) who has analyzed the security of Electronic Voting Machines in the [US](https://jhalderm.com/pub/papers/dcvoting-fc12.pdf) and [over](https://jhalderm.com/pub/papers/ivoting-ccs14.pdf) [seas](https://jhalderm.com/pub/papers/evm-ccs10.pdf). - This intensive research seminar covers foundational work and current topics in computer systems security. From 3f64082f9734cde815523fd3cc5e7494e4cbdf8c Mon Sep 17 00:00:00 2001 From: miwojc <32404415+miwojc@users.noreply.github.com> Date: Tue, 16 Oct 2018 16:40:30 -0400 Subject: [PATCH 15/23] Added Fast.ai Introduction to Machine Learning for Coders --- README.md | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/README.md b/README.md index 311f04c..481269c 100644 --- a/README.md +++ b/README.md @@ -685,6 +685,11 @@ Topics covered include probability theory and Bayesian inference; univariate dis - [Book](http://stanford.edu/class/ee103/mma.html) - [Assignments](http://stanford.edu/class/ee103/homework.html) - [Code](http://stanford.edu/class/ee103/julia_files) +- [Fast.ai Introduction to Machine Learning for Coders](http://course.fast.ai/ml.html) *Fast.ai / University of San Francisco* Lecture Videos Lecture Notes Assignments Readings + - There are around 24 hours of lessons, and you should plan to spend around 8 hours a week for 12 weeks to complete the material. The course is based on lessons recorded at the University of San Francisco for the Masters of Science in Data Science program. We assume that you have at least one year of coding experience, and either remember what you learned in high school math, or are prepared to do some independent study to refresh your knowledge. + - [Lecture Videos](http://course.fast.ai/lessonsml1/lessonsml1.html) + - [Lecture Notes](https://medium.com/@hiromi_suenaga/machine-learning-1-lesson-1-84a1dc2b5236) + - [Jupyter Notebooks](https://github.com/fastai/fastai/tree/master/courses/ml1) - [Info 290](http://www.ischool.berkeley.edu/courses/i290-abdt) **Analyzing Big Data with Twitter** *UC Berkeley school of information* Lecture Videos - In this course, UC Berkeley professors and Twitter engineers provide lectures on the most cutting-edge algorithms and software tools for data analytics as applied to Twitter's data. Topics include applied natural language processing algorithms such as sentiment analysis, large scale anomaly detection, real-time search, information diffusion and outbreak detection, trend detection in social streams, recommendation algorithms, and advanced frameworks for distributed computing. - [Lecture Videos](http://www.ischool.berkeley.edu/newsandevents/audiovideo/webcast/21963) From cf8b83f28abc579886c59f7cf8ff9d2ef4e4cacd Mon Sep 17 00:00:00 2001 From: Shmuel Goldfarb Date: Sat, 27 Oct 2018 10:53:25 +0300 Subject: [PATCH 16/23] Fix CS 6810 @ Cornell and update to 2016 version --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index 311f04c..85e10ee 100644 --- a/README.md +++ b/README.md @@ -457,7 +457,7 @@ Courses - [Syllabus](http://www.cs.cornell.edu/~dsteurer/toc13/syllabus/) - [Lectures](http://www.cs.cornell.edu/~dsteurer/toc13/lectures/) - [Assignments](http://www.cs.cornell.edu/~dsteurer/toc13/homework/) -- [CS 6810](http://www.cs.cornell.edu/~dsteurer/complexity12/) **Theory of Computing** *Cornell University* Assignments Lecture Notes Readings +- [CS 6810](https://complexity16.dsteurer.org/) **Theory of Computing** *Cornell University* Assignments Lecture Notes Readings - This graduate course gives a broad introduction to complexity theory, including classical results and recent developments. Complexity theory aims to understand the power of efficient computation (when computational resources like time and space are limited). Many compelling conceptual questions arise in this context. Most of these questions are (surprisingly?) difficult and far from being resolved. Nevertheless, a lot of progress has been made toward understanding them (and also why they are difficult). We will learn about these advances in this course. A theme will be combinatorial constructions with random-like properties, e.g., expander graphs and error-correcting codes. Some examples: - Is finding a solution inherently more difficult than verifying it? - Do more computational resources mean more computing power? @@ -465,9 +465,9 @@ Courses - Are randomized algorithms more powerful than deterministic ones? - Is it easier to solve problems in the average case than in the worst case? - Are quantum computers more powerful than classical ones? - - [Syllabus](http://www.cs.cornell.edu/~dsteurer/complexity12/) - - [Lectures](http://www.cs.cornell.edu/~dsteurer/complexity12/#lectures) - - [Assignments](http://www.cs.cornell.edu/~dsteurer/complexity12/#homework) + - [Syllabus](https://complexity16.dsteurer.org/syllabus/) + - [Lectures](https://complexity16.dsteurer.org/lectures/) + - [Assignments](https://complexity16.dsteurer.org/homework/) - [CSCE 3193](http://www.csce.uark.edu/~sgauch/3193/S11/index.html) **Programming Paradigms** *University of Arkansas (Fayetteville)* Assignments Lecture Notes - Programming in different paradigms with emphasis on object oriented programming, network programming and functional programming. Survey of programming languages, event driven programming, concurrency, software validation. - [Syllabus](http://www.csce.uark.edu/~sgauch/3193/S11/syllabus.html) From 6f32fa907b9a283837a4b1e8ed8b398524c6e73d Mon Sep 17 00:00:00 2001 From: Shmuel Goldfarb Date: Sat, 27 Oct 2018 10:59:49 +0300 Subject: [PATCH 17/23] CS 4820 @ Cornell - update links to 2015 version --- README.md | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index 311f04c..11af9ac 100644 --- a/README.md +++ b/README.md @@ -338,11 +338,10 @@ Courses - This data structures course introduces C++, linked-lists, stacks, queues, trees, numerical representation, hash tables, priority queues, heaps, huffman coding, graphs, and x86 assembly. - [Lectures](http://aaronbloomfield.github.io/pdr/slides/) - [Assignments](http://aaronbloomfield.github.io/pdr/labs/) -- [CS 4820](http://www.cs.cornell.edu/courses/CS4820/2014sp/) **Introduction to Analysis of Algorithms** *Cornell University* Assignments Lecture Notes Readings +- [CS 4820](http://www.cs.cornell.edu/courses/CS4820/2015sp/) **Introduction to Analysis of Algorithms** *Cornell University* Assignments Lecture Notes Readings - This course develops techniques used in the design and analysis of algorithms, with an emphasis on problems arising in computing applications. Example applications are drawn from systems and networks, artificial intelligence, computer vision, data mining, and computational biology. This course covers four major algorithm design techniques (greedy algorithms, divide and conquer, dynamic programming, and network flow), computability theory focusing on undecidability, computational complexity focusing on NP-completeness, and algorithmic techniques for intractable problems, including identification of structured special cases, approximation algorithms, and local search heuristics. - - [Lectures](http://www.cs.cornell.edu/courses/CS4820/2014sp/lectures/) - - [Assignments](http://www.cs.cornell.edu/courses/CS4820/2014sp/homework/) - - [Syllabus](http://www.cs.cornell.edu/courses/CS4820/2014sp/syllabus/) + - [Lectures](http://www.cs.cornell.edu/courses/CS4820/2015sp/lectures/) + - [Syllabus](http://www.cs.cornell.edu/courses/CS4820/2015sp/syllabus/) - [CSCI 104](http://www-scf.usc.edu/~csci104/20142/lectures/) **Data Structures and Object Oriented Design** Assignments Lecture Notes *University of Southern California (USC)* - [Lectures](http://www-scf.usc.edu/~csci104/20142/lectures) - [Labs](http://www-scf.usc.edu/~csci104/20142/labs) From a642983a4220fb4b95d46fde50c8eaabc604b150 Mon Sep 17 00:00:00 2001 From: Shmuel Goldfarb Date: Sat, 27 Oct 2018 11:08:14 +0300 Subject: [PATCH 18/23] Update CS 4812 @ Cornell to 2018 version --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 311f04c..f68b25d 100644 --- a/README.md +++ b/README.md @@ -909,10 +909,10 @@ and anti-analysis techniques. - [Syllabus](http://www.cs.cornell.edu/courses/CS4154/2014fa/about/faq.php) - [Lectures](http://www.cs.cornell.edu/courses/CS4154/2014fa/lectures/index.php) - [Assignments](http://www.cs.cornell.edu/courses/CS4154/2014fa/assignments/index.php) -- [CS 4812](https://courses.cit.cornell.edu/physics4481-7681_2014sp/) **Quantum Information Processing** *Cornell University* Lecture Notes Readings +- [CS 4812](https://courses.cit.cornell.edu/physics4481-7681_2018fa/) **Quantum Information Processing** *Cornell University* Lecture Notes Readings - Hardware that exploits quantum phenomena can dramatically alter the nature of computation. Though constructing a working quantum computer is a formidable technological challenge, there has been much recent experimental progress. In addition, the theory of quantum computation is of interest in itself, offering strikingly different perspectives on the nature of computation and information, as well as providing novel insights into the conceptual puzzles posed by the quantum theory. The course is intended both for physicists, unfamiliar with computational complexity theory or cryptography, and also for computer scientists and mathematicians, unfamiliar with quantum mechanics. The prerequisites are familiarity (and comfort) with finite dimensional vector spaces over the complex numbers, some standard group theory, and ability to count in binary. - - [Syllabus](http://www.cs.cornell.edu/~ginsparg/physics/P4481-P7681-CS4812/Fa12.html) - - [Lectures](https://courses.cit.cornell.edu/physics4481-7681_2014sp/) + - [Syllabus](https://courses.cit.cornell.edu/physics4481-7681_2018fa/) + - [Lectures](https://courses.cit.cornell.edu/physics4481-7681_2018fa/) - [CS 4860](http://www.cs.cornell.edu/courses/CS4860/2012fa/) **Applied Logic** *Cornell University* Assignments Lecture Notes - In addition to basic first-order logic, when taught by Computer Science this course involves elements of Formal Methods and Automated Reasoning. Formal Methods is concerned with proving properties of algorithms, specifying programming tasks and synthesizing programs from proofs. We will use formal methods tools such as interactive proof assistants (see [www.nuprl.org](http://www.nuprl.org)). We will also spend two weeks on constructive type theory, the language used by the Coq and Nuprl proof assistants. - [Syllabus](http://www.cs.cornell.edu/courses/CS4860/2012fa/schedule.php) From 7f007129a0533c68ae188cb2027f3c8e5b58bd2e Mon Sep 17 00:00:00 2001 From: Yu Zhou Date: Sun, 25 Nov 2018 06:05:46 -0800 Subject: [PATCH 19/23] Get rid of redundant material --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 311f04c..e44d153 100644 --- a/README.md +++ b/README.md @@ -380,7 +380,7 @@ Courses - [Handouts](http://courses.csail.mit.edu/iap/interview/materials.php) - [Topics Covered](http://courses.csail.mit.edu/iap/interview/calendar.php) - [6.006](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/index.htm) **Introduction to Algorithms** *MIT* Lecture VideosAssignments Readings - - This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. + - This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. - [Lecture Videos](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/lecture-videos/) - [Assignments](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/assignments/) - [Readings](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/readings/) From 62992c04875ed6e82e3a40a05fb9a599bdadb2c3 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Mustafa=20=C4=B0lhan?= Date: Tue, 15 Oct 2019 22:10:38 +0300 Subject: [PATCH 20/23] Add Embedded Systems course --- README.md | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/README.md b/README.md index 7ed0bfc..d0e34bd 100644 --- a/README.md +++ b/README.md @@ -131,6 +131,11 @@ Courses - [ECE 459](http://patricklam.ca/p4p/) **Programming for Performance** *University of Waterloo* Lecture Notes Assignments - Learn techniques for profiling, rearchitecting, and implementing software systems that can handle industrial-sized inputs, and to design and build critical software infrastructure. Learn performance optimization through parallelization, multithreading, async I/O, vectorization and GPU programming, and distributed computing. - [Lecture slides](https://github.com/patricklam/p4p-2015/tree/master/lectures) +- [ECGR4101/5101](https://webpages.uncc.edu/~jmconrad/EducationalMaterials/index.html) **Embedded Systems using the Renesas RX63N Processor** *University of North Carolina at Charlotte* Lecture Videos Readings + - Introduction to designing microcontroller-based embedded computer systems using assembly and C programs. Examination of Real-time Operating Systems and their impact on performance. Computer engineering applications will be emphasized. + - The goal of this course is to solidify and build upon a student’s knowledge of computer organization by presenting hands-on experience with microcontrollers. Students will also examine a few sensors that are used in commercial and medical products and learn how to interface them in a microcontroller system. + - [Lecture Videos](https://www.youtube.com/playlist?list=PLPIqCiMhcdO5gxLJWt_hY5CPMzqg75IU5) + - [Lecture Notes](https://webpages.uncc.edu/~jmconrad/EducationalMaterials/index.html) - [PODC](http://dcg.ethz.ch/lectures/podc_allstars/) **Principles of Distributed Computing** *ETH-Zurich* Assignments Readings Lecture Notes - Explore essential algorithmic ideas and lower bound techniques, basically the "pearls" of distributed computing in an easy-to-read set of lecture notes, combined with complete exercises and solutions. - [Book](http://dcg.ethz.ch/lectures/podc_allstars/lecture/podc.pdf) From a3cdac62a536d28ba9a0a2f767790a7088dcd274 Mon Sep 17 00:00:00 2001 From: Jason Barr Date: Sun, 8 Mar 2020 19:48:37 -0500 Subject: [PATCH 21/23] Fix URL for CMU 14-740 course website The website link for Carnegie Mellon's graduate level networking course was incorrect. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 7ed0bfc..2bd4dcc 100644 --- a/README.md +++ b/README.md @@ -999,7 +999,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/F17/) **Fundamentals of Computer Networks** *CMU* Lecture Videos Assignments Readings Lecture Notes +- [14-740](http://ini740.com/F19/) **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. From 5512213b44626c4c497939e0309c4c7684b1dc20 Mon Sep 17 00:00:00 2001 From: Mogilnikov Alexey Date: Sun, 29 Nov 2020 20:45:50 +0300 Subject: [PATCH 22/23] Fix dead link of Fundamentals of Networks --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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. From 7e768f03649228a44403beade9d0a950d5560b13 Mon Sep 17 00:00:00 2001 From: rjmacaranas <33107245+rjmacaranas@users.noreply.github.com> Date: Wed, 8 May 2019 14:25:54 -0700 Subject: [PATCH 23/23] fixed a typo on line 113; shceduling > scheduling --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 7d85eeb..af730fa 100644 --- a/README.md +++ b/README.md @@ -110,7 +110,7 @@ Courses - [Lecture Notes](http://comp.uark.edu/~wingning/csce3613/CourseNote3613.html) - [Readings](http://comp.uark.edu/~wingning/csce3613/Link3613.html) - [CSCI-UA.0202: Operating Systems (Undergrad)](http://www.cs.nyu.edu/~mwalfish/classes/15sp/index.html) **Operating Systems** *NYU* Assignments Lecture Notes Readings - - NYU's operating system course. It's a fundamental course focusing basic ideas of operating systems, including memory management, process shceduling, file system, ect. It also includes some recommended reading materials. What's more, there are a series of hands-on lab materials, helping you easily understand OS. + - NYU's operating system course. It's a fundamental course focusing basic ideas of operating systems, including memory management, process scheduling, file system, ect. It also includes some recommended reading materials. What's more, there are a series of hands-on lab materials, helping you easily understand OS. - [Assignments](http://www.cs.nyu.edu/~mwalfish/classes/15sp/labs.html) - [Lectures](http://www.cs.nyu.edu/~mwalfish/classes/15sp/syllabus.html) - [Old Exams](http://www.cs.nyu.edu/~mwalfish/classes/15sp/exams.html)