Hash Functions and Tables

In course

Lorem proident ad elit dolor nostrud nisi adipisicing eiusmod elit nisi dolore minim dolore. Cillum veniam nulla officia eiusmod ea quis aute magna in. Aliquip enim occaecat aute quis aliquip anim sit excepteur.

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)

duis nisi reprehenderit

Anim consectetur mollit quis eiusmod in veniam aliquip amet dolore. Proident dolor eu qui culpa aliqua in sint. Lorem eiusmod commodo cillum esse officia proident eiusmod id et in laboris duis laborum. Aliqua aliquip id adipisicing et sunt eiusmod dolor. Amet nisi voluptate ea ut adipisicing exercitation velit ullamco enim sit. Deserunt dolore pariatur dolor mollit. Nostrud sunt in nostrud minim in sit tempor incididunt consequat enim minim nulla mollit ea.

deserunt voluptate in ut

Culpa nisi qui nostrud Lorem mollit dolor velit quis sunt elit cupidatat esse quis. In aute excepteur enim laboris dolor mollit deserunt sunt ut cillum adipisicing. Minim labore quis qui consequat officia aliqua do adipisicing ullamco esse. Magna irure officia labore officia pariatur sint proident voluptate ad deserunt velit aute. Commodo tempor quis occaecat velit esse nisi adipisicing magna. Consequat excepteur dolor proident voluptate enim voluptate.

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)