JFM23Bloom FilterSay we have a large set X of n items taken from a universe U, we ask the question: “Is a given element x in X?”Aug 1, 2023Aug 1, 2023
JFM23TriesSay we need to store a lot lot lot of words, then how would you do it?May 22, 2023May 22, 2023
JFM23Memory ManagementHow do we allocate and deallocate memory with data structures? Although the operating system will do its job for us to figure out how to…May 22, 2023May 22, 2023
JFM23TreapsRandomized data structures: a common design technique in the field of algorithm design involves the notion of using randomization. A…May 10, 2023May 10, 2023
JFM23B-TreesWhile binary trees are great data structures for ordered dictionaries stored in main memory, these data structures are really not…May 10, 2023May 10, 2023
JFM23HashingWe have seen data structures like AVL trees, splay trees, skip lists that can perform the dictionary operations like insert(), delete()…May 10, 2023May 10, 2023
JFM23Skip ListsSkip list began with the idea, “how can we make sorted linked lists better?”May 10, 2023May 10, 2023
JFM23Scapegoat TreesSometimes, doing rotation to maintain tree balance is not possible, but we still need a way to maintain tree balance. Consider kd-trees…Apr 12, 2023Apr 12, 2023
JFM23Point quadtree and Point kd-treeHow do we store geometric objects using data structures, such as storing points like (x, y), (x, y, z), or (x, y, z, w) etc. since we are…Apr 9, 2023Apr 9, 2023
