Live data from Hacker News

Advanced Data Structures (2017)

courses.csail.mit.edu

31–40 of 89 posts

Re: Advanced Data Structures (2017)

#33

As a busy self-learner, when is it time to learn data structures in depth? I feel like there are always 10 other technologies I need to know more urgently (eg, more bash, Linux, testing frameworks, deep learning, c++ libraries, linear algebra, common security mistakes/attacks, OpenGL, etc)

It depends if you're learning for pleasure or for your career. ;) When I bust out my algorithms/data structures books, I find myself engrossed much like I imagine people get with a good novel. So many times I say to myself, "Whoah! That's so cool!" because of how elegantly/efficiently a problem can be solved that I had never even considered. My favorite so far is Skiena's "The Algorithm Design Manual". I especially l…

How does one read a algorithm or data structure book like an novel? most books require busting out keyboard or pen and paper and solving one thing or another.

Just genuinely curious because I love reading technical books but I can never finish them from page to page.

Re: Advanced Data Structures (2017)

#34
post #6

the professor is a fascinating guy: http://erikdemaine.org/ https://en.wikipedia.org/wiki/Erik_Demaine EDIT: so is the coauthor! http://joebergeron.io/posts/post_four.html

He is featured in this NOVA documentary. Geometry is cool.

https://www.pbs.org/video/nova-origami-revolution-episode/

Re: Advanced Data Structures (2017)

#36
>So alas, Back To The Future isn't really possible.

Step 1: Upload consciousness

Step 2: Get so good at particle theory, the "dumb" universe really can't determine if it's really me.

Step 3: Do whatever the hell I want!

Re: Advanced Data Structures (2017)

#38
post #8

Got confused by the broken link too. Those aren't separate links. It's a single link, and given the name of the file is "poster-design.pdf", I don't think the PDF is very important. It's just an image that gives examples of what is probably covered. The real content is described below as the video lectures and notes of the class[1] and the github account[2]. There are also problem sets[3], and it recommends a couple…

It's too bad that the links are broken. When the links at the top of the page didn't work, I immediately assumed that this was for an old course and none of the material would still be available.

I only kept looking because I didn't think a useless site would make it to the top of HN. People who find the course site another way might not have a reason to keep looking.

Re: Advanced Data Structures (2017)

#39
post #33

Earlier quoted context omitted.

It depends if you're learning for pleasure or for your career. ;) When I bust out my algorithms/data structures books, I find myself engrossed much like I imagine people get with a good novel. So many times I say to myself, "Whoah! That's so cool!" because of how elegantly/efficiently a problem can be solved that I had never even considered. My favorite so far is Skiena's "The Algorithm Design Manual". I especially l…

How does one read a algorithm or data structure book like an novel? most books require busting out keyboard or pen and paper and solving one thing or another. Just genuinely curious because I love reading technical books but I can never finish them from page to page.

I think this is just a personal thing. kinda like some people immediately spill their brain to some cache (whiteboard, pen/paper) and others stare at a wall for minutes then write when they have a fuller thought.

If it's a technical book I probably read and enjoy it and forget most of it. If I see a similar problem it might jog my memory and then I can refer back. Only works for good books. Its a different experience than directly interacting with the examples by coding/working out yourself.

Re: Advanced Data Structures (2017)

#40
Years ago, I watched all those video preparing for a Google interview. They are really great. I was told advanced data structures would be a big part of it. Not a single thing came up in the process :/
Post reply on HN