Advanced Data Structures: Double Hashing

preview_player
Показать описание
CORRECTIONS/NOTES:
* 6:46: h_1(k) should be h_1(x)
  1. Niema Moshiri
  2. advanced
  3. data
  4. structures
  5. double
  6. hashing
Рекомендации по теме
Advanced Data Structures: 0:09:26

Advanced Data Structures: Double Hashing

132 Double Hashing 0:07:45

132 Double Hashing (Closed Hashing) to Handle the Collision - Numerical Example

Double Hashing (deutsch) 0:07:04

Double Hashing (deutsch)

L-6.7: Double Hashing 0:10:28

L-6.7: Double Hashing | Collision Resolution Technique

Double Hashing Demonstration 0:02:48

Double Hashing Demonstration

Double Hashing- Data 0:09:53

Double Hashing- Data Structure

Doble hashing 0:05:32

Doble hashing

Double Hashing in 0:10:12

Double Hashing in Data Structures With Example

Double Hashing 0:11:32

Double Hashing

Double Hashing explained 0:01:44

Double Hashing explained in 1 minute - Part 4 Hashing in Data structure

Lecture 13: Double 0:54:18

Lecture 13: Double Hashing, Load Factor, Trees, Tree Terminology [Advanced Data Structures]

Double Hashing- Collision 0:03:40

Double Hashing- Collision Resolution Techniques | Data Structures and Algorithms Tutorial

Collision handling techniques 0:08:51

Collision handling techniques | Double hashing | Hashing | Advanced data structures

Rehashing in Data 0:10:07

Rehashing in Data Structures || Collision Resolution Technique

Double Hashing 0:04:13

Double Hashing

Double Hashing 0:10:58

Double Hashing

Double Hashing part 0:01:37

Double Hashing part 4 Hashing in data structure / hash/hash function/

DOUBLE HASHING IN 0:10:37

DOUBLE HASHING IN DATA STRUCTURE WITH EXAMPLE || #ioe #datastructures #probing

Data Structure 18-9: 0:12:08

Data Structure 18-9: Double Hashing

COMP2321 Hashing 6 0:07:44

COMP2321 Hashing 6 Double Hashing Dr Radi Jarrar

Double hashing 0:07:55

Double hashing

Advanced Data Structures: 0:10:52

Advanced Data Structures: Open Addressing (Linear Probing)

Doppel-Hashing // double 0:06:38

Doppel-Hashing // double hashing

Question 3 in 0:09:11

Question 3 in Feb 2 2012, Brent Hashing

Комментарии
Автор

What does this have to do with double hashing?

reddistone
Автор

If we use digit floding method as hash function, then hash key for 70 is 7(7+0).where we have to insert key 70 as the table size Is 5

hhh
Автор

why talk about linear probing in a video about double hashing

channelname
Автор

what if after double hash there is collision too??

pawmeowzing
Автор

Wouldn't you want your second hash function to always output a number coprime to the length of the table for this to work? Otherwise you end up wasting space as when doing the "probing" step you could easily miss empty slots.

beegyoshi
Автор

You gave hash_function1(x) = x%5. Therefore, your hash_function2(x)  = 1 + (hash_function1(x)/m)%(m-1) for 70 would be hash_function2(x) = 1 + ((x%5)/m)%(m-1) = 1 + ((70%5)/5)%(5-1) = 1 + (0/5)%4 = 1. Therefore, your hash_function2 is giving a different value than the one you computed (1 instead of 3). Maybe you meant hash_function2(x) = 1 + (x/m)%(m-1)? This would give you 1 + (70/5)%(5-1) = 1 + 14%4 = 3.

jacobtrombley
Автор

you spent half the video talking about linear probing in a video titled double probing smh

bwbs