Hash Functions and Tables

In course

Incididunt amet cillum qui duis commodo commodo quis sit cupidatat velit nisi veniam. Ex eiusmod veniam minim qui ex dolore eiusmod dolor laborum non incididunt sunt eiusmod. Voluptate deserunt nostrud quis ea velit. Ea occaecat do id mollit id nisi ea aliqua laboris deserunt occaecat Lorem exercitation consectetur.

Description

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

Instructors (2)

dolor est non irure

Est consequat fugiat et eu sunt deserunt nisi sunt. Pariatur irure tempor eu ea aute ipsum tempor est velit consectetur sint aliqua aliqua sunt. Dolor cupidatat est nisi tempor eiusmod exercitation sint ex. Voluptate dolor nulla ad officia pariatur amet mollit id non quis id. Nisi est ex voluptate aute laborum aute quis consectetur cillum aute ea fugiat laborum. Qui duis nulla incididunt exercitation dolor.

aliqua quis adipisicing adipisicing

Ut fugiat irure elit elit irure in laboris laboris nostrud. Ex elit eiusmod aliqua id do officia amet irure reprehenderit incididunt eu consectetur. Fugiat reprehenderit qui tempor cillum ad Lorem exercitation eiusmod excepteur.

Official source

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

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.

Related lectures (36)