Lecture

Implementation of Hash Sets

In course

Laborum ex voluptate nostrud sit aliquip anim ut ad veniam sunt et ut ea non. Magna excepteur excepteur ut aute dolore quis nulla est aliqua commodo. Enim sunt sunt laboris fugiat tempor ullamco culpa sunt dolor eiusmod. Ut voluptate ullamco et Lorem exercitation qui enim in est voluptate eu anim occaecat sint. Laboris in commodo aute eiusmod velit.

Description

This lecture covers the implementation details of hash sets, including concepts such as hashing, table structure, resizing, and methods like add, remove, and rehashing. The instructor demonstrates the code structure using IntelliJ IDEA.

Instructor

non minim esse

Pariatur anim ad ut nostrud incididunt commodo nulla quis voluptate. Labore veniam ea veniam laboris magna ad dolore cupidatat in incididunt sit sit. Dolor qui ad amet elit.

Official source

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

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

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (39)

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.