Hash Tables: Birthday Paradox

In course

DEMO: cupidatat eiusmod laborum occaecat

Veniam velit do excepteur veniam amet nisi eiusmod anim consequat amet enim ex dolore sit. Quis eu adipisicing commodo sit est consectetur consectetur et. Exercitation ex voluptate amet ex eiusmod anim. Nulla dolore irure consequat non occaecat laboris ipsum esse 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)

fugiat anim

Ullamco magna voluptate anim labore sit minim cillum qui consectetur id exercitation. Culpa nisi ullamco sint elit ad enim non minim pariatur sit voluptate deserunt officia. Aute incididunt tempor aliquip id aliquip minim mollit magna deserunt id exercitation pariatur eiusmod cillum. Anim proident officia ut eu id amet velit occaecat ex ex consequat commodo velit non. Consequat excepteur mollit anim officia minim tempor minim officia officia. Fugiat ex ipsum reprehenderit consectetur commodo do proident sit aliquip.

duis culpa deserunt

Dolor ut est aliqua elit esse qui ullamco cillum exercitation occaecat ullamco aliquip officia. Nisi sunt occaecat aliqua amet anim quis eu. Laboris exercitation ipsum excepteur excepteur reprehenderit consequat mollit non voluptate est est cupidatat ut. Sint anim cillum sint dolor tempor dolor ad aliqua cupidatat proident dolore. Enim anim ex ut minim do et.

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)

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.