Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of hash tables, starting with the Birthday Paradox to determine the minimum number of students needed for a 50% chance of sharing a birthday. It then delves into hash functions, collisions, and the implementation of hash tables using direct-address and chained methods.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace