Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/adhaamehab/stanford-cs161
Unofficial repo for Design and Analysis of Algorithms, Stanford University, Fall 2017.
https://github.com/adhaamehab/stanford-cs161
2017 algorithms data-structures stanford-university
Last synced: 2 months ago
JSON representation
Unofficial repo for Design and Analysis of Algorithms, Stanford University, Fall 2017.
- Host: GitHub
- URL: https://github.com/adhaamehab/stanford-cs161
- Owner: adhaamehab
- Created: 2017-12-21T09:53:57.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2019-08-13T10:07:54.000Z (over 5 years ago)
- Last Synced: 2024-10-12T04:50:44.579Z (3 months ago)
- Topics: 2017, algorithms, data-structures, stanford-university
- Language: Jupyter Notebook
- Homepage: http://web.stanford.edu/class/cs161/index.html
- Size: 87.9 MB
- Stars: 61
- Watchers: 5
- Forks: 28
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Design and Analysis of Algorithms, Stanford University, Fall 2017.
This is the course materials for [stanford CS161](http://web.stanford.edu/class/cs161/index.html)
## Installation
you need python3 and jupyter
```shell
$ jupyter notebook # to run the jupyter server
```## Note
All materials are owned by __Stanford__
## Course content
### Course syllabus
- [Why are you here? And do you know how to multiply integers?](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture1)
- [MergeSort, Recurrences, and Asymptotics](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture2)
- [More recurrences and the master theorem](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture3)
- [The Substitution Method and the Selection problem](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture4)
- [Randomized Algorithms and QuickSort](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture5)
- [BucketSort, RadixSort, and Sorting Lower Bounds](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture6)
- [Binary Search Trees and Red-Black Trees](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture7)
- [Hashing!](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture8)
- [Graphs, BFS and DFS](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture9)
- [Finding Strongly Connected Components](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture10)
- [Dijkstra's Algorithm and Bellman-Ford](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture11)
- [Dynamic Programming and shortest paths: Bellman-Ford and Floyd-Warshall](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture12)
- [More dynamic programming](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture13)
- [Greedy Algorithms](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture14)
- [Minimum Spanning Trees](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture15)
- [Minimum Cuts and Karger's Algorithm](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture16)
- [Max Flow and the Ford-Fulkerson Algorithm](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture17)
- [What's next?](https://github.com/adhaamehab/stanford-cs161/tree/master/Lectures/Lecture18)### Sections
- [Asymptotic analysis, recurrence relations, divide and conquer](https://github.com/adhaamehab/stanford-cs161/tree/master/Sections/section1)
- [Randomized algorithms, selection](https://github.com/adhaamehab/stanford-cs161/tree/master/Sections/section2)
- [ Binary Trees: Rotation and Construction. ](https://github.com/adhaamehab/stanford-cs161/tree/master/Sections/section3)
- [Midterm review.](https://github.com/adhaamehab/stanford-cs161/tree/master/Sections/section4)
- [Search, Strongly Connected Components.](https://github.com/adhaamehab/stanford-cs161/tree/master/Sections/section5)
- [Bellman–Ford, Dijkstra.](https://github.com/adhaamehab/stanford-cs161/tree/master/Sections/section6)
- [Dynamic Programming.](https://github.com/adhaamehab/stanford-cs161/tree/master/Sections/section7)
- [Greedy Algorithms.](https://github.com/adhaamehab/stanford-cs161/tree/master/Sections/section7)
- [Max Flow. ](https://github.com/adhaamehab/stanford-cs161/tree/master/Sections/section7)### Homework
- [Homework 1](https://github.com/adhaamehab/stanford-cs161/tree/master/Homework/Homework1)
- [Homework 2](https://github.com/adhaamehab/stanford-cs161/tree/master/Homework/Homework2)
- [Homework 3](https://github.com/adhaamehab/stanford-cs161/tree/master/Homework/Homework3)
- [Homework 4](https://github.com/adhaamehab/stanford-cs161/tree/master/Homework/Homework4)
- [Homework 5](https://github.com/adhaamehab/stanford-cs161/tree/master/Homework/Homework5)
- [Homework 6](https://github.com/adhaamehab/stanford-cs161/tree/master/Homework/Homework6)
- [Homework 7](https://github.com/adhaamehab/stanford-cs161/tree/master/Homework/Homework7)### Exams
- [Exams](https://github.com/adhaamehab/stanford-cs161/tree/master/Exams)