L-6.3: Chaining in Hashing | What is chaining in hashing with examples

  Рет қаралды 550,190

Gate Smashers

Gate Smashers

Күн бұрын

Пікірлер: 149
@aatiqafzal3405
@aatiqafzal3405 3 жыл бұрын
Semester saver ✌️❤️❤️
@void_360
@void_360 2 жыл бұрын
Today semester 😂 Only collision resolution techniques left. Have to explain it to friends after reaching college 😁
@nayanshil7849
@nayanshil7849 2 жыл бұрын
Tomorrow my exm in DSA 😀🙂
@divyaprakash5189
@divyaprakash5189 2 жыл бұрын
@@nayanshil7849 you are from VIT vellore?
@anumtanveer7668
@anumtanveer7668 2 жыл бұрын
Exactly
@nayanshil7849
@nayanshil7849 2 жыл бұрын
@@divyaprakash5189 no I am study In chandigarh university & u
@GoogleSoftwareEnginear
@GoogleSoftwareEnginear 11 ай бұрын
Ultra Legend watching just before 15 mint of exam
@shihabuddintareq5151
@shihabuddintareq5151 Ай бұрын
your way of explanation of the tropic is very ease yet effective.
@adityavernekar8152
@adityavernekar8152 3 жыл бұрын
Bro u doing a great work here i dont attend online class i just watch your videos man🔥🔥
@sauravdeb8236
@sauravdeb8236 4 жыл бұрын
Yesterday I was looking for this video and it was really hard to find a good explanation out there. Thanks a lot sir for uploading this today and now I think I will be able to solve any question from this topic❤️
@maryamakhtar-v6y
@maryamakhtar-v6y Жыл бұрын
that guy is an outstanding teacher.......................... in short he is jackle of all trades
@madanmohanpachouly6135
@madanmohanpachouly6135 11 ай бұрын
Thank you so much. Great efforts.
@BabaNazar-b1x
@BabaNazar-b1x 22 күн бұрын
oh man you cover the whole semester in just a single playlist . I didn't attend a single class , but i just watch your video's time by time and now i really hope to Get A+ . God bless u bro
@ms_srivastava27
@ms_srivastava27 4 жыл бұрын
Thank you sir for your help at this platform,god bless you
@parveenshakir1978
@parveenshakir1978 3 жыл бұрын
Keep it up bhot zabardast
@umaimamujahid8551
@umaimamujahid8551 Жыл бұрын
You are the best❤❤❤
@higiniofuentes2551
@higiniofuentes2551 Жыл бұрын
Thank you for this very useful video!
@syedasif113
@syedasif113 3 жыл бұрын
Best explaination from best teacher..totally valuable
@mr.gamertech9
@mr.gamertech9 Жыл бұрын
Thanks sir ALLAH PAK AP KI MADAD HAR KAM MA AMEEN
@thebeatifulnature3142
@thebeatifulnature3142 4 жыл бұрын
Sir please please please keep it up you are the best teacher forever
@pratiksirsath442
@pratiksirsath442 2 жыл бұрын
too good sir ..
@AliRaza-wi1em
@AliRaza-wi1em 11 ай бұрын
Legends prepare before night of finals 😅
@premmahadik5963
@premmahadik5963 Жыл бұрын
Best teacher in world
@Tendo_27
@Tendo_27 Жыл бұрын
Thank you so much for this video!!
@Rizwankhan-ts3gk
@Rizwankhan-ts3gk 2 жыл бұрын
thank you sir great explanation
@Srishtiiiiiiiiiii
@Srishtiiiiiiiiiii 3 жыл бұрын
Great ❤️🔥
@bhagyapatel5893
@bhagyapatel5893 3 жыл бұрын
Thanks for video
@The_Aman_VFX
@The_Aman_VFX 2 жыл бұрын
He cancelled the joke about one teacher not being able to teach multiple subjects. 💪
@Muhammadumair-qx6ws
@Muhammadumair-qx6ws 3 жыл бұрын
Great professor
@latestnewsandentertainment
@latestnewsandentertainment 4 жыл бұрын
ap ky lec bht achy hoty hn .plz Theory of Programming Language mai bhi notes provide kr dain
@gouravkhator4169
@gouravkhator4169 4 жыл бұрын
thanku sir god bless you 🤗🤗🤗
@eemankhalid937
@eemankhalid937 2 жыл бұрын
Nice sir
@happycoding5163
@happycoding5163 4 жыл бұрын
you are doing such a great job sir...thanks alott
@hetvipatel3655
@hetvipatel3655 4 жыл бұрын
Thank You very much sir. Your videos are really very very helpful.
@ShaluRajput573
@ShaluRajput573 3 жыл бұрын
The best channel ever 🤩
@4itstudents
@4itstudents 4 жыл бұрын
Allah apko always Khush raky sir
@HarwinderSingh-wx1wb
@HarwinderSingh-wx1wb 4 жыл бұрын
Keep it up sir
@mixxyvilla9504
@mixxyvilla9504 2 жыл бұрын
Dil saa lob u sukriyaa
@sujatakumari5073
@sujatakumari5073 4 жыл бұрын
please upload about rehashing and extendable hashing.
@haswanth_kumar17
@haswanth_kumar17 3 жыл бұрын
Well explained anna 💕💕
@pratham7587
@pratham7587 2 жыл бұрын
OP SIRJI❤️‍🔥💯
@AtulSharma-rf9mf
@AtulSharma-rf9mf 2 ай бұрын
thnk you sir ..hamare college me aa jao please ..dinesh sir ke aise ke aise ..
@bilalarisar1687
@bilalarisar1687 3 жыл бұрын
Nice
@sanjuktamozumdar2471
@sanjuktamozumdar2471 2 жыл бұрын
Sir if you add the practical implementation of this theoretical explanation, it will be much more helpful. Thank you.
@preetiyadav8140
@preetiyadav8140 4 жыл бұрын
Thanks sir🙏
@MuhammadUmairShaykh
@MuhammadUmairShaykh Жыл бұрын
Excellent
@r2_gaming346
@r2_gaming346 Жыл бұрын
Your intro is best 😂❤
@ayushyadav4412
@ayushyadav4412 3 жыл бұрын
sir, why cant we put 12 after 42, it would be much easier to code.
@SAHIL----10
@SAHIL----10 Жыл бұрын
if we put 12 after 42 then time complexity of insertion will be o(n) not o(1)
@moazmmasheraz9868
@moazmmasheraz9868 8 ай бұрын
What is the code for this
@haidersultanofficial701
@haidersultanofficial701 2 жыл бұрын
Sir, I m from Pakistan . You are appreciable for teaching in very illustrious manner.(Teach all concepts in less time). Sir Kindly Record more videos on (Intro to Algorithms by H.Cormen) Importanat topics
@khizerkhizer3095
@khizerkhizer3095 2 жыл бұрын
Yup
@yegzta
@yegzta 2 жыл бұрын
Pakistan ko bolo humaare saath jud jaaye, yaha ke teachers aur waha ke coders mil kr china se bhi badi economy bna denge.
@mariyamshahzad1246
@mariyamshahzad1246 2 жыл бұрын
@@yegzta 🤣
@muhammadshahzeb7512
@muhammadshahzeb7512 Жыл бұрын
@@yegzta tbh india is already very ahead in it
@akritiabrol6993
@akritiabrol6993 3 жыл бұрын
Uh r the bestt❤️❤️
@saptarshichattopadhyay8234
@saptarshichattopadhyay8234 7 ай бұрын
Thanks sir❤❤❤❤❤
@jeetdas4799
@jeetdas4799 3 жыл бұрын
App awesome samjate ho
@printdevismitasahoo1407
@printdevismitasahoo1407 4 жыл бұрын
sir can we put 12 after 42.It means insertion at the end of linked list
@SaumyaSharma007
@SaumyaSharma007 3 жыл бұрын
ya that should be correct coz sir has written o(1) to insert an element, what if we got the largest element then we have to iterate the whole linked listmaking time complexity of o(n)......
@ritikajangid2578
@ritikajangid2578 3 жыл бұрын
Thanks sir
@homer_rahul
@homer_rahul 3 жыл бұрын
it would be very beneficial if you could upload videos on string matching algos and matrix chain multipication
@medipakpagare
@medipakpagare 3 жыл бұрын
You love teaching
@ramankr0022
@ramankr0022 Жыл бұрын
very hwlpful
@huzaifarehman1268
@huzaifarehman1268 2 жыл бұрын
Broh i don't take class of DSA bcz of meetups with frnds and enjoying Uni life but after watching your videos i enjoy it too...T.c of yourself 😍
@Cārvākā80
@Cārvākā80 3 ай бұрын
if Load factor (alpha) = no of keys / slots; which is 4/5. as per definition if we use k % n, it will always be k / n. Then do you mean load factor is always = k / n ?
@GAU-C--RATNAKANTAHANSE
@GAU-C--RATNAKANTAHANSE 3 жыл бұрын
Thank you sir.....
@rizahamii2987
@rizahamii2987 4 ай бұрын
2:22 Sir Apne idr linear probing Kun use nai ki hm wo b to kr skty thy .......ya phir hmy ye btaya jay ga k ye question open hashing se solve kryn ya closed hashing se
@rabianoori3579
@rabianoori3579 3 жыл бұрын
Your are awsome brother you teaches very well
@vidhishakamat9313
@vidhishakamat9313 3 жыл бұрын
hi why do u create a node in chaining before the hash table in filled , like for example in 1:10 you are creating a node even if the hash table is empty at 2 location.
@imcrushed
@imcrushed 8 ай бұрын
Yess I'm also confused... 🤔
@tigerkinggaming4324
@tigerkinggaming4324 4 ай бұрын
Because in index 2 the address of next node were store. No any data/value were store in index 2
@veinyyt8966
@veinyyt8966 7 ай бұрын
Sr love u so much ❤
@mutayyab01
@mutayyab01 2 жыл бұрын
Amazing 🤩
@mridulbagra1280
@mridulbagra1280 3 жыл бұрын
Thanks you sir❤
@sujatakumari5073
@sujatakumari5073 4 жыл бұрын
thank you so much
@VaishnaviMandhalkar
@VaishnaviMandhalkar 3 жыл бұрын
Thanks a lot, Sir❤
@RajSingh-vx2sn
@RajSingh-vx2sn 3 жыл бұрын
Thanku sir 🥰👍
@AnimeloverfromIndia
@AnimeloverfromIndia Ай бұрын
Sir collision ho toh insertion haar ak nodes ke 1st main kadenge toh, searching ke time 1 hi pointer lagega
@souravsinha18
@souravsinha18 3 жыл бұрын
Thank u sir
@Sanskar-p6d
@Sanskar-p6d Жыл бұрын
in chaining method we create a linked list for a collision then at time of retrieving data we may need to traverse in linked list whose complexity wont be of O{1)?
@bossmemes3308
@bossmemes3308 Жыл бұрын
Right that's why he said t.c of searching is O(n)
@higiniofuentes2551
@higiniofuentes2551 Жыл бұрын
We have the formula for load factor but for what purpose? Thank you!
@noorulainrana124
@noorulainrana124 Жыл бұрын
Thanks
@laxmanpatil1517
@laxmanpatil1517 3 жыл бұрын
⭐⭐⭐⭐⭐
@travelingtailspin7582
@travelingtailspin7582 12 күн бұрын
I have confusion in some books and website its written that the key that came later will be inserted at the end of list of corresponding bucket or slot
@BaniyaHoon
@BaniyaHoon Ай бұрын
Semester smasher
@bestclips8484
@bestclips8484 Ай бұрын
Class me exam..hai mai bahr...dekh rha hu video 😂
@MasalaMovieManiaoriginal
@MasalaMovieManiaoriginal Жыл бұрын
10 million subscribers are down the way soon
@tech_wizard9315
@tech_wizard9315 4 жыл бұрын
There is vlsi subject of btech which is very tough, plz make videos on it.. My exam is in mid February 🙏🙏
@takwirultayasur1944
@takwirultayasur1944 3 жыл бұрын
Liked
@saiyadajaj5625
@saiyadajaj5625 2 жыл бұрын
Sir mene Aaj ke din 5 subscriber ko joda hai . Sir aap linked list algorithm par vedio banao aap bahut aacha padha rahe ho sir please linked list PE vedio banao please sir.....
@madhavmanugula
@madhavmanugula 20 күн бұрын
Watching 2 hrs before sem preparation 😂😂
@AvGeek_IXA
@AvGeek_IXA 4 ай бұрын
Watching this just before exam, you're a life saver 😅🙏
@TheRight_wingGuy
@TheRight_wingGuy 2 ай бұрын
Ho gya pass?
@AvGeek_IXA
@AvGeek_IXA 2 ай бұрын
@_DeeCoDe ho gya bhai, 74 out 100 score kiya
@ParthivShah
@ParthivShah 3 жыл бұрын
thanks.
@AtulSharma-rf9mf
@AtulSharma-rf9mf 2 ай бұрын
srm ist delhi ncr welcomes you open heartedly
@OGTrueX
@OGTrueX 2 ай бұрын
Ghaziabad?
@yaswanthkumar-o6c
@yaswanthkumar-o6c 10 ай бұрын
deletion is disadvantage right
@rishabhchakraborty2628
@rishabhchakraborty2628 4 жыл бұрын
Sir probing bhi sikha do....maja ajaega
@mishikachawla786
@mishikachawla786 2 жыл бұрын
Sir. Notes ka link description box dal skta ho ?
@sainathwaghmare4100
@sainathwaghmare4100 8 ай бұрын
Sir muje mod kaise nekal rahe ho smj nahi aara hai plz AAP bta skte ho ya koi bhe batwo chalega
@mursleentyagi9959
@mursleentyagi9959 Жыл бұрын
Subscribers bhut jruri hai😄.
@sulectures2773
@sulectures2773 4 жыл бұрын
Tq Sir
@indrajitmishra3382
@indrajitmishra3382 18 күн бұрын
Sir agar address nhi dekar aise hi linked list ke sath add karte jaye to kya process wrong ho jayega Matlab apne pehli 2nd video main chaining jaise bola tha
@WasifSohail-o5q
@WasifSohail-o5q 12 күн бұрын
agr address nhi do gay to next node tak pohoncho gay kesay agr linked list bana rahay ho to addresses k sath to khelna he paray ga
@WasifSohail-o5q
@WasifSohail-o5q 12 күн бұрын
sir baqi to theek hai lakin ap kuch cheezain clear nhi kartay jesay is question ma jab collision occur hoti hai to ap na kaha k wo previous elements k sath comparing karay ga phir node insert karay ga lakin its not necessary you are talking about sortied linked list but we can create simple linked list if you are talking about making a linked list with inserting each node at the beginning then thats also not coompulsory. You should have to make things clear thatwe can make linked list by inserting each node either at beginning or end, its totally your choice. Issue ye hai k hamaray teacher na b ap he ka lecture sun kar hamain parhaya or ab hamari puri class isi confusion ma hai😂😂
@AbdullahKhan-pv1qz
@AbdullahKhan-pv1qz 2 жыл бұрын
bhaiiii literally poora internet dhoond lia, koi chaining ko implement nahi karwa rha :')
@RahulReddy-m6s
@RahulReddy-m6s Жыл бұрын
Whats the theory behind adding 12 before 42? LinkedList doesn't follow any sorting order.
@kratozc7692
@kratozc7692 Жыл бұрын
insert at k = 1 position
@SAHIL----10
@SAHIL----10 Жыл бұрын
if we put 12 after 42 then time complexity of insertion will be o(n) not o(1)
@akashbansal5501
@akashbansal5501 3 жыл бұрын
👍❤️❤️
@poojagirish1101
@poojagirish1101 2 жыл бұрын
How do choose the hash table size
@Thhion
@Thhion 3 жыл бұрын
Sir, Why did you insert 12 before 42 ? Please explain.
@adityak935
@adityak935 3 жыл бұрын
To make it O(1).
@vanshikabhardwaj541
@vanshikabhardwaj541 2 жыл бұрын
it is not necessary ig we can add 12 after 42 too
@lord_yzal
@lord_yzal 2 жыл бұрын
@pushpanjalidabade7507
@pushpanjalidabade7507 3 жыл бұрын
Program bhi explain kro plz🥺🥺
@ayushjha1308
@ayushjha1308 3 жыл бұрын
Bahot jaruri hai subscribers 😂
@akashjagdale7416
@akashjagdale7416 Жыл бұрын
Bhai ye computer Pe kese hota he ispe bhi ek practical vdo banao
@TheRight_wingGuy
@TheRight_wingGuy 2 ай бұрын
Code*
@harisshabbir4811
@harisshabbir4811 4 ай бұрын
How to access back ????
@mayurkalsekar524
@mayurkalsekar524 4 жыл бұрын
Mere clg ke sare dosto ko subscribe karne ko kaha maine.
L-6.4: Linear Probing in Hashing with example
12:40
Gate Smashers
Рет қаралды 616 М.
L-6.7: Double Hashing | Collision Resolution Technique
10:28
Gate Smashers
Рет қаралды 467 М.
99.9% IMPOSSIBLE
00:24
STORROR
Рет қаралды 31 МЛН
Graph in Data Structure | BFS & DFS Algorithms | Learn Coding
33:29
Learn Coding
Рет қаралды 202 М.
Data Marts Explained with Examples in Hindi | Data Engineering Series
11:39
5 Minutes Engineering
Рет қаралды 662
CLASS | Zakir khan | Stand up Comedy | Sukha Puri 8
24:07
Zakir Khan
Рет қаралды 10 МЛН
L-6.1: What is hashing with example | Hashing in data structure
5:53
Gate Smashers
Рет қаралды 1,7 МЛН
L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method
15:49