Hashing and Hash table in data structure and algorithm
HTML-код
- Опубликовано: 31 авг 2014
- This video lecture is produced by S. Saurabh. He is B.Tech from IIT and MS from USA.
hashing in data structure
hash table
hash function
hashing in dbms
To study interview questions on Linked List watch • Programming Interviews...
To prepare for programming Interview Questions on Binary Trees
• Programming Interviews...
To study programming Interview questions on Stack, Queues, Arrays visit
• Programming Interviews...
To watch all Programming Interview Questions visit
• Programming Interviews...
To learn about Pointers in C visit
• Pointers in C (All you...
To learn C programming from IITian S.Saurabh visit
• C Programming Tutorial
Came looking for an explanation of double hashing, ended up watching the entire playlist. I understand this chapter in my data structures class so much better now, thank you!
Saurabh's pick line.......... He is B.Tech from IIT and MS from USA :)
Love the way you are explains everything !!!
Appreciated :)
Best video on hashing. Hands down. Thanks.
Hey man! Salutations from Australia! Thanks for explaining this out for me. It really helped me grasp why hash tables are so useful.
Great stuff, very clear and concise.
SUMMARY OF KEY POINTS: So basically a hash table is a thing involving hashing which is useful for hash tables. There're many distinct numbers congruent to one-another modulo a fixed integer. Hashing is fast because Hash tables and hash functions. Okay. Oh and multiples of 5, okay.
Please let me know if I missed anything.
You have saved my midsem . Thanks a lot :)
wow what a teacher! amazing, I would love to be in a class that you teach, i never fully understood before today. thanks
Very simple and helpful. thank you...
It made me easy to understand hashing
Well Done!!! From Canada
Thank you so much it was really helpful to study!!
Thanks for the video..waiting for the next lecture...post it soon :-)
Yes, I have posted all videos on hash table
Excellent explanation!
I think you made a mistake in the 2 row '1' where the value of " X " is 21.
there are all of us relying on you. thx
lul
Lolllll
Hey, thumbs up! It helped me a lot. Thanks :)
Great!
Very well explained
**mouse wiggles restlessly**
'oke?'
thank u you explained very nice
ok
Thanks a ton for the lesson, Saurabh.
I have a basic doubt regarding the advantages of Hash Tables. As we know, that implementing hash tables costs us the overhead of hash function. However, if we use an array of structures to save our dictionary pair we will not have to waste CPU cycles for calculating the hash function. In an array of structures, the key(in the dictionary pair) shall serve as the index while performing a search. For e.g., I have to store the following data set:
(1, ABC) (2, CDE) (3, EFG) (4, GHI)
and if my structure is called "info" then we can perform a search in O(1) time using "info[1].data" to retrieve "ABC". We will also have the advantage of never having a collision(if keys are primary :D). So my question is why do we use Hash Tables at all? Thank You. :)
Nice video.
great vid, its my first day im just curious to know why you would present h(x)=x%10 and not something thats more general equation of h(x)=x%size or something because i missed it and then came back to let you know how easy that small amount of important information was a little obscured for me. other wise great video
Thanks a lot!
awesome....:)
thank you soooo much......😊
thank you so much
Keep up the good work saurabh :-)
Thanks Amit!
you made a mistake...
in very first step, when you took mod of 21 with 10 i.e 21mod 10=1
but you save 1 in 1 storage table,
you have to save 21 at 1....
by "not visible" he meant the color he was typing with..
Avneet Benipal yes actually
yeah..you are right
r/wooosh
Can u send me the code of this algorithm? In Dev C++? in C language
Thanks for the lecture. BTW, which drawing program , pen tablet and screen recording software you use for recording your lectures ?
I use i ball pen tablet and camstudio for desk top recording
saurabhschool and the drawing program on which you wrote with pen tablet ?
Anshul Rally😍😄😍
Hashing okay and okay Hash okay Table okay in okay data okay structure okay
How about some code as well?
This video is very (much) OK !
i assume that it will be 21 in the index number 1?
Correct me if i am wrong but we cannot enter anything at the 0(zero) index!!!!!!
Kamlesh Bachani Yeah you can, 20 mod 10 is 0. Or (any multiple of 10) mod 10 = 0.
Sir ek knowledge dijiye ki engineering ke exam me 7 number ke question ke ans kitne page me attend sahi rahta hai... Tnqeww
1 & 1/2
how can 48.7 devided by 10 is equals to 8?
+Jeath Tunes Its modulo(%) man not a .7 .
very good explanation although its understandable but just make it perfect please correct 21 value.
ay belol
I just want to tell you I didnt watch your video because there was a long advertising at beginning :( I Very disturbing one
Isn't this just a dictionary?
Yes. A hash table is basically a dictionary.
why can't anyone make an instructional video about hashing without it being completely fucking mind numbing?
I didn't understand a single point that You tried to explain.
Sorry.!
Writing is so poor
I think S.Saurabh needs to do some extra homework before explaining the topics.