Skip to content

Instantly share code, notes, and snippets.

@rreas

rreas/list.md

Last active August 29, 2017 02:46
Show Gist options
  • Save rreas/9bd170c24e6a896ae547 to your computer and use it in GitHub Desktop.
Save rreas/9bd170c24e6a896ae547 to your computer and use it in GitHub Desktop.
Download ZIP
Computer Science & Web Development Reading List
Raw
list.md

Discrete mathematics

To really understand data structures and algorithmic complexity, you need to understand discrete math. This the best starting point for CS theory. I love discrete math, others may find it very boring.

  • Essentials of Discrete Mathematics (Hunter)

Data structures

I can't think of a good data structures reading off the top of my head unfortunately. Often the trick to an efficient algorithm is really just an efficient data structure. Check out Dijkstra's algorithm for a great example of this (BFS + min-heap/priority queue).

Algorithms and some data structures

If you want to learn the basics pick one of the following, preferably Dasgupta or Kleinberg/Tardos. If you want to learn as much as you can from a single book then pick the CLRS book.

  • Introduction to Algorithms (CLRS) - A beast
  • Algorithms (Dasgupta) - Clear and concise but less advanced material
  • Algorithm Design (Kleinberg & Tardos) - Usable for undergraduate and graduate algorithms study

JavaScript

Ruby/Rails

Functional programming (Clojure focused)

Advanced (towards Clojure mastery)

Machine learning

  • Linear algebra
  • Multivariable calculus
  • ...

Recommendations of Chad Fowler

Source: https://www.wunderlist.com/lists/70326287

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment