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.
Lecture
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 hashing tables, starting with the Birthday Lemma which analyzes the probability of injective functions. It then explains Direct-Address Tables, hashing functions, collisions, and Chained-Hash-Search. The instructor also discusses the analysis of successful and unsuccessful searches in hash tables.
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