4 ms·
Advanced data structures: http://courses.csail.mit.edu/6.851/ http://courses.csail.mit.edu/6.851/
by mehrdadn 6y ago
Advanced data structures: http://courses.csail.mit.edu/6.851/ http://courses.csail.mit.edu/6.851/
- kyawzazaw 6y agoIs there any places these are used?
- MattGaiser 6y agoInterviews.
- quantified 6y agoSo many interviews have a tries question and a recursion question.
- kadoban 6y agoThis class isn't good interview prep. These are a mix of theoretically interesting and/or practical but somewhat difficult (not intro level) data structures/algorithms.
- mehrdadn 6y agoYes... tries, suffix arrays, sketching, cache oblivious data structures and algorithms, splay trees, persistent data structures, etc. are used in a wide variety of places ranging from compilers to compbio to distributed systems, to give some examples. I know I've written applications for which I wanted to use some of these to get a nice speedup, but in most cases I just never got around to them. Of course you'll find ones that are more obscure too. I'm not sure how to give a more useful answer to such a broad critical comment though...
- colinb 6y agoTries are useful for IPv4 prefix lookup. Routers that don't have hardware acceleration use them. Indeed, some hardware devices map a s/w trie to analogous h/w structures (some use TCAMs). Also interviews...
- scaraffe 6y agoI usually prefer reading over watching videos. Can someone recommend a book that covers all the topics in this course?
- tsjq 6y agothe page lists : There's no perfect textbook for this class, but there are some relevant books: Data Structures and Network Algorithms by Robert E. Tarjan (covers BSTs, splay trees, link-cut trees) Open Data Structures by Pat Morin (covers BSTs, B-trees, hashing, and some integer data structures)