Data

Tools

Indexes

Applications

Experiments

Awesome

An open API service indexing awesome lists of open source software.

https://github.com/prakhar1989/awesome-courses

:books: List of awesome university courses for learning Computer Science!
https://github.com/prakhar1989/awesome-courses

List: awesome-courses

awesome awesome-list computer-science courses

Last synced: 8 months ago
JSON representation

:books: List of awesome university courses for learning Computer Science!

Awesome Lists containing this project

README 

          
# Awesome CS Courses [![Awesome](https://cdn.rawgit.com/sindresorhus/awesome/d7305f38d29fed78fa85652e3a63e154dd8e8829/media/badge.svg)](https://github.com/sindresorhus/awesome)



Introduction

------------



There are a lot of ~~hidden~~ treasures lying within university pages scattered across the internet. This list is an attempt to bring to light those awesome CS courses which make their high-quality materials, i.e. assignments, lectures, notes, readings and examinations, available online for free.



Table of Contents

-----------------



- [Algorithms](#algorithms)

- [Artificial Intelligence](#artificial-intelligence)

- [Computer Graphics](#computer-graphics)

- [CS Theory](#cs-theory)

- [Introduction to CS](#introduction-to-cs)

- [Machine Learning](#machine-learning)

- [Misc](#misc)

- [Programming Languages / Compilers](#programming-languages--compilers)

- [Security](#security)

- [Systems](#systems)

- [Statistics / Regression](#statistics)



### Legend



- Lecture Videos - Lecture Videos

- Lecture Notes - Lecture Notes

- Assignments - Assignments / Labs

- Readings - Readings



Courses

-------



### Systems



- [CS 61C](http://www-inst.eecs.berkeley.edu/~cs61c/sp15/) **Great Ideas in Computer Architecture (Machine Structures)** *UC Berkeley* Lecture Videos Lecture Notes Assignments Readings

	- The subjects covered in this course include: C and assembly language programming, translation of high-level programs into machine language, computer organization, caches, performance measurement, parallelism, CPU design, warehouse-scale computing, and related topics.

	- [Lecture Videos](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iCl2-D-FS5mk0jFF6cYSJs_?sort=titleSorter)

	- [Lecture Notes](http://www-inst.eecs.berkeley.edu/~cs61c/sp15/#Calendar)

	- [Resources](http://www-inst.eecs.berkeley.edu/~cs61c/sp15/#Resources)

	- [Old Exams](https://hkn.eecs.berkeley.edu/exams/course/CS/61C)

- [CS 107](https://courseware.stanford.edu/pg/courses/lectures/371747) **Computer Organization & Systems** *Stanford University* Lecture Videos Assignments

	- CS107 is the third course in Stanford's introductory programming sequence. The course will work from the C programming language down to the microprocessor to de-mystify the machine. With a complete understanding of how computer systems execute programs and manipulate data, you will become a more effective programmer, especially in dealing with issues of debugging, performance, portability, and robustness.

	- [Lecture Videos](https://www.youtube.com/playlist?list=PL08D9FA018A965057&spfreload=10)

	- [Assignments](http://web.stanford.edu/class/cs107/assignments.html)

- [CS 140](http://web.stanford.edu/~ouster/cgi-bin/cs140-spring14/lectures.php) **Operating Systems** *Stanford University* Assignments Lecture Notes

	- This class introduces the basic facilities provided in modern operating systems. The course divides into three major sections. The first part of the course discusses concurrency. The second part of the course addresses the problem of memory management. The third major part of the course concerns file systems.

	- [Lecture Notes](http://web.stanford.edu/~ouster/cgi-bin/cs140-spring14/lectures.php)

	- [Assignments](http://web.stanford.edu/~ouster/cgi-bin/cs140-spring14/projects.php)

- [6.004](https://6004.mit.edu/) **Computation Structures** *MIT* Assignments Lecture Notes Lecture Videos

	- Introduces architecture of digital systems, emphasizing structural principles common to a wide range of technologies. Multilevel implementation strategies; definition of new primitives (e.g., gates, instructions, procedures, processes) and their mechanization using lower-level elements. Analysis of potential concurrency; precedence constraints and performance measures; pipelined and multidimensional systems. Instruction set design issues; architectural support for contemporary software structures. 4 Engineering Design Points. 6.004 offers an introduction to the engineering of digital systems. Starting with MOS transistors, the course develops of series of building blocks logic gates, combinational and sequential circuits, finite-state machines, computers and finally complete systems. Both hardware and software mechanisms are explored through a series of design examples.

	- [Youtube Playlist](https://www.youtube.com/watch?v=9DWlqtsNGV0&index=1&list=PLmP5iIyVnKPQ-cO_EENdUgEdlRf0u5LYa)

	- [Lecture Notes](http://computationstructures.org/notes/tradeoffs/notes.html)

	- [Labs-Assignments](http://computationstructures.org/exercises/cmos/lab.html)

- [CS 162](http://cs162.eecs.berkeley.edu/) **Operating Systems and Systems Programming** *UC Berkeley* Lecture Videos Lecture Notes Assignments Readings

	- The purpose of this course is to teach the design of operating systems and operating systems concepts that appear in other advanced systems. Topics we will cover include concepts of operating systems, systems programming, networked and distributed systems, and storage systems, including multiple-program systems (processes, interprocess communication, and synchronization), memory allocation (segmentation, paging), resource allocation and scheduling, file systems, basic networking (sockets, layering, APIs, reliability), transactions, security, and privacy.

		- Operating Systems course by the Chair of EECS, UC Berkeley [David Culler](http://www.cs.berkeley.edu/~culler/)

		- [Lecture Videos](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c) Spring 2015 lectures

		- [Lecture Notes](https://inst.eecs.berkeley.edu/~cs162/sp15/) Spring 2015 lectures

- [CS 168](https://inst.eecs.berkeley.edu/~cs168/fa14/) **Introduction to the Internet: Architecture and Protocols** *UC Berkeley* Lecture Notes Assignments

	- This course is an introduction to the Internet architecture. We will focus on the concepts and fundamental design principles that have contributed to the Internet's scalability and robustness and survey the various protocols and algorithms used within this architecture. Topics include layering, addressing, intradomain routing, interdomain routing, reliable delivery, congestion control, and the core protocols (e.g., TCP, UDP, IP, DNS, and HTTP) and network technologies (e.g., Ethernet, wireless).

	- [Lecture Notes & Assignments](https://inst.eecs.berkeley.edu/~cs168/fa14/class.html)

	- [Discussion Notes](https://inst.eecs.berkeley.edu/~cs168/fa14/)

- [CS 179](http://courses.cms.caltech.edu/cs179/) **GPU Programming** *Caltech*  Assignments Lecture Notes

	- This course will cover programming techniques for the GPU. The course will introduce NVIDIA's parallel computing language, CUDA. Beyond covering the CUDA programming model and syntax, the course will also discuss GPU architecture, high performance computing on GPUs, parallel algorithms, CUDA libraries, and applications of GPU computing. 

	- [Assignments](http://courses.cms.caltech.edu/cs179/)

	- [Lecture Notes](http://courses.cms.caltech.edu/cs179/)

- [CS 186](https://sites.google.com/site/cs186spring2015/) **Introduction to Database Systems** *UC Berkeley* Lecture Videos Assignments Readings Lecture Notes

	- In the project assignments in CS186, you will write a basic database management system called SimpleDB. For this project, you will focus on implementing the core modules required to access stored data on disk; in future projects, you will add support for various query processing operators, as well as transactions, locking, and concurrent queries.

	- [Lecture Videos](https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBVK2QzAV-R7NMA1ZkaiR2y)

	- [Lecture Notes](https://sites.google.com/site/cs186fall2013/section-notes)

	- [Projects](https://sites.google.com/site/cs186fall2013/homeworks)

- [CS 241](https://courses.engr.illinois.edu/cs241/sp2016/index.html) **Systems Programming (Spring 2016)** *Univ of Illinois, Urbana-Champaign* Assignments Lecture Notes

	- System programming refers to writing code that tasks advantage of operating system support for programmers. This course is designed to introduce you to system programming. By the end of this course, you should be proficient at writing programs that take full advantage of operating system support. To be concrete, we need to fix an operating system and we need to choose a programming language for writing programs. We chose the C language running on a Linux/UNIX operating system (which implements the POSIX standard interface between the programmer and the OS).

	- [Assignments](https://courses.engr.illinois.edu/cs241/sp2016/mps.html)

	- [Labs](https://courses.engr.illinois.edu/cs241/sp2016/labs.html)

	- [Github Page](http://angrave.github.io/sys/#)

	- [Crowd Sourced Book](https://github.com/angrave/SystemProgramming/wiki)

- [CS 425](https://courses.engr.illinois.edu/cs425/fa2016/index.html) **Distributed Systems** *Univ of Illinois, Urbana-Champaign* Assignments Readings

	- Brilliant set of lectures and reading material covering fundamental concepts in distributed systems such as Vector clocks, Consensus and Paxos. This is the 2016 version by Prof Indranil Gupta.

	- [Lectures](https://courses.engr.illinois.edu/cs425/fa2016/lectures.html)

	- [Assignments](https://courses.engr.illinois.edu/cs425/fa2016/assignments.html)

- [CS 452](http://www.cgl.uwaterloo.ca/~wmcowan/teaching/cs452/s12/) **Real-Time Programming** *University of Waterloo*  Assignments Lecture Notes

	- Write a real-time OS microkernel in C, and application code to operate a model train set in response to real-time sensor information. The communication with the train set runs at 2400 baud so it takes about 61 milliseconds to ask all of the sensors for data about the train's possible location.  This makes it particularly challenging because a train can move about 3 centimeters in that time. One of the most challenging and time-consuming courses at the University of Waterloo.

	- [Assignments](http://www.cgl.uwaterloo.ca/~wmcowan/teaching/cs452/s12/assignments/index.html)

	- [Lecture notes](http://www.cgl.uwaterloo.ca/~wmcowan/teaching/cs452/s12/notes/index.html)

- [CS 2043](http://www.cs.cornell.edu/courses/CS2043/2014sp/) **Unix Tools & Scripting** *Cornell University* Assignments Lecture Notes Readings

	- UNIX-like systems are increasingly being used on personal computers, mobile phones, web servers, and many other systems. They represent a wonderful family of programming environments useful both to computer scientists and to people in many other fields, such as computational biology and computational linguistics, in which data is naturally represented by strings. This course provides an intensive training to develop skills in Unix command line tools and scripting that enable the accomplishment and automation of large and challenging computing tasks. The syllabus takes students from shell basics and piping, to regular-expression processing tools, to shell scripting and Python.

	- [Syllabus](http://www.cs.cornell.edu/courses/CS2043/2014sp/)

	- [Lectures](http://www.cs.cornell.edu/courses/CS2043/2014sp/)

	- [Assignments](http://www.cs.cornell.edu/courses/CS2043/2014sp/)

- [CS 3410](http://www.cs.cornell.edu/courses/cs3410/2016fa/) **Computer System Organization and Programming** *Cornell University* Assignments Lecture Notes Readings

	- CS3410 provides an introduction to computer organization, systems programming and the hardware/software interface. Topics include instruction sets, computer arithmetic, datapath design, data formats, addressing modes, memory hierarchies including caches and virtual memory, I/O devices, bus-based I/O systems, and multicore architectures. Students learn assembly language programming and design a pipelined RISC processor.

	- [Lectures](http://www.cs.cornell.edu/courses/CS3410/2014sp/schedule.html)

	- [Assignments](http://www.cs.cornell.edu/courses/CS3410/2014sp/schedule.html)

- [CS 4410](http://www.cs.cornell.edu/courses/CS4410/2014fa/) **Operating Systems** *Cornell University* Lecture Notes Readings

	- CS 4410 covers systems programming and introductory operating system design and implementation. We will cover the basics of operating systems, namely structure, concurrency, scheduling, synchronization, memory management, filesystems, security and networking. The course is open to any undergraduate who has mastered the material in CS3410/ECE3140.

	- [Syllabus](http://www.cs.cornell.edu/courses/CS4410/2014fa/slides/01-intro.pptx)

	- [Lectures](http://www.cs.cornell.edu/courses/CS4410/2014fa/lectures.php)

- [CS 4414](http://rust-class.org/index.html) **Operating Systems** *University of Virginia* Lecture Videos Assignments

	- A course (that) covers topics including: Analysis process communication and synchronization; resource management; virtual memory management algorithms; file systems; and networking and distributed systems. The primary goal of this course is to improve your ability to build scalable, robust and secure computing systems. It focuses on doing that by understanding what underlies the core abstractions of modern computer systems.

	- [Syllabus](http://rust-class.org/pages/syllabus.html)

	- [Lectures](http://rust-class.org/pages/classes.html)

- [CS 5412](http://www.cs.cornell.edu/Courses/CS5412/2014sp/) **Cloud Computing** *Cornell University* Lecture Notes Readings

	- Taught by one of the stalwarts of this field, Prof Ken Birman, this course has a fantastic set of slides that one can go through. The Prof's [book](http://www.amazon.com/Guide-Reliable-Distributed-Systems-High-Assurance/dp/1447124154) is also a gem and recommended as a must read in Google's tutorial on [Distributed System Design](http://www.hpcs.cs.tsukuba.ac.jp/~tatebe/lecture/h23/dsys/dsd-tutorial.html)

	- [Slides](http://www.cs.cornell.edu/Courses/CS5412/2014sp/Syllabus.htm)

- [CSCE 3613](http://comp.uark.edu/~wingning/csce3613/csce3613.html) **Operating Systems** *University of Arkansas (Fayetteville)* Assignments Lecture Notes Readings	- An introduction to operating systems including topics in system structures, process management, storage management, files, distributed systems, and case studies.

	- [Syllabus](http://comp.uark.edu/~wingning/csce3613/CSCE3613.pdf)

	- [Assignments](http://comp.uark.edu/~wingning/csce3613/Homework3613.html)

	- [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 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)

- [CSCI 360](http://compsci.hunter.cuny.edu/~sweiss/course_materials/csci360/csci360_f14.php) **Computer Architecture 3** *CUNY Hunter College* Assignments Lecture Notes

	-  A course that covers cache design, buses, memory hierarchies, processor-peripheral interfaces, and multiprocessors, including GPUs.

- [CSCI 493.66](http://compsci.hunter.cuny.edu/~sweiss/course_materials/csci493.66/csci493.66_spr12.php) **UNIX System Programming (formerly UNIX Tools)** *CUNY Hunter College* Assignments Lecture Notes

	- A course that is mostly about writing programs against the UNIX API, covering all of the basic parts of the kernel interface and libraries, including files, processes, terminal control, signals, and threading.

- [CSCI 493.75](http://compsci.hunter.cuny.edu/~sweiss/course_materials/csci493.65/csci493.65_spr14.php) **Parallel Computing** *CUNY Hunter College* Assignments Lecture Notes

	- The course is an introduction to parallel algorithms and parallel programming in C and C++, using the Message Passing Interface (MPI) and the OpenMP application programming interface. It also includes a brief introduction to parallel architectures and interconnection networks. It is both theoretical and practical, including material on design methodology, performance analysis, and mathematical concepts, as well as details on programming using MPI and OpenMP.

- [Hack the Kernel](https://www.ops-class.org/) **Introduction to Operating Systems** *SUNY University at Buffalo, NY* Lecture Videos Assignments Lecture Notes

	- This course is an introduction to operating system design and implementation. We study operating systems because they are examples of mature and elegant solutions to a difficult design problem: how to safely and efficiently share system resources and provide abstractions useful to applications.

	- For the processor, memory, and disks, we discuss how the operating system allocates each resource and explore the design and implementation of related abstractions. We also establish techniques for testing and improving system performance and introduce the idea of hardware virtualization. Programming assignments provide hands-on experience with implementing core operating system components in a realistic development environment. Course by [Dr.Geoffrey Challen](https://blue.cse.buffalo.edu/people/gwa/)

	- [Syllabus](https://www.ops-class.org/courses/buffalo/CSE421_Spring2016/)

	- [Slides](https://www.ops-class.org/slides/)

	- [Video lectures](https://www.youtube.com/playlist?list=PLE6LEE8y2Jp-kbEcVR2W3vfx0Pdca0BD3)

	- [Assignments](https://www.ops-class.org/asst/0/)

	- [Old Exams](https://www.ops-class.org/exams/)

- [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)

	- [Assignments and Solutions](http://dcg.ethz.ch/lectures/podc_allstars/)

- [SPAC](http://homes.cs.washington.edu/~djg/teachingMaterials/spac/) **Parallelism and Concurrency** *Univ of Washington* Readings

	- Technically not a course nevertheless an awesome collection of materials used by Prof Dan Grossman to teach parallelism and concurrency concepts to sophomores at UWash

- [6.824](http://css.csail.mit.edu/6.824/2014/index.html) **Distributed Systems** *MIT* Assignments Lecture Notes

	- MIT's graduate-level DS course with a focus on fault tolerance, replication, and consistency, all taught via awesome lab assignments in Golang!

	- [Assignments](http://css.csail.mit.edu/6.824/2014/labs/) - Just do `git clone git://g.csail.mit.edu/6.824-golabs-2014 6.824`

	- [Readings](http://css.csail.mit.edu/6.824/2014/schedule.html)

- [6.828](http://pdos.csail.mit.edu/6.828/2014/) **Operating Systems** *MIT* Assignments Lecture Notes

	- MIT's operating systems course focusing on the fundamentals of OS design including booting, memory management, environments, file systems, multitasking, and more. In a series of lab assignments, you will build JOS, an OS exokernel written in C.

	- [Assignments](http://pdos.csail.mit.edu/6.828/2014/labguide.html)

	- [Lectures](http://pdos.csail.mit.edu/6.828/2014/schedule.html)

	- [Videos](http://pdos.csail.mit.edu/6.828/2011/schedule.html) Note: These are student recorded cam videos of the 2011 course. The videos  explain a lot of concepts required for the labs and assignments.

- [CSEP 552](http://courses.cs.washington.edu/courses/csep552/16wi/) **Distributed Systems** *University of Washington* Lecture Videos Assignments Lecture Notes

	- CSEP552 is a graduate course on distributed systems. Distributed systems have become central to many aspects of how computers are used, from web applications to e-commerce to content distribution. This course will cover abstractions and implementation techniques for the construction of distributed systems, including client server computing, the web, cloud computing, peer-to-peer systems, and distributed storage systems. Topics will include remote procedure call, maintaining consistency of distributed state, fault tolerance, high availability, and other topics. As we believe the best way to learn the material is to build it, there will be a series of hands-on programming projects.

	- [Lectures](http://courses.cs.washington.edu/courses/csep552/13sp/video/) of a previous session are available to watch.

- [15-213](http://www.cs.cmu.edu/~213/) **Introduction to Computer Systems (ICS)** *Carnegie-Mellon University*  Lecture Videos Assignments Lecture Notes

	- The ICS course provides a programmer's view of how computer systems execute programs, store information, and communicate. It enables students to become more effective programmers, especially in dealing with issues of performance, portability and robustness. It also serves as a foundation for courses on compilers, networks, operating systems, and computer architecture, where a deeper understanding of systems-level issues is required. Topics covered include: machine-level code and its generation by optimizing compilers, performance evaluation and optimization, computer arithmetic, memory organization and management, networking technology and protocols, and supporting concurrent computation.

	- This is the must-have course for everyone in CMU who wants to learn some computer science no matter what major are you in. Because it's CMU (The course number is as same as the zip code of CMU)!

	- [Lecture Notes](http://www.cs.cmu.edu/~213/schedule.html)

	- [Videos](https://scs.hosted.panopto.com/Panopto/Pages/Sessions/List.aspx#folderID=%22b96d90ae-9871-4fae-91e2-b1627b43e25e%22) 

	- [Assignments](http://csapp.cs.cmu.edu/public/labs.html)

- [15-319/619](http://www.cs.cmu.edu/~msakr/15619-s17/recitations.html) **Cloud Computing (ICS)** *Carnegie-Mellon University*  Lecture Videos Assignments 

	- This project-based on-line course focuses on skill building across various aspects of cloud computing. We cover conceptual topics and provide hands-on experience through projects utilizing public cloud infrastructures (Amazon Web Services (AWS), Microsoft Azure and Google Cloud Platform (GCP)). The adoption of cloud computing services continues to grow across a variety of organizations and in many domains. Simply, cloud computing is the delivery of computing as a service over a network, whereby distributed resources and services are rented, rather than owned, by an end user as a utility.

	- For the projects, students will work with Amazon Web Services, Microsoft Azure and Google Cloud Platform, use them to rent and provision compute resources and then program and deploy applications that run on these resources. Students will develop and evaluate virtual machine (VM) and container scaling, elasticity and load balancing solutions. In addition, students will work with cloud storage systems and learn to develop different applications using batch, iterative and stream processing frameworks. 15-619 students will have to complete an extra project which entails designing and implementing a complete web-service solution for querying big data. For the extra project, the student teams are evaluated based on the cost and performance of their web service.

	- [Lecture Notes](http://www.cs.cmu.edu/~msakr/15619-s17/recitations.html)

	- [Videos](http://www.cs.cmu.edu/~msakr/15619-s17/recitations.html) 

- [15-410](https://www.cs.cmu.edu/~410/) **Operating System Design and Implementation** *Carnegie-Mellon University*  Lecture Notes Assignments 

	-  This awesome course covers some fundamental topics of operating system, such as process model, virtual memory concurrency, threads, locking, interrupts, preemptibility, race conditions. It also covers introductory understanding of typical OS topics (file systems, transactions, scheduling, security concepts and technologies, memory consistency)Parallel programming models / frameworks.

	- [Lecture Notes](https://www.cs.cmu.edu/~410/lecture.html) 

	- [Assignments](https://www.cs.cmu.edu/~410/p1/proj1.html)

- [15-418](http://15418.courses.cs.cmu.edu/spring2015/) **Parallel Computer Architecture and Programming** *Carnegie-Mellon University* Lecture Videos Assignments Lecture Notes Readings

	- The goal of this course is to provide a deep understanding of the fundamental principles and engineering trade-offs involved in designing modern parallel computing systems as well as to teach parallel programming techniques necessary to effectively utilize these machines. Because writing good parallel programs requires an understanding of key machine performance characteristics, this course will cover both parallel hardware and software design.

	- [Assignments](http://15418.courses.cs.cmu.edu/spring2015/exercises)

	- [Lecture Notes](http://15418.courses.cs.cmu.edu/spring2015/reading)

	- [Lecture Videos](https://scs.hosted.panopto.com/Panopto/Pages/Sessions/List.aspx#folderID=%22a5862643-2416-49ef-b46b-13465d1b6df0%22)

	- [Readings](http://15418.courses.cs.cmu.edu/spring2015/reading)

- [15-440](http://www.cs.cmu.edu/~dga/15-440/F12/index.html) **Distributed Systems** *Carnegie-Mellon University*  Assignments Lecture Notes

	- Introduction to distributed systems with a focus on teaching concepts via projects implemented in the Go programming language.

	- [Assignments](http://www.cs.cmu.edu/~dga/15-440/F12/assignments.html)

- [15-721](http://15721.courses.cs.cmu.edu/spring2016/) **Database Systems** *Carnegie-Mellon University* Lecture Videos Assignments Readings

	- This course is a comprehensive study of the internals of modern database management systems. It will cover the core concepts and fundamentals of the components that are used in both high-performance transaction processing systems (OLTP) and large-scale analytical systems (OLAP). The class will stress both efficiency and correctness of the implementation of these ideas. All class projects will be in the context of a real in-memory, multi-core database system. The course is appropriate for graduate students in software systems and for advanced undergraduates with strong systems programming skills.

	- [Assignments](http://15721.courses.cs.cmu.edu/spring2016/syllabus.html)

	- [Lecture Videos](https://www.youtube.com/playlist?list=PLSE8ODhjZXjbisIGOepfnlbfxeH7TW-8O)

	- [Readings](http://15721.courses.cs.cmu.edu/spring2016/schedule.html)

- [15-445/645](http://15445.courses.cs.cmu.edu/fall2017/) **Database Systems** *Carnegie-Mellon University* Lecture Videos Assignments Readings

	- This course covers fundamental topics of DBMS, compared to CMU 15-721. 

	- [Assignments](http://15445.courses.cs.cmu.edu/fall2017/assignments.html)

	- [Lecture Videos](https://www.youtube.com/playlist?list=PLSE8ODhjZXjYutVzTeAds8xUt1rcmyT7x)

	- [Readings](http://15445.courses.cs.cmu.edu/fall2017/schedule.html)

- [15-749](http://www.andrew.cmu.edu/course/15-749/) **Engineering Distributed Systems** *Carnegie-Mellon University* Readings	

 	- A project focused course on Distributed Systems with an awesome list of readings

	- [Readings](http://www.andrew.cmu.edu/course/15-749/READINGS/)

- [18-447](http://www.ece.cmu.edu/~ece447/s15/doku.php?id=start) **Introduction to Computer Architecture** *CMU* Lecture Videos Assignments Readings

	- Very comprehensive material on Computer Architecture - definitely more than just "introduction". Online material is very user-friendly, even the recitation videos available online. This is the Spring'15 version by Prof. [Onur Mutlu ](http://users.ece.cmu.edu/~omutlu/)

	- [Lectures and Recitation](http://www.ece.cmu.edu/~ece447/s15/doku.php?id=schedule)

	- [Homeworks](http://www.ece.cmu.edu/~ece447/s15/doku.php?id=homeworks) 7 HWs with answer set as well

	- [Readings](http://www.ece.cmu.edu/~ece447/s15/doku.php?id=readings)



--------

### Programming Languages / Compilers



- [CS 75](https://www.cs.swarthmore.edu/~jpolitz/cs75/s16/index.html) **Principles of Compiler Design** *Swathmore College* Lecture Videos Assignments Lecture Notes

	- Modelled after the influential paper on [incremental approach to compiler design](http://scheme2006.cs.uchicago.edu/11-ghuloum.pdf), this course teaches how to build a compiler in OCaml

	- [Course on Github](https://github.com/compilers-course-materials)

	- [Notes](https://github.com/compilers-course-materials/cs75-s16-lectures)

- [CS 91](https://www.cs.swarthmore.edu/~jpolitz/cs91/s15/index.html) **Introduction to Programming Languages** *Swathmore College* Lecture Notes Assignments

	- Uses the [Pyret](https://www.pyret.org/) programming language & [PAPL](http://papl.cs.brown.edu/2014/) book to understand the fundamentals of programming languages.

	- [Labs](https://www.cs.swarthmore.edu/~jpolitz/cs91/s15/s_labs.html)

- [CIS 194](http://www.seas.upenn.edu/~cis194/) **Introduction to Haskell** *Penn Engineering* Assignments Lecture Notes

	- Explore the joys of functional programming, using Haskell as a vehicle. The aim of the course will be to allow you to use Haskell to easily and conveniently write practical programs.

	- [Previous](http://www.seas.upenn.edu/~cis194/spring13/index.html) semester also available, with more exercises

- [CIS 198](http://cis198-2016s.github.io/) **Rust Programming** *UPenn* Lecture Notes Assignments

	- This course covers what makes Rust so unique and applies it to practical systems programming problems. Topics covered include traits and generics; memory safety (move semantics, borrowing, and lifetimes); Rust’s rich macro system; closures; and concurrency.

	- [Assignments](https://github.com/cis198-2016s/homework)

- [CMSC 430](http://www.cs.umd.edu/class/spring2015/cmsc430/) **Introduction to Compilers** *Univ of Maryland* Assignments Lecture Notes

	- The goal of CMSC 430 is to arm students with the ability to design, implement, and extend a programming language. Throughout the course, students will design and implement several related languages, and will explore parsing, syntax querying, dataflow analysis, compilation to bytecode, type systems, and language interoperation. 

	- [Lecture Notes](http://www.cs.umd.edu/class/spring2015/cmsc430/Schedule.html)

	- [Assignments](http://www.cs.umd.edu/class/spring2015/cmsc430/Projects.html)

- [Corsopl](https://pradella.faculty.polimi.it/PL.html) **Principles of Programming Languages** *Politecnico di Milano*  Lecture Notes - Lecture Notes Readings - Readings

	- This course gives an overview of Scheme, Haskell and Erlang while analyzing the languages' similarities and differences. As a result, many important/prevalent concepts and how they manifest differently in different programming languages are explained. Among these are (purely) functional programming, object orientation, type inference and evaluation order.

	- Thorough introduction to functional programming with no preknowledge in any functional language required.	

- [COS 326](http://www.cs.princeton.edu/~dpw/courses/cos326-12/info.php) **Functional Programming** *Princeton University* Assignments Lecture Notes

	- Covers functional programming concepts like closures, tail-call recursion & parallelism using the OCaml programming language

	- [Lectures](http://www.cs.princeton.edu/~dpw/courses/cos326-12/lectures.php)

	- [Assignments](http://www.cs.princeton.edu/~dpw/courses/cos326-12/assignments.php)

- [CS 143](https://web.stanford.edu/class/cs143/) **Compiler construction** *Stanford University* Lecture Notes Assignments

	- CS143 is a Stanford's course in the practical and theoretical aspects of compiler construction.

	- [Home](https://web.stanford.edu/class/cs143/)

	- [Syllabus](https://web.stanford.edu/class/cs143/syllabus.html)

	- [Lectures](https://web.stanford.edu/class/cs143/)

	- [Assignments](https://web.stanford.edu/class/cs143/)

	- [CS143 - 2011](http://www.keithschwarz.com/cs143/WWW/sum2011/)

- [CS 164](https://sites.google.com/a/bodik.org/cs164/home) **Hack your language!** *UC Berkeley* Lecture Videos Assignments Lecture Notes

	- Introduction to programming languages by designing and implementing domain-specific languages.

	- [Lecture Videos](https://archive.org/details/ucberkeley-webcast-PL3A16CFC42CA6EF4F)

	- [Code for Assignments](https://bitbucket.org/cs164_overlord/)

- [CS 173](http://cs.brown.edu/courses/cs173/2014/) **Programming Languages** *Brown University* Lecture Videos Assignments

	- Course by Prof. Krishnamurthi (author of [HtDP](http://htdp.org/2003-09-26/Book/)) and numerous other [awesome](http://cs.brown.edu/courses/cs173/2012/book/) [books](http://papl.cs.brown.edu/2014/index.html) on programming languages. Uses a custom designed [Pyret](http://www.pyret.org/) programming language to teach the concepts. There was an [online class](http://cs.brown.edu/courses/cs173/2012/OnLine/) hosted in 2012, which includes all lecture videos for you to enjoy.

	- [Videos](http://cs.brown.edu/courses/cs173/2012/Videos/)

	- [Assignments](http://cs.brown.edu/courses/cs173/2014/assignments.html)

- [CS 223](https://www.classes.cs.uchicago.edu/archive/2016/winter/22300-1/) **Purely Functional Data Structures In Elm** *University of Chicago* Assignments Lecture Notes

	- This course teaches functional reactive programming and purely functional data structures based on Chris Okazaki's book and using the Elm programming language.

	- [Lectures](https://www.classes.cs.uchicago.edu/archive/2015/winter/22300-1/Schedule.html)

	- [Assignments](https://www.classes.cs.uchicago.edu/archive/2015/winter/22300-1/Schedule.html)

- [CS 240h](http://www.scs.stanford.edu/14sp-cs240h/) **Functional Systems in Haskell** *Stanford University* Assignments Lecture Notes

	- Building software systems in Haskell

	- [Lecture Slides](http://www.scs.stanford.edu/14sp-cs240h/slides/)

	- 3 Assignments: [Lab1](http://www.scs.stanford.edu/14sp-cs240h/labs/lab1.html), [Lab2](http://www.scs.stanford.edu/14sp-cs240h/labs/lab2.html), [Lab3](http://www.scs.stanford.edu/14sp-cs240h/labs/lab3.html)

- [CS 421](https://courses.engr.illinois.edu/cs421/fa2014/) **Programming Languages and Compilers** *Univ of Illinois, Urbana-Champaign* Lecture Videos Assignments Lecture Notes

 Course that uses OCaml to teach functional programming and programming language design.

	- [Lectures](https://courses.engr.illinois.edu/cs421/fa2014/lectures/index.html)

	- [Videos](http://recordings.engineering.illinois.edu/ess/portal/section/631edaeb-2a33-4537-b7c8-0c1cba783a4f)

	- [Assignments](https://courses.engr.illinois.edu/cs421/fa2014/mps/index.html)

	- [Exams](https://courses.engr.illinois.edu/cs421/fa2014/exams/index.html)

- [CS 3110](http://www.cs.cornell.edu/Courses/cs3110/2014fa/course_info.php) **Data Structures and Functional Programming** *Cornell University* Assignments Lecture Notes

	- Another course that uses OCaml to teach alternative programming paradigms, especially functional and concurrent programming.

	- [Lecture Slides](http://www.cs.cornell.edu/Courses/cs3110/2014fa/lecture_notes.php)

	- [Assignments](http://www.cs.cornell.edu/Courses/cs3110/2014fa/)

- [CS 4120](http://www.cs.cornell.edu/courses/CS4120/2013fa/) **Introduction to Compilers** *Cornell University* Assignments Lecture Notes Readings

	- An introduction to the specification and implementation of modern compilers. Topics covered include lexical scanning, parsing, type checking, code generation and translation, an introduction to optimization, and compile-time and run-time support for modern programming languages.  As part of the course, students build a working compiler for an object-oriented language.

	- [Syllabus](http://www.cs.cornell.edu/courses/CS4120/2013fa/overview.html)

	- [Lectures](http://www.cs.cornell.edu/courses/CS4120/2013fa/schedule.html)

	- [Assignments](http://www.cs.cornell.edu/courses/CS4120/2013fa/homework.html)

- [CS 4400](https://pl.barzilay.org/) **Programming Languages** *Northeastern University* Assignments Lecture Notes Readings

	- This is a course on the study, design, and implementation of programming languages.

	- The course works at two simultaneous levels: first, we will use a programming language that can demonstrate a wide variety of programming paradigms. Second, using this language, we will learn about the mechanics behind programming languages by implementing our own language(s). The two level approach usually means that we will often see how to use a certain feature, and continue by implementing it.

	- [Syllabus](https://pl.barzilay.org/syllabus.html)

	- [Lecture Notes/Resources](https://pl.barzilay.org/resources.html)

- [CS 4610](http://www.cs.virginia.edu/~weimer/4610/) **Programming Languages and Compilers** *University of Virginia* Assignments Lecture Notes

	- Course that uses OCaml to teach functional programming and programming language design. Each assignment is a part of an interpreter and compiler for an object-oriented language similar to Java, and you are required to use a different language for each assignment (i.e., choose 4 from Python, JS, OCaml, Haskell, Ruby).

	- [Lecture Notes](http://www.cs.virginia.edu/~weimer/4610/lectures.html)

	- [Assignments](http://www.cs.virginia.edu/~weimer/4610/pa.html)

- [CS 5114](http://www.cs.cornell.edu/courses/CS5114/2013sp/index.php) **Network Programming Languages** *Cornell University* Lecture Notes Readings

	- This course provides an introduction to the languages used to program computer networks. It will examine recent proposals based on logic, functional, and distributed languages, as well as tools for establishing correctness using automatic solvers, model checkers, and proof assistants.

	- [Syllabus](http://www.cs.cornell.edu/courses/CS5114/2013sp/syllabus.php)

	- [Lectures](http://www.cs.cornell.edu/courses/CS5114/2013sp/syllabus.php)

- [CS 5142](http://www.cs.cornell.edu/courses/CS5142/2013fa/) **Scripting Languages** *Cornell University* Lecture Notes Assignments

	- Perl, PHP, JavaScript, VisualBasic -- they are often-requested skills for employment, but most of us do not have the time to find out what they are all about. In this course, you learn how to use scripting languages for rapid prototyping, web programming, data processing, and application extension. Besides covering traditional programming languages concepts as they apply to scripting (e.g., dynamic typing and scoping), this course looks at new concepts rarely found in traditional languages (e.g., string interpolation, hashes, and polylingual code). Through a series of small projects, you use different languages to achieve programming tasks that highlight the strengths and weaknesses of scripting. As a side effect, you practice teaching yourself new languages.

	- [Syllabus](http://www.cs.cornell.edu/courses/CS5142/2013fa/)

	- [Lectures](http://www.cs.cornell.edu/courses/CS5142/2013fa/#schedule)

	- [Assignments](http://www.cs.cornell.edu/courses/CS5142/2013fa/#schedule)

- [CS 5470](http://matt.might.net/teaching/compilers/spring-2015/) **Compilers** *University of Utah* Assignments Lecture Notes Readings

	- If you're a fan of Prof Matt's writing on his [fantastic blog](http://matt.might.net/articles/) you ought to give this a shot. The course covers the design and implementation of compilers, and it explores related topics such as interpreters, virtual machines and runtime systems. Aside from the Prof's witty take on [cheating](http://matt.might.net/teaching/compilers/spring-2015/#collaboration) the page has tons of interesting links on programming languages, parsing and compilers.

	- [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 Notes Readings

	- 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 Videos Readings

  - Nine lectures walking through the internals of CPython, the canonical Python interpreter implemented in C. They were from the *Dynamic Languages and Software Development* course taught in Fall 2014 at the University of Rochester.

- [CSE 341](http://courses.cs.washington.edu/courses/cse341/16sp/) **Programming Languages** *University of Washington* Lecture Videos Assignments Lecture Notes

	- Covers non-imperative paradigms and languages such as Ruby, Racket, and ML and the fundamentals of programming languages.

	- [Lectures and Videos](https://courses.cs.washington.edu/courses/cse341/16sp/#lectures)

	- [Assignments and Tests](https://courses.cs.washington.edu/courses/cse341/16sp/#homeworks)

- [CSE P 501](http://courses.cs.washington.edu/courses/csep501/09au/lectures/video.html) **Compiler Construction** *University of Washington* Lecture Videos Assignments

	- Teaches understanding of how a modern compiler is structured and the major algorithms that are used to translate code from high-level to machine language. The best way to do this is to actually build a working compiler, so there will be a significant project to implement one that translates programs written in a core subset of Java into executable x86 assembly language. The compilers themselves will use scanner and parser generator tools and the default implementation language is Java.

	- [Lectures](http://courses.cs.washington.edu/courses/csep501/09au/lectures/video.html)

	- [Assignments, Tests, and Solutions](http://courses.cs.washington.edu/courses/csep501/09au/homework/index.html)

- [DMFP](http://cs.wheaton.edu/~tvandrun/dmfp/) **Discrete Mathematics and Functional Programming** *Wheaton College* Lecture Videos Assignments

  - A course that teaches discrete maths concepts with functional programming

  - [Lecture Videos](http://cs.wheaton.edu/~tvandrun/dmfp/)

  - [Assignments](http://cs.wheaton.edu/~tvandrun/dmfp/source.html)

- [PCPP](http://www.itu.dk/people/sestoft/itu/PCPP/E2015/) **Practical Concurrent and Parallel Programming** *IT University of Copenhagen* Lecture Notes Assignments Readings

  - In this MSc course you learn how to write correct and efficient concurrent and parallel software, primarily using Java, on standard shared-memory multicore hardware.

  - The course covers basic mechanisms such as threads, locks and shared memory as well as more advanced mechanisms such as parallel streams for bulk data, transactional memory, message passing, and lock-free data structures with compare-and-swap.

  - It covers concepts such as atomicity, safety, liveness and deadlock.

  - It covers how to measure and understand performance and scalability of parallel programs.

  - It covers tools and methods to find bugs in concurrent programs.

- [6.945](https://groups.csail.mit.edu/mac/users/gjs/6.945/index.html) **Adventures in Advanced Symbolic Programming** *MIT* Lecture Notes Assignments Readings

	- Taught by Gerald Sussman of SICP fame, this class deals with concepts and techniques for the design an implementation of large software systems that can be adapted to uses not anticipated by the designer. Applications include compilers, computer-algebra systems, deductive systems, and some artificial intelligence applications.

	- [Assignments](https://groups.csail.mit.edu/mac/users/gjs/6.945/assignments.html): Extensive programming assignments, using MIT/GNU Scheme. Students should have significant programming experience in Scheme, Common Lisp, Haskell, CAML or other "functional" language.

	- [Readings](https://groups.csail.mit.edu/mac/users/gjs/6.945/readings/)

- [CS 696](http://www.eli.sdsu.edu/courses/fall15/cs696/index.html) **Functional Design and Programming** *San Diego State University* Lecture Notes Assignments Readings

	- Covers functional programming basis using Clojure.

	- Topics include testing, functional programming, immutable collections and concurrency.

	- Also includes assignments covering Clojurescript, [Reagent](Reagent Github) etc.

- [L28](https://www.cl.cam.ac.uk/teaching/1516/L28/) **Advanced Functional Programming** *University of Cambridge*  Lecture Notes Assignments Readings

	- This module aims to teach students how to use the features of modern typed functional programming languages (e.g. OCaml, Haskell) to design and implement libraries and DSLs. It aims to demonstrate how such techniques can improve both correctness and efficiency. Students wishing to take the module should have some experience of a typed functional programming language and an understanding of type inference.

	- This particular session was taught by a prominent OCaml programmer, open Source contributor & author of real world OCaml - Dr Anil Madhavapeddy.



-------



### Algorithms



- [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 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

	- Fantastic repository of theory and practice problems across various topics for students who are interested to participate in ACM-ICPC.

	- [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))

	- [Assignments](http://people.seas.harvard.edu/~minilek/cs224/fall14/hmwk.html)

- [CS 261](http://theory.stanford.edu/~tim/w16/w16.html) **A Second Course in Algorithms** *Stanford University* Lecture Videos Assignments Lecture Notes

	- Algorithms for network optimization: max-flow, min-cost flow, matching, assignment, and min-cut problems. Introduction to linear programming. Use of LP duality for design and analysis of algorithms. Approximation algorithms for NP-complete problems such as Steiner Trees, Traveling Salesman, and scheduling problems. Randomized algorithms. Introduction to online algorithms.

	- [Lecture Notes, Videos & Assignments](http://theory.stanford.edu/~tim/w16/w16.html) ([Youtube](https://www.youtube.com/playlist?list=PLEGCF-WLh2RJh2yDxlJJjnKswWdoO8gAc))

- [CS 473/573](http://jeffe.cs.illinois.edu/teaching/algorithms/) **Fundamental Algorithms** *Univ of Illinois, Urbana-Champaign* Assignments Lecture Notes

	- Algorithms class covering recursion, randomization, amortization, graph algorithms, network flows and hardness. The lecture notes by Prof. Erikson are comprehensive enough to be a book by themselves. Highly recommended!

	- [Lecture Notes](http://web.engr.illinois.edu/~jeffe/teaching/algorithms/all-algorithms.pdf)

	- [Labs and Exams](http://web.engr.illinois.edu/~jeffe/teaching/algorithms/all-hwex.pdf)

- [CS 2150](https://github.com/aaronbloomfield/pdr) **Program & Data Representation** *University of Virginia* Assignments Lecture Notes

	- 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/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/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)

	- [Assignments](http://www-scf.usc.edu/~csci104/20142/assignments/)

	- [Additional Resources](http://www-scf.usc.edu/~csci104/20142/resources.html)

- [CSCI 135](http://compsci.hunter.cuny.edu/~sweiss/courses/csci135.php) **Software Design and Analysis I** Assignments Lecture Notes

*CUNY Hunter College*

	- It is currently an intensive introduction to program development and problem solving. Its emphasis is on the process of designing, implementing, and evaluating small-scale programs. It is not supposed to be a C++ programming course, although much of the course is spent on the details of C++. C++ is an extremely large and complex programming language with many features that interact in unexpected ways. One does not need to know even half of the language to use it well.

	- [Lectures and Assignments](http://compsci.hunter.cuny.edu/~sweiss/course_materials/csci135/csci135_36_fall12.php)

- [CSCI 235](http://compsci.hunter.cuny.edu/~sweiss/courses/csci235.php) **Software Design and Analysis II** *CUNY Hunter College* Assignments Lecture Notes

	- Introduces algorithms for a few common problems such as sorting. Practically speaking, it furthers the students' programming skills with topics such as recursion, pointers, and exception handling, and provides a chance to improve software engineering skills and to give the students practical experience for more productive programming.

	- [Lectures and Assignments](http://compsci.hunter.cuny.edu/~sweiss/course_materials/csci235/csci235_f14.php)

- [CSCI 335](http://compsci.hunter.cuny.edu/~sweiss/courses/csci335.php) **Software Design and Analysis III** Assignments Lecture Notes

*CUNY Hunter College*

	- This includes the introduction of hashes, heaps, various forms of trees, and graphs. It also revisits recursion and the sorting problem from a higher perspective than was presented in the prequels. On top of this, it is intended to introduce methods of algorithmic analysis.

	- [Lectures and Assignments](http://compsci.hunter.cuny.edu/~sweiss/course_materials/csci335/csci335_s14.php)

- [CSE 331](http://courses.cs.washington.edu/courses/cse331/15sp/) **Software Design and Implementation** *University of Washington* Assignments Lecture Notes

	- Explores concepts and techniques for design and construction of reliable and maintainable software systems in modern high-level languages; program structure and design; program-correctness approaches, including testing.

	- [Lectures, Assignments, and Exams](http://courses.cs.washington.edu/courses/cse331/15sp/#all)

- [CSE 373](http://www3.cs.stonybrook.edu/~skiena/373/) **Analysis of Algorithms** *Stony Brook University* Lecture Videos Assignments Lecture Notes Readings

	- Prof Steven Skiena's no stranger to any student when it comes to algorithms. His seminal [book](http://www.algorist.com/) has been touted by many to be best for [getting that job in Google](http://steve-yegge.blogspot.com/2008/03/get-that-job-at-google.html). In addition, he's also well-known for tutoring students in competitive [programming competitions](http://www.programming-challenges.com/pg.php?page=index). If you're looking to brush up your knowledge on Algorithms, you can't go wrong with this course.

	- [Lecture Videos](http://www.cs.sunysb.edu/~algorith/video-lectures/)

- [ECS 122A](http://web.cs.ucdavis.edu/~gusfield/cs122f10/) **Algorithm Design and Analysis** *UC Davis* Lecture Videos Assignments Lecture Notes

	- Taught by [Dan Gusfield](http://web.cs.ucdavis.edu/~gusfield/) in 2010, this course is an undergraduate introduction to algorithm design and analysis. It features traditional topics, such as Big Oh notation, as well as an importance on implementing specific algorithms. Also featured are sorting (in linear time), graph algorithms, depth-first search, string matching, dynamic programming, NP-completeness, approximation, and randomization.

	- [Syllabus](http://web.cs.ucdavis.edu/~gusfield/cs122f10/syll122.pdf)

	- [Lecture Videos](http://web.cs.ucdavis.edu/~gusfield/cs122f10/videolist.html)

	- [Assignments](http://web.cs.ucdavis.edu/~gusfield/cs122f10/)

- [ECS 222A](http://web.cs.ucdavis.edu/~gusfield/cs222w11/) **Graduate Level Algorithm Design and Analysis** *UC Davis* Lecture Videos Assignments Lecture Notes

	- This is the graduate level complement to the ECS 122A undergraduate algorithms course by [Dan Gusfield](http://web.cs.ucdavis.edu/~gusfield/) in 2011. It assumes an undergrad course has already been taken in algorithms, and, while going over some undergraduate algorithms topics, focuses more on increasingly complex and advanced algorithms.

	- [Lecture Videos](http://web.cs.ucdavis.edu/~gusfield/cs222f07/videolist.html)

	- [Syllabus](http://web.cs.ucdavis.edu/~gusfield/cs222w11/syll11.pdf)

	- [Assignments](http://web.cs.ucdavis.edu/~gusfield/cs222w11/)

- [6.INT](https://courses.csail.mit.edu/iap/interview/index.php) **Hacking a Google Interview** *MIT* Readings

	- This course taught in the MIT Independent Activities Period in 2009 goes over common solution to common interview questions for software engineer interviews at highly selective companies like Apple, Google, and Facebook. They cover time complexity, hash tables, binary search trees, and other common algorithm topics you should have already covered in a different course, but goes more in depth on things you wouldn't otherwise learn in class- like bitwise logic and problem solving tricks.

	- [Handouts](https://courses.csail.mit.edu/iap/interview/materials.php)

	- [Topics Covered](https://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 Videos Assignments 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.

	- [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/)

	- [Resources](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/download-course-materials/)

	- [Old Exams](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/exams/)

- [6.046J/18.410J](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/index.htm) **Design and Analysis of Algorithms** *MIT* Lecture Videos Lecture Notes Assignments Readings

	- This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography. This course assumes that students know how to analyze simple algorithms and data structures from having taken [6.006](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/). It introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms.

	- [Lecture Videos](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/lecture-videos/)

 	- [Lecture Notes](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/lecture-notes/)

	- [Assignments](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/assignments/)

	- [Resources](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/download-course-materials/)

	- [Old Exams](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/exams/)

- [6.851](https://courses.csail.mit.edu/6.851/spring21/index.html) **Advanced Data Structures** *MIT* Lecture Videos Assignments Lecture Notes

	- This is an advanced DS course, you must be done with the [Advanced Algorithms](https://courses.csail.mit.edu/6.854/current/) course before attempting this one.

	- [Lectures](https://courses.csail.mit.edu/6.851/spring21/lectures/) Contains videos from sp2012 version, but there isn't much difference.

	- [Assignments](https://courses.csail.mit.edu/6.851/spring21/psets/) contains the calendar as well.

- [6.854/18.415J](https://courses.csail.mit.edu/6.854/current/) **Advanced Algorithms** *MIT* Lecture Videos Assignments Lecture Notes

	- Advanced course in algorithms by Dr. David Karger covering topics such as amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic programming, network flow, linear programming, fixed-parameter algorithms, and approximation algorithms.

	- **Register** on [NB](http://nb.mit.edu/subscribe?key=D3a8CYpoO2VcR1ZcfaxmR5KbyjCGXd3INNXvL3mxEakYJ7qGJw) to access the [problem set and lectures](http://nb.mit.edu/).

- [6.854J/18.415J](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-854j-advanced-algorithms-fall-2005/index.htm) **Advanced Algorithms** *MIT* Lecture Notes Assignments Readings

	- This course is a first-year graduate course in algorithms. Emphasis is placed on fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Techniques to be covered include amortization, randomization, fingerprinting, word-level parallelism, bit scaling, dynamic programming, network flow, linear programming, fixed-parameter algorithms, and approximation algorithms. Domains include string algorithms, network optimization, parallel algorithms, computational geometry, online algorithms, external memory, cache, and streaming algorithms, and data structures. The need for efficient algorithms arises in nearly every area of computer science. But the type of problem to be solved, the notion of what algorithms are "efficient,'' and even the model of computation can vary widely from area to area. In this second class in algorithms, we will survey many of the techniques that apply broadly in the design of efficient algorithms, and study their application in a wide range of application domains and computational models. The goal is for the class to be broad rather than deep. Our plan is to touch upon the following areas. This is a tentative list of topics that might be covered in the class; we will select material adaptively based on the background, interests, and rate of progress of the students.

	- [Lecture Videos - Spring 2016](https://www.youtube.com/playlist?list=PL6ogFv-ieghdoGKGg2Bik3Gl1glBTEu8c)

	- [Lecture Notes](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-854j-advanced-algorithms-fall-2005/lecture-notes/)

 	- [Assignments](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-854j-advanced-algorithms-fall-2005/assignments/)

	- [Readings](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-854j-advanced-algorithms-fall-2005/readings/)

	- [Resources](http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-854j-advanced-algorithms-fall-2005/download-course-materials/)

- [15-451/651](http://www.cs.cmu.edu/afs/cs/academic/class/15451-f10/www/) **Algorithms** *Carnegie Mellon University* Lecture Notes

	- The required algorithms class that go in depth into all basic algorithms and the proofs behind them. This is one of the heavier algorithms curriculums on this page. Taught by Avrim Blum and [Manuel Blum](http://en.wikipedia.org/wiki/Manuel_Blum) who has a Turing Award due to his contributions to algorithms. Course link includes a very comprehensive set of reference notes by Avrim Blum.

- [16s-4102](http://www.cs.virginia.edu/~shelat/16s-4102/) **Algorithms** *University of Virginia* Lecture Videos Assignments 

	- [Lecture Videos & Homeworks](http://www.cs.virginia.edu/~shelat/16s-4102/) ([Youtube](https://www.youtube.com/channel/UCxXYk53cSZof2bR_Ax0uJYQ/videos))



-------



### CS Theory



- [CIS 500](http://www.seas.upenn.edu/~cis500/cis500-f14/index.html) **Software Foundations** *University of Pennsylvania* Assignments Lecture Notes

	- An introduction to formal verification of software using the Coq proof assistant. Topics include basic concepts of logic, computer-assisted theorem proving, functional programming, operational semantics, Hoare logic, and static type systems.

	- [Lectures and Assignments](http://www.seas.upenn.edu/~cis500/cis500-f14/index.html#schedule)

	- [Textbook](http://www.cis.upenn.edu/~bcpierce/sf/current/index.html)

- [CS 103](http://web.stanford.edu/class/cs103/) **Mathematical Foundations of Computing** *Stanford University* Assignments Lecture Notes

	-  CS103 is a first course in discrete math, computability theory, and complexity theory. In this course, we'll probe the limits of computer power, explore why some problems are harder to solve than others, and see how to reason with mathematical certainty.

	-  Links to all lectures notes and assignments are directly on the course page

- [CS 173](https://courses.engr.illinois.edu/cs173/fa2014/A-lecture/index.html) **Discrete Structures** *Univ of Illinois Urbana-Champaign* Assignments Lecture Notes Readings

	- This course is an introduction to the theoretical side of computer science. In it, you will learn how to construct proofs, read and write literate formal mathematics, get a quick introduction to key theory topics and become familiar with a range of standard mathematics concepts commonly used in computer science.

	- [Textbook](http://web.engr.illinois.edu/~mfleck/building-blocks/) Written by the professor. Includes Instructor's Guide.

	- [Assignments](https://courses.engr.illinois.edu/cs173/fa2014/A-lecture/Homework/index.html)

	- [Exams](https://courses.engr.illinois.edu/cs173/fa2014/A-lecture/Exams/index.html)

- [CS 276](http://www.cs.berkeley.edu/~sanjamg/classes/cs276-fall14/) **Foundations of Cryptography** *UC Berkeley* Lecture Notes

	- This course discusses the complexity-theory foundations of modern cryptography, and looks at recent results in the field such as Fully Homomorphic Encryption, Indistinguishability Obfuscation, MPC and so on.

- [CS 278](http://www.cs.berkeley.edu/~luca/cs278-08/) **Complexity Theory** *UC Berkeley* Lecture Notes

	- A graduate level course on complexity theory that introduces P vs NP, the power of randomness, average-case complexity, hardness of approximation, and so on.

- [CS 374](https://courses.engr.illinois.edu/cs498374/fa2014/) **Algorithms & Models of Computation (Fall 2014)** *University of Illinois Urbana-Champaign* Lecture Videos Assignments Lecture Notes

	- CS 498 section 374 (unofficially "CS 374") covers fundamental tools and techniques from theoretical computer science, including design and analysis of algorithms, formal languages and automata, computability, and complexity. Specific topics include regular and context-free languages, finite-state automata, recursive algorithms (including divide and conquer, backtracking, dynamic programming, and greedy algorithms), fundamental graph algorithms (including depth- and breadth-first search, topological sorting, minimum spanning trees, and shortest paths), undecidability, and NP-completeness. The course also has a strong focus on clear technical communication.

	- [Assignments/Exams](https://cour