10. Dictionaries

  Рет қаралды 17,137

MIT OpenCourseWare

MIT OpenCourseWare

Күн бұрын

Пікірлер: 7
@macewindu1827
@macewindu1827 7 жыл бұрын
A Question on Universality vs. Pair-Wise independence: The output of a hash function is used to map a particular value to a particular slot. The same output value hashes to the same slot. h(x) = h(y) means that the output of the hashing function for key x is the same as the output for the hashing function for key y. If the outputs are the same, the keys will hash to the same slot; if they are different, they will hash to different slots. In pair-wise independence, the probability that h(x1) maps to a particular slot t1 is 1/m. The probability that h(x2) maps to the SAME slot is 1/m and to a different slot is (m-1)/m. Therefore, the probability that the two outputs have the same output value is 1/(m^2). I've just asserted that the probability for the same event (two items hashing to the same slot) can be two different things, (1/m and 1/m^2) which is clearly wrong. Where am I getting tripped up on this? Thank you in advance!
@digama0
@digama0 6 жыл бұрын
The probability that h(x) = h(y) = t for some specific t is 1/m^2 (since this is the intersection of independent events h(x) = t, h(y) = t), but if you consider all m possibilities for t, the total is 1/m^2 * m = 1/m, which gives the probability that h(x) = h(y).
@roylee3196
@roylee3196 8 жыл бұрын
great lecture!
@EN-hm6zx
@EN-hm6zx 11 ай бұрын
1:09:17 cuckoo hashing
@lukaszplachecki8723
@lukaszplachecki8723 4 ай бұрын
🎉
@DEFINITELYNOTBORED
@DEFINITELYNOTBORED 2 жыл бұрын
😲😲😲
@xagent6327
@xagent6327 8 ай бұрын
:)
11. Integer Models
1:21:15
MIT OpenCourseWare
Рет қаралды 10 М.
7. Memory Hierarchy Models
1:22:54
MIT OpenCourseWare
Рет қаралды 22 М.
Симбу закрыли дома?! 🔒 #симба #симбочка #арти
00:41
Симбочка Пимпочка
Рет қаралды 6 МЛН
Thank you Santa
00:13
Nadir Show
Рет қаралды 54 МЛН
Quilt Challenge, No Skills, Just Luck#Funnyfamily #Partygames #Funny
00:32
Family Games Media
Рет қаралды 47 МЛН
17. Succinct Structures I
1:20:11
MIT OpenCourseWare
Рет қаралды 14 М.
Understanding and implementing a Hash Table (in C)
24:54
Jacob Sorber
Рет қаралды 366 М.
CS50x 2024 - Lecture 5 - Data Structures
2:02:49
CS50
Рет қаралды 421 М.
1. Persistent Data Structures
1:23:44
MIT OpenCourseWare
Рет қаралды 358 М.
Hash table separate chaining
8:14
WilliamFiset
Рет қаралды 48 М.
MIT Introduction to Deep Learning | 6.S191
1:09:58
Alexander Amini
Рет қаралды 757 М.
2023 MIT Integration Bee - Finals
28:09
MIT Integration Bee
Рет қаралды 2,1 МЛН
SHA: Secure Hashing Algorithm - Computerphile
10:21
Computerphile
Рет қаралды 1,2 МЛН
12. Fusion Trees
1:24:09
MIT OpenCourseWare
Рет қаралды 15 М.
2. Retroactive Data Structures
1:18:39
MIT OpenCourseWare
Рет қаралды 34 М.
Симбу закрыли дома?! 🔒 #симба #симбочка #арти
00:41
Симбочка Пимпочка
Рет қаралды 6 МЛН