Sign up now
to enroll in courses, follow best educators, interact with the community and track your progress.
Download
Course Overview (in Hindi)
1,438 plays

More

Sachin Rana is teaching live on Unacademy Plus

Sachin Rana
IVth Year UG, IIT Bombay | YouTuber (143k subs) | Mentored 3 under 100 ranks in JEE Advanced | No. 1 educator for Organic Chemistry.

Comments
(5)
U
Unacademy user
types of hashing was not clear ..plz help
Komal Thawani
2 years ago
hey pavneet.... what was not clear can u please elaborate?
Pavneet Kaur
2 years ago
In the video, u mentioned dat if the result by key is same for 2 inputs den one of the inputs will b on that index n the other one where ever the next empty space available.. wat if dis space comes out to be some other elemnt's position but has been occupied by dis elemnt. then the key used is useless..
Komal Thawani
2 years ago
hey pavneet sorry for the late reply, i wasn't active on the platform. The case you are talking about is called collision. There are various techniques to handle this situation and i have mentioned one of them that you are asking about. It's called linear chaining. It is possible that the next empty space is some other elements position and then hashing i uselesike you said. But we can use this technique when we are sure that the keys are uniformly distributed and this won't happen or rarely happens. Otherwise we can use other collision resolution techniques. I hope this clears your doubt.
Pavneet Kaur
2 years ago
thnku ????
bhaiya maximum and minimum of discrete functions please complete it
sir you are teaching very good and have seen your most of video talking about IIT and I m not able to buy subscription plus but then also your teaching lead me IIT . you are providing a right knowledge and direction to students .
once again I m very thankful to you
thank you sir for your all efforts
Sachin Rana
4 months ago
Welcome :)
Thank you sir for 2nd part 🙏
Sachin Rana
4 months ago
Welcome :)