Awesome-Mirrors/awesome-courses
1
0
Fork 0
mirror of https://github.com/prakhar1989/awesome-courses.git synced 2025-03-01 11:21:09 -05:00
Code Issues Packages Projects Releases Wiki Activity

Added a new course CS 161 under Algorithms

Browse Source
This commit is contained in:
Akshit Jain 2015-01-08 20:02:02 +05:30
parent 07da47158a
commit e3b1193750
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
README.md
View File

@ -119,11 +119,7 @@ Courses
- [clojure](http://mooc.cs.helsinki.fi/clojure) **Functional Programming with Clojure** *University of Helsinki*
- The course is an introduction to functional programming with a dynamically typed language Clojure. We start with an introduction to Clojure; its syntax and development environment. Clojure has a good selection of data structures and we cover most of them. We also go through the basics of recursion and higher-order functions. The course material is in English.
- [Github Page](http://iloveponies.github.io/120-hour-epic-sax-marathon/index.html)
- [Online](http://learnpythonthehardway.org/) **Learn Python The Hard Way** *OnlineFreeBook by Zed Shaw*
- This is an online book/course available for beginners in programming.This is really a great website to start with programming as well as to learn python2.The title says it is the hard way to learn to write code but it’s actually not. It’s the “hard” way only in that it’s the way people used to teach things. In this book you will do something incredibly simple that all programmers actually do to learn a language.
- [Exercises](http://learnpythonthehardway.org/book/):Go through each exercise.
- Type in each sample exactly.
- Make it run.
-------
@ -181,6 +177,9 @@ Courses
- [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/)
- [CS 161](http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms) **Design & Analysis of Algorithms** **Stanford University**
-Taught by Prof. Tim Roughgarden This course is an introduction to fundamental techniques for designing and analyzing algorithms, including asymptotic analysis, divide-and-conquer algorithms and recurrences, greedy algorithms, data structures, dynamic programming, graph algorithms, and randomized algorithms.
- [Lectures](http://openclassroom.stanford.edu/MainFolder/CoursePage.php?course=IntroToAlgorithms)
-------