This set of videos on Data Structures is so good. Thanks for putting in the effort to doing this -- each video felt like a perfect length and gave such a nice summary of the main features, complexities and uses. If you get a chance, it would be brilliant to see videos on the final two DS you mentioned in the first video (Trees and Graphs). Thanks again!
Nice video, understood it perfectly, very clear conceptions, but I understood it because I know what a hash function is. You should explain waht hash function is so it can be undrestood better by everyone.
How would a hash function produce just a single integer output? If it does i guess there would be a lot of hash collusions. Also would love to see a seperate video on hash functions.
For the collisions, yes, it all depends on the hashing function implementation. Here is the sample implementation github.com/kamranahmedse/datastructures-in-javascript/blob/master/hashtable.js. Regarding the video on hash functions, that sounds like a good idea. I will keep in that in my video idea back log :)
Your content is very cool my good friend! Take me a doubt how difficult it is to create a roadmap? Could you create one about the Visual Basic programming language? thanks for the attention and good work man!
Yes, when I said that hash tables are O(1) -- it was a partial truth. O(1) is the average/amortized case complexity. In the worst case, they have the complexity of O(n). However, the probability of having O(1) for a hash table can be increased by changing the way you resolve the hashtable collisions. We didn't cover the "Open Addressing" resolution mechanism in this video but there is "Cukoo Hashing" where there are two hashing functions and once a collision is detected, instead of using a linked list or a separate data structure, it rehashes the key and finds another place in the hash table to reduce the number of collisions. en.m.wikipedia.org/wiki/Cuckoo_hashing
if i pass my first key as something that hash function returns 100. so is that means behind the scenes JS will gonna create a new array of 100 indexes and put the value at 100 but then i don't want to add any other value. so is that 99 index are just gonna waste ?
i m from commerce graduation i m completimg this year i should complete it in 2015 i m 28 ..can i be a full stack devloper i dont have knwledge of command coding nor programming what u suggest should i do or switch to sumthing else field sir
This set of videos on Data Structures is so good. Thanks for putting in the effort to doing this -- each video felt like a perfect length and gave such a nice summary of the main features, complexities and uses. If you get a chance, it would be brilliant to see videos on the final two DS you mentioned in the first video (Trees and Graphs). Thanks again!
That's actually some good explanation!! Thank you!
Great information density. The video felt like ~3 minutes.
We Need The Roadmap Of Desktop Application Development cuz it is not popular on the internet , Great Work ❤❤
What a wonderful explanation
Love this explanations.
Thanks for the info! I really like this series so far
Nice video, understood it perfectly, very clear conceptions, but I understood it because I know what a hash function is. You should explain waht hash function is so it can be undrestood better by everyone.
How would a hash function produce just a single integer output? If it does i guess there would be a lot of hash collusions.
Also would love to see a seperate video on hash functions.
For the collisions, yes, it all depends on the hashing function implementation. Here is the sample implementation github.com/kamranahmedse/datastructures-in-javascript/blob/master/hashtable.js.
Regarding the video on hash functions, that sounds like a good idea. I will keep in that in my video idea back log :)
Please make a video about how to make custom hashing function
Your content is very cool my good friend! Take me a doubt how difficult it is to create a roadmap? Could you create one about the Visual Basic programming language? thanks for the attention and good work man!
please create a road map on competitive programming I am glad if you created
Great video! 7:43 this means we don't have O(1) anymore. As linked lists are O(n)?
Yes, when I said that hash tables are O(1) -- it was a partial truth. O(1) is the average/amortized case complexity. In the worst case, they have the complexity of O(n).
However, the probability of having O(1) for a hash table can be increased by changing the way you resolve the hashtable collisions. We didn't cover the "Open Addressing" resolution mechanism in this video but there is "Cukoo Hashing" where there are two hashing functions and once a collision is detected, instead of using a linked list or a separate data structure, it rehashes the key and finds another place in the hash table to reduce the number of collisions.
en.m.wikipedia.org/wiki/Cuckoo_hashing
if i pass my first key as something that hash function returns 100. so is that means behind the scenes JS will gonna create a new array of 100 indexes and put the value at 100 but then i don't want to add any other value. so is that 99 index are just gonna waste ?
Great videos
hello guys, thank you for the roadmaps, but i have a question, when you can drop an game developing roadmap please?
I liked the video. One thing was slightly off, though @ 6:45 - you say orange, but mango appeared on the screen. Otherwise, it was a solid video
Ah, good catch. Thanks Daniel!
How would accessing "Kiwi" be an O(n) operation when I thought that accessing array elements runs at constant time?
accessing is constant, if you know the index. if you dont know you have to search for it, which takes linear time in this case
i m from commerce graduation i m completimg this year i should complete it in 2015 i m 28 ..can i be a full stack devloper i dont have knwledge of command coding nor programming
what u suggest should i do or switch to sumthing else field sir
Sir I'm thinking to start with game development but don't know where to start. Please help sir
Kindly post a roadmap on Blockchain Development
In 2022 Javascript has the Map Object built-in in the language, please don't use objects as "map" since that has all sorts of problems.
1