13 ms·
Advanced Data Structures
- burnbabyburn 10y agoalso very interesting is Erik Demaine's work on geometric folding, at least it's fun to watch various structures he prints and plays with.
- abbiya 10y agoerik is the prof.
- 0xFFC 10y agoHe is awesome,a s student in third world country (which universities sucks) I watched to all his online lectures and I learned more than I learned in my 4 year of college,I always wander how person as young as he can achieve so much success. I don't care about financial success, I am curious about scientific success. God I wish there was mind recorder. I would listen to his (and people like he) mind all day, how they think, what they think , how they manage their time, everything. Scientists should study these guys, imagine a world filled with people like Erik (in all careers) how beautiful that world would be.
- ddorian43 10y agoSo you're saying that we should clone him ? Or clone top(10) maths/psychs/brain-surgeon/etc ?
- 0xFFC 10y agoOf course not, you are so obsessed with your perspective, you didn't see what I said. I told we should study these guys , how they think , how they improve their performance, to achieve their success formula. I cannot understand how in earth you infer from that to cloning them.
- ddorian43 10y agoDamn you got so offended! I'm sorry. Anyway, haven't we/they studied them ? That's what's missing ? I refer to cloning, cause you can't take `normies` and tell them what to do and they'll become a science-guy. Cause they don't want to, don't enjoy the process, don't have the mental capacity (pick any of them or all of them). So you need good genes (be able to learn, wanting/enjoying to learn), good enough life (don't get born in war-torn country), a good program on how to do them (what you say), a little guidance/mentoring.
- rootlocus 10y agoYou can't divide people into 2 categories: `normies` (you probably meant mediocre) and top(10). Leaving philosophy aside, there are a lot of people who do want to know what makes the top(10) tick, people who enjoy learning and who have the mental capacity. And I would argue their number is significant.
- ddorian43 10y agoI know I can't. But to do: >>imagine a world filled with people like Erik (in all careers) how beautiful that world would be You have to also include `normies`, right ?
- ddorian43 10y ago>>imagine a world filled with people like Erik (in all careers) how beautiful that world would be Do you think this will happen without cloning or messing with genetic code ?
- LastMuel 10y agoThank you for posting this! I love the perspective that your comment brings to course material being available online. It really helps to understand the power of educational material being abundantly available!
- 0xFFC 10y agoIf I want to be honest I worship teachers and instructors I have watched their course. I have been in sucky university, I know how it feels to waste your time. The first moment I find my first course (Erik all algorithm course) it was revolution in my life. I literally worship people like Douglas Schmidt, Erik Demanine, Tim Roughgarden, Robert Sedgwick ... They literally changed my life. Can you imagine third world universities? I am sure not. After 4 year , you end up knowing nothing , literally nothing,not even writing hello world. Thanks to these guys I am reading a book every month. For past two months I was reading Silberchats database books.
- Ar-Curunir 10y agoHonestly this is why I find the recent decision by the Dept of Education to sue universities for not captioning their lecture videos very, very selfish.
- lorenzhs 10y agoErik Demaine is such a great guy, I met him at a conference once, where he gave an invited talk on self-assembling robots. Fascinating stuff, we had a very interesting discussion with him afterwards and his intricate knowledge of even the smallest details was quite impressive. If his talk is anything to go by, this lecture should be very worthwhile.
- pass-by-value 10y agoCompletely agree. Haven't met him in person. I was taking a graduate algorithms course, a few years ago, and was searching online to gain better understanding. That's when I found Erik Demaine's lecture videos online. He does a great job of explaining the material. Loved how the concepts were broken down so that they were easy to understand. Learning from someone so good and fluent with the material was also very inspiring. It motivated me to strive for solid understanding of the course. I had a good professor, but I don't think I would have understood the subject as well, had I not watched Erik Demaine's lecture videos.
- stefap2 10y agohttps://en.wikipedia.org/wiki/Erik_Demaine https://en.wikipedia.org/wiki/Erik_Demaine
- deleted 10y ago[deleted]
- mathnode 10y agoI take it solutions by students are mostly done in Python now?
- bmon 10y agoI think it's more likely to be in something much more baremetal, given the topic. My university (UNSW) teaches a similar course with C.
- Ar-Curunir 10y agoNo, it's more likely going to be in LaTeX, given the Erik Demaine's highly theoretical inclinations.
- eequah9L 10y agoHe talks about projects at the beginning of the second session, and implementation (of something that hasn't yet been implemented) is one of the possibilities.
- slmyers 10y agoIt seems as though the instructor expects a compiled pdf, so maybe it's a more theoretical course? http://courses.csail.mit.edu/6.851/spring14/hmwk.html http://courses.csail.mit.edu/6.851/spring14/hmwk.html
- _asummers 10y agoI've watched the lecture series before, it focuses a decent amount on cache oblivious data structures and doing realllllllly cool integer tricks to get things fitting into compact bit maps.
- markchen90 10y agoI took this class in 2010. Most assignments consisted of proving one or two theorems from a recent research paper.
- deleted 10y ago[deleted]
- interdrift 10y agoThank you for this, I'm so excited to take it.
- MciprianM 10y agoWill there be a 2016 version?
- JustSomeNobody 10y agoI'm not sure the algorithms would have changed between then and now.
- nahumfarchi 10y agoAnyone knows which year has the best scribe notes?
- albertTJames 10y agoThat's a great teach
- 0xmohit 10y agoAll scribe notes in one PDF: http://courses.csail.mit.edu/6.851/spring14/scribe/2012scribes.pdf http://courses.csail.mit.edu/6.851/spring14/scribe/2012scrib... -- Playlist (2012 lectures from MIT OpenCourseWare): https://www.youtube.com/watch?v=T0yzrZL1py0&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf https://www.youtube.com/watch?v=T0yzrZL1py0&list=PLUl4u3cNGP...
- _pmf_ 10y agoAh; thanks! I've been trying to find them on the site to no avail.
- mrcactu5 10y agothis looks really excellent!
- ambar123 10y ago. So generous of you bro... Can i contact on your mail... My mail is daroga7hai@gmail.com....
- packetslave 10y agoooh, I had forgotten that Erik Demaine taught that course. He's great (MacArthur Fellowship, MIT professor at 20, etc.)
- mrleinad 10y agoList of videos/notes 2014: http://courses.csail.mit.edu/6.851/spring14/lectures/ http://courses.csail.mit.edu/6.851/spring14/lectures/ (spent 2 min trying to find them)
- _asummers 10y agoThey're also on YouTube under the OCW channel. https://www.youtube.com/playlist?list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf https://www.youtube.com/playlist?list=PLUl4u3cNGP61hsJNdULdu...
- ausjke 10y agois the site down?
- 0x54MUR41 10y agoThank you for sharing this. Anyone would recommend resources for learning fundamental of data structures? Book, video, or courses are welcome. I don't care the programming languages that are used for implementations. I am OK with C.
- mej10 10y agoThe Algorithm Design Manual by Steven Skiena Really enjoyed that book! It intersperses real world use cases which helps when your motivation starts to wane and has a warmer tone than most algorithm books. That being said, it is still pretty rigorous and will take a lot of work to get through it all. Whichever resource you choose, make sure it has exercises and do them! Even if you can't 100% figure some of them out just trying to will help your thinking immensely.
- marai2 10y agoI'll second that recommendation and op makes an important point that is rarely expressed when threads on learning algorithms show up on HN: Don't be discouraged if you find the material hard at first, "Even if you can't 100% figure some of them out just trying to will help your thinking immensely."
- 0x54MUR41 10y agoThanks a lot. I like your advice.
- sn9 10y agoSkiena's book is excellent and is definitely one to get. Another would be Sedgewick's Algorithms. He has a pair of courses on Coursera [0] that follow his 4th edition which uses Java. You're in for such a treat! Learning data structures and algorithms is so fun and really changes the way you think about programming. [0] https://www.coursera.org/learn/introduction-to-algorithms https://www.coursera.org/learn/introduction-to-algorithms
- 0x54MUR41 10y agoThank you for your recommendation and advice. I will go for Skiena's book since a lot of people recommend it.
- lawless123 10y agowhy are these hand drawn diagrams easier for me to understand and remember?
- Jtsummers 10y agoProbably because they're visually more distinct. We tend to just glance over things that look very familiar because "we know this" (not a conscious act). Using different colors for different components also helps. Allows details to "pop" out at you. Versus a diagram that's blue/black/gray/white.
- _coldfire 10y agoStylised fonts are harder to read but make content easier to remember, it's not a huge leap to assume drawn diagrams like these are similar. Comic Sans is good for you. https://faculty.washington.edu/chudler/font.html https://faculty.washington.edu/chudler/font.html
- ohyoutravel 10y agoThese are great, Erik is a really smart guy. His intro to algorithms class is also fantastic, which should be on MIT OpenCourseWare.
- Koshkin 10y agoOften shied away from as too complicated, this book deserves the obligatory mentioning: Knuth's The Art of Computer Programming. Although not using Python and perhaps being too analytical and detailed for an average programmer's taste, the book is the single biggest classic treatise on algorithms and data structures. At the other end of the spectrum - accessible and brief, I find Dasgupta et al.'s Algorithms a refreshingly engaging read.
- shanusmagnus 10y agoThis book is often recommended, but I would dearly love to know how many of its recommenders have actually read it.
- hossbeast 10y agoThere's an algorithm for that ...
- nekopa 10y agoIt ends up in an infinite loop for me :(
- Hernanpm 10y agoI rather recommend this book end to end by is a good to own it, when I use to compete in programming competitions from time to time there were interesting problems that have an algorithm explained in this book but not in others it is a good reference overall.
- Koshkin 10y agoWell, it is a bible, after all.
- nekopa 10y agoI have read the first 50 pages about a 100 times. Does that count? P.S. I have never recommended it to anyone though, I don't recommend books I haven't read all the way through. I will get through TAOCP one day, (it's now on my retirement bucket list, along with learning Sanskrit) but I first need to read through a bunch of Math books forst, so I can get past the 50 page hump.
- amelius 10y agoThis is very nice. But right now as a programmer, I am using data-structures more on an as-needed basis. Sometimes it is difficult to find the right data-structures for the job. So then it would be nice to have a resource that provides the functionality of data-structures as a black box. Learning these would make more sense than learning also all of the gory technical details upfront.
- jerf 10y agoAs you get into advanced data structures, you often need the gory technical details to make correct decisions about tradeoffs and usage. Succinct data structures, for instance, which are a specific thing and not just a generic adjective, are almost miraculously powerful, but you'd better understand exactly what the preconditions for using them are (which is a fairly mathematical discussion) and what the tradeoffs are before you use them because you will not be able to just "tweak" them and fix them up later if you're wrong.
- zvrba 10y agoMy small contribution to the field: http://zvrba.net/downloads/fusion.pdf http://zvrba.net/downloads/fusion.pdf
- stuxnet79 10y agoI never hear anybody mentioning him but Jeff Erickson's 'Algorithms' textbook [1] has some of the most lucid explanations I've come across. CLRS is often times impenetrable and for the times I didn't like its explanation of something I turned to Jeff Erickson's book and it hasn't failed me yet. I'd urge anybody trying to solidify algorithms and data structures to take a look at it. [1] http://jeffe.cs.illinois.edu/teaching/algorithms/ http://jeffe.cs.illinois.edu/teaching/algorithms/
- kyteland 10y agoJeff is also a great professor. If you ever get the chance to take a course with him, do it. You won't regret it. I had him for both 173 and 373 back in the day, and credit his teaching style for the immense amount of material I picked up. Also, this: http://jeffe.cs.illinois.edu/teaching/pikachu.html http://jeffe.cs.illinois.edu/teaching/pikachu.html
- excelangue 10y agoI'm currently taking 374 (the new 373). Unfortunately Jeff isn't leading my lectures, but the couple times he's subbed in were excellent. Really looking forward to taking 473 with Jeff next semester!
- marrs 10y agois there a print version?
- stuxnet79 10y agoNo but I printed this PDF (http://jeffe.cs.illinois.edu/teaching/algorithms/everything.pdf http://jeffe.cs.illinois.edu/teaching/algorithms/everything....). 1250 pages. Not sure about the legality of it.
- deleted 10y ago[deleted]
- 10y ago
- adamnemecek 10y agoDoes anyone use any of these ideas day to day? That's not to knock it, I'm genuinely curious.
- AYBABTME 10y agoYup, in particular when I want to prove/disprove the impact of a design proposal by preparing a simulation. Pay 1-2 days writing a simulation to save 6 months of wasted engineering effort.
- jasonjei 10y agoThis is a great resource for anybody that isn't formally trained in computer science. A lot of programmers use an abstract data type like a dictionary or hash table, but many of the self-taught and even some formally trained treat it like a magical black box that stores key-value entries very efficiently. What a hash table/dictionary gives it near O(1) properties is a good hashing function for the key, and having a good distribution of buckets for all the keys when collisions occur. I think a lot of programmers have good understanding of many data structures. But I think hashes and dictionaries are still taken for granted. What they really need to think of hashes as many magical black boxes and the hashing function directs which key to go to which magical bucket. :)
- markchen90 10y agoAre you serious? This class is intended for students with deep knowledge of CS theory who want to learn more about recent data structures research. 6.006 and 6.046 are much more suitable if you aren't formally trained in computer science.
- ambar123 10y agoRecommend some best book about... Timeand space complexity of algorithms....
- 40acres 10y agoI've been watching the lectures & recitations from 6.006 Introduction to Algorithms (Fall 2011) to brush up prior to an interview. Erik Demane, Srini Devadas & Victor Cossan (Recitations) have been an amazing resource. I've learned so much and am really impressed with their depth of knowledge and how they are able to convey complex ideas in a very easy to understand way, I can't wait to start the next courses.
- zem 10y agofrom the two-birds-with-one-stone-dept i've been looking for a good excuse to dive into pyret, and using it to do the exercises from this course might just be it. would anyone like to join me in a slow-paced workthrough?
- nhatbui 10y ago> If you haven't taken 6.854, you must have a strong understanding of algorithms at the undergraduate level, such as receiving an A in 6.046, having had a relevant UROP, involvement in computer competitions, etc. Quite the pre-reqs...
- fmardini 10y agoA very underrated book and one of my favorites is Udi Manber's Introuction to Algorithms, highly recommended
- hackerboos 10y agoI used that book for my dissertation. it had best explanation of the knapsack algorithm if I recall correctly.
- make3 10y agoThey better start close captioning or they will have to take the videos down