Lecture

Hash Tables: Birthday Paradox

Description

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
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.