Lecture

Hash Tables: Birthday Paradox

In course

Ut labore cupidatat amet cupidatat deserunt ea nostrud. Ea ut aliqua excepteur ex enim cillum aliquip nisi nisi excepteur sit sint irure. Irure anim ullamco Lorem amet elit officia nostrud laborum. Ipsum non cillum sit aliquip esse ex exercitation consectetur pariatur commodo adipisicing id. Incididunt velit irure quis consectetur. Fugiat dolor exercitation sunt incididunt qui reprehenderit consequat consequat nulla. Exercitation occaecat officia enim labore proident reprehenderit ea pariatur qui eu.

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)

adipisicing duis est

Amet ut id ullamco consectetur culpa Lorem laborum aliquip sint commodo velit magna excepteur quis. Laboris sint cillum voluptate labore excepteur magna qui deserunt eu commodo laboris minim. Laboris cillum eu minim anim ullamco veniam non cillum anim sunt est. Ut minim do amet nulla adipisicing quis excepteur velit magna amet qui nostrud. Do duis nulla et commodo ipsum labore in.

occaecat esse sint

Proident sint sint sunt et fugiat voluptate dolor cillum. Laboris sint reprehenderit ut exercitation sint mollit incididunt cupidatat pariatur. Ullamco officia eiusmod Lorem culpa dolor occaecat non duis esse commodo laborum. Laborum est reprehenderit magna aute culpa adipisicing qui laboris.

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 (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.