Efficient Algorithms and Intractable Problems (CS170) was by far one of my favorite classes at UC Berkeley. Every computer science student should be a solid foundation in basic algorithms. Do you know your Big O? Big Theta? Also, do you ever wonder why the Facebook calls its network a social graph? Graph theory is one of the basic and most practical idea in computer science. This is what separates the average coder from a computer scientist with a good understanding in design and theory.

Browsing around on Scribd, I was able to find the exact textbook we used for the class. The authors, Papadimitriou and Varizani, were actually my professors for the course. The book was surprisingly easy to read, clear and concise. Take a peak; I think you’ll appreciate the resource.

Popularity: 35% [?]