So we want to design a data structure to store your contacts and to do everything that you actually need with your contact book on your smartphone. At first, we're going to widen the scope of our initial phone book problem. In this lecture, we're going to learn how to do that. How to actually come up with good hash functions so that these hash tables consume not too much memory and all the operations are working really fast. In the previous lecture we've learned how to implement maps and sets using hash tables and how to store a phone book efficiently using hash functions, but we've left out one important question. You will also learn how services like Dropbox manage to upload some large files instantly and to save a lot of storage space! View Syllabus What are good strategies to keep a binary tree balanced? How to implement a hash table so that the amortized running time of all operations is O(1) on average?Ĥ. How priority queues are implemented in C++, Java, and Python?ģ. What is a good strategy of resizing a dynamic array?Ģ. You will also learn typical use cases for these data structures.Ī few examples of questions that we are going to cover in this class are the following:ġ. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. In this online course, we consider the common data structures that are used in various computational problems. A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently.
0 kommentar(er)
