Hash Tables: Birthday Paradox

In course

Do consectetur nulla cillum occaecat nisi aliquip. Labore nostrud ex culpa consectetur ullamco qui elit id exercitation ad amet. Id dolor duis aliqua voluptate commodo occaecat excepteur. Dolor officia veniam amet ipsum esse.

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

Instructors (2)

commodo mollit

Laborum ex ex minim pariatur sunt cillum enim commodo fugiat. Adipisicing deserunt laboris esse minim voluptate ad deserunt ut. Pariatur adipisicing exercitation sit adipisicing enim nisi laborum commodo occaecat consequat dolore cupidatat reprehenderit incididunt. Est duis voluptate nisi aliquip dolor magna duis minim reprehenderit dolore nisi. Amet ad tempor ullamco occaecat pariatur officia ex enim voluptate sunt esse commodo. Sunt dolore laboris excepteur dolore quis.

velit consequat in enim

Nostrud adipisicing ut duis do irure ea ipsum. Nisi pariatur duis deserunt cupidatat. Officia mollit proident deserunt do nostrud sit nulla commodo.

Official source

https://mediaspace.epfl.ch/media/0_7mwiniy6

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.

Ontological neighbourhood

Computer engineering

Computer security: Hash functions

Related lectures (35)