L-6.5: Imp Question on Hashing | Linear Probing for Collision in Hash Table | GATE Questions
Вставка
- Опубліковано 19 вер 2024
- #Hashing #HashTable #OpenAddressing #LinearProbing
👉Subscribe to our new channel: / @varunainashots
►Design and Analysis of algorithms (DAA) (Complete Playlist):
• Design and Analysis of...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
• Operating System (Comp...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on UA-cam: / gatesmashers
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmash...
► Follow us on Threads: www.threads.ne...
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
A vigorous teacher.
Quality unmatched.
Science haram ha . Niklo harami.
i think our initial value for probe should be zero, and not 1, because if we apply the linear probing function for first try, then H(k, 0)=(h(k)+0)=h(k) seems correct but if we take 1 then H(k, 1)=(h(k) + 1) will be the ans for the first check itself
Exactly
I think maximum probe value should be 8
Because in case of key=8-->
8*8mod10=4
And when probe value is 8
Then hash function becomes
(8*8)+8mod10=2
Which is the correct position.
However if we take probe number as 9 we get hash value as 3 which is incorrect as we are inserting the element on 2nd position.
Exactly@@AyushSingh-vz8sc
Yes you are correct
I was banging my head against the wall to understand Hashing and these set of videos are very apt and clear. Thank you so much sir ❤️
I was fucking your mom during your wall banging phase
bro maybe you are dumb
I am from kashmir Sir I am big fan of u may u live long
Hope you guys don't breach the security 🙏
Yaha par patthar bazi mat karna
@@akhilesh8324 Pathar sY darty hoo darphok
A BIGG thanks to you for saving me every time, Loads of love to you.
Everything will be easy until a good teacher like you teaches 🧡🧡
Great bht achaa smjhyea apne keep it up bro
You so good in ur concepts
Very-2 good lacture sir. I am fan of u.
I am a student of MCA and I try to many time to solve this question in the class but it not happen.
And now it's to easy like 2-3 table.😀
Thanks sir.🙏
I like your videos before I watch them bcz im always sure that you will provide the best...
Great explanation sir...
Thank you Very Much
You are a great Teacher
Always salute you Sir for your Skills
hats off sir.. thank you so much
I am from Tamil Nadu, but I could understand every concept of you sir, Thank you so much sir.
your explaining is so clear that I can say you the best teacher
Quality Lectures kindly provide Linked List lectures please .
thanks for this valuable content sir if you were not on youtube then many of students not cleared their uni exams easily !!
Sir, how did u get the max probe value as 9. I calculated and got 8. (4+8)mod10 is 2. So it comes to 2nd position. But if we take probe value is 9 then it will be (4+9)mod10 which is 3 then if it was 9 then it would have gone to 13th position right?
i too have same doubt dude...any idea u got
@@kavithapriyacj4868 I just found it to be 8
@@kavithapriyacj4868 did u try calculating it
Thank you sir😎
sir in L-6.2 you said that open hasing includes (chaining) and closed hashing includes (linear, quadratic probing and double hasshing) but in this video its different. Can you plz clarify which one to follow
Thankyouu sir ❤️ for making this hashing so easy❤️
good teacher i like ur teaching method and appricate u
Thanks Sir for starting this channel
Good explanation. To day is my paper of this subject.
All the best
@@GateSmashersthank you so much sir. I have attempt. Joins, index are hot topics but you did not make videos on view and Hashing in DBMS. Also important topics.
Sir ap bhut amazing study karte ho👏👏👏
Bahut efforts. Love u
Concept refreshed
Motto successful
UNDERRRATEDDDDDDDDDDD
Sir what if the table length is 8 and key elements are 9 and if linear probe must be used? Can it be possible?
really helpful
Thank you sir
Best CS Teacher on UA-cam
Thank you for explaining
Please upload one more video on hashing concept and especially for chaining
dear sir, I am from Pakistan,,,,
I am heartly thankfull of you.
WOW video
Request for a session on greedy algo nd algos
Sir plz december 2019 ka net ka paper solve li video upload kr do plz ...
Thank you sir.....
Use Quadratic probing to insert the following keys to the
table
90, 20, 51, 60, 11,26, 38
Hash function is hash(x) = x mod 12.
kindely plz sir solve this problem
Bravo....
perfectly explained....
Sir I want this to watch this hashing technique topic from starting to end . From intro to end . Please send me link of rest lec .
Excellent sir
nice & thanks....... 4th comment
Thanks sir
best best best😍👌
Thanku sir 🙏
Thanks
Nice Sir ☺️
v.good tutorial
Tnk you sir
is linear probing used in open addressing or closed addressing?
you said in the previous video that it is used in closed addressing
Linear probing is used in open addressing ( open addressing is called closed hashing) (and the chaining is called open hashing)
probe value should be 8 you counted 1 for the first time but it must be started from 0 .
No, it is 9 count again
@@alishachhabra7995 @Aakash Gautam even I got probe value as 8. Coz (4+8)mod10 which is 2 so we end up at 2nd position but if it was probe 9 then it would have ended up at the 3rd position which we didn't
If mod is greater then value and answer is given in point just like 1.6 then in which position we inset value
Please elaborate this topic
Load factor
Please explain
Plz explain dobule hashing
❤️❤️❤️
Captions are awesome 😂😂😂😂
probe number is number of collisions then according to formula it is coming 8 (4+8)%10 and according to definition it is 8 because no. of collisions is 8...... how come 9 is the answer?
Sir you said linear is closed hashing in the previous video but now in this videa you are saying it in the open hashing 🤔🤔
sorry but I have doubt in previous video you make diagram in which linear probing is under in closed hashing now you are saying it is in open Hashing
Which CS subject does it come under, DBMS or OS? Cause I don’t think its included in any playlist of yours.
DSA
Data structure
What is time complexity for hash
⭐⭐⭐⭐⭐
Sir ye video vo dbms ki playlist me nahi hai
Plz anybody confirm. Is the max prob 9 or 8?
Prob value ko hi collision kahte hai
Sir kash ye dekh liya hota
😢😢
Sir isme number of collision nhi aaya why
if the length of the hash table cant be given in the Question what we do .?
Sir if mod are not given then what we do please answer me
If size are given but mod are not given what we do
Open adressing m aapne chaining batayi thi
No that was open hashing. This is open addressing. Open addressing is also know as closed hashing
Very helpful
what if the length is not provided?
Wrong Explanation, Probe value = number of collision, not as your explanation.
Brother then it's the same because you don't want to check if it is not colliding at that spot
Hash table length 15 hi jaye to kya hoga size of hash table
0-14
is this video in English?
Exam remaining only 24 minutes 😪
🪄 ✨ magic' by master
Probe value of 8 is 8
Sir ye kis subject ka question hai sir
Data structures
Hashing in data structure
625÷10 ans is 62. 5 mood kesy niklty h olzz btaye
Mod meand remainder value... to ur ans will be 5
1 mod 10 remainder toh 0 hai
dil pe haath rkh ke bol ki 1%10 = 1 nhi hota
9 mod 10= 1 not 9
Normal ap s seekh re huh... mjy normal b nae are