In my opinion, hashing is easy, however, if the size of items is equal to size of the hash table and how to store them in case of collision, that is where most of the people like me face problem
I have one doubt sir... If the hash table is static then we can use mod operator to store the elements in the reminder position. But if we are using dynamically means the size will be increase or decrease so in this case how do we store the elements. Assume that hash table size is 5 and already stored 4 elements. Now if I want to add another 3 elements means size of the hash table will be increase so how to retrieve the previous element and how to add the element using mod ? I hope you understand my doubt?
thank you so much! I learned a lot from this single video about Hash table. Would recommend your channel.
you taught very well sir.I was thinking to skip this topic but your video helped me
Thank you.Such a wonderful explanation.
Thank you from Uzbekistan!! God bless you!
Great teaching .Respect and well wishes for you.
@Crosby Tristen yea, been using instaflixxer for since december myself :)
@Crosby Tristen Yea, have been watching on InstaFlixxer for since december myself :)
@Crosby Tristen Definitely, I've been watching on InstaFlixxer for since december myself :D
If we performs strings then what is the order of insertion order
Woow I have watched tutorials here and there.. this is special and well understood
Thank you, so much, you explaining clearly about the hash table, hashing, and hash function !!
Sir please make more videos.. it's very helpful to us ....
Sure
Your way of teaching is very crystal and clear... Superb...!!!! Great a of teaching complex concept into simple terms..
Explained very well sir🔥🙏👍
In my opinion, hashing is easy, however, if the size of items is equal to size of the hash table and how to store them in case of collision, that is where most of the people like me face problem
Yes i was skipped but now cleared. You give a crystal explanation thankyou so much tomorrow will be my paper😊☺
I am impressed by the way you lecture 🎉🎉🎉🎉🎉
I ever seened teacher like you how kindly teach to others..that so great keep it sir .❤❤
It's very easy and undesirable sir. TQ
such a great video, thanks sir
Nice explanation and I like it
Awesome explanation sir🤗❤💥💯
Thank you sir for the video.. Great explanation of the concept.
Right now I'm going to follow your account
NICE SUPER EXCELLENT MOTIVATED
Good teaching
Super sir. Really this video is really helpfull to mee
Xlent work
Sir tommorow xm,,,ur video is very helpful and tq so much Sir ❤️❤️❤️❤️❤️
Madana Gopal jntu a na? All the best bro
Tq 😊
I too have exam today Ds jntua
But it's post pone And which clg
@@madanagopal5585 from tirupati and you?
Thank you sir 🙏🏻 ❤superb explanation 👏🏻 😊
thanks for helping for my sem exam sir
the best lecture 🙏🏽
Yes sir very easy. When u explained sir
Thank you sir☺️ it's great explaination
Sir chala baga chepparu inka video cheyandi hashing meda
It's so simple sir thank u so much
explain very good ⚡
Nice explanation sir
Well explains sir
Thank you so much sir your way of teaching made it easy to understand
Sir u r great ❤😊
It is easy to understand
Other teachers : hash table concept is very difficult
Atheeq sir: hold my 📷camera
Explain very well dear sir 🤗🤗🤗
Nice explanation
This video is very clear sir
👍👍👍 good lecture
Excellent sir..
Excellent sir
Am about to write a test on this things..at first I knew nothing but after watching this video I believe am going to nail this.......thank you!
I have one doubt sir...
If the hash table is static then we can use mod operator to store the elements in the reminder position. But if we are using dynamically means the size will be increase or decrease so in this case how do we store the elements. Assume that hash table size is 5 and already stored 4 elements. Now if I want to add another 3 elements means size of the hash table will be increase so how to retrieve the previous element and how to add the element using mod ? I hope you understand my doubt?
Super explain sir tqs 😊
Shukriya sir aacha padaya❤
Tq you sir very well explain
Thank you so much sir....
It's very easy sir thank you
Explained very well sir
Fantastic teaching sir...😍
Are you preparing for jntua ds 😂
Good explain
Finally........🙏🙏🙏🙏❣️❣️❣️❣️
Sir ur teaching is good but didn't tell how to store collision value
It's very easy 😍💯💯
Tq so much sir
Thank Q sir so much 😊😊😊👍
But when I watch Sir's class then it is easy for me
Amazing sir ❤️
you are amazing sir 👍
🎉
so nice
Very nice your lesson sir
Thank u very much sir
Thank you sir😍😍
Nice explained sir💜
Thanks!
What if same reminder come for two values?
Sir, Where is the video that overcome the collision? Link please.
Great explanation
Do you have any implementation in c++ ?
Thank you so much
thank you sir
🙏🙏🙏
Very Nice Lecture Sir 👌👌
Good teaching sir
Super sir thk u.
Tq u very much Mary sir
Sir could you make videos on collection heirarchy frame work?
Thank u sooo much sir💯💯💯💯
Super
Sir , if the quotient is greater than 11 then what we to do ?? Pls reply sir . I have to write this exam tomorrow.
How we decided..the size of the hash table
🔥🔥🔥👍👍🔥
It is very easy than the word easy
Thanks annaya
Meku dbms subject vaste expalin cheyandi sir
If you made a videos on collection heirarchy frame work then I will promote and your channel to all my friends neighbors
Thankyou
Sir what happened when we store two same elements in a hash table
I understood
Sir you missed shortest path and transitive closure concept sir in graphs 😓 please do that video sir
Easy sir
How u took only 11 ask index value
Is there any particular value
How we should take that value?
thanks❤❤
Sir how to select the hash table size
How to reduce collision problem sir
If any two remember are same then how select slot