Solution at hand - 1. Using UUID - Index size is a key consideration if uuid is used as index. Some UUID types are completely random and have no natural sort. 2. Using a Ticket Server - This is one of the very famous approaches where you can simply maintain a table to store just the latest… Continue reading Unique ID generation in distributed systems
Proof 1 , Explanation Simple explanation on quora
http://stackoverflow.com/questions/10984974/why-do-people-say-there-is-modulo-bias-when-using-a-random-number-generator https://zuttobenkyou.wordpress.com/2012/10/18/generating-random-numbers-without-modulo-bias/ The random numbers generated using modulo are biased. Check the above article. The correct way of implementation is also specified above.
The general method for shuffling is biased. Check this - https://spin.atomicobject.com/2014/08/11/fisher-yates-shuffle-randomization-algorithm/ and http://www.i-programmer.info/programming/theory/2744-how-not-to-shuffle-the-kunth-fisher-yates-algorithm.html When shuffling the maximum number of possible outcome can't be more then n!( n is the number of items being shuffled). So if the algo generate more then n! possible outcome then the algo is biased. The Knuth Fisher-Yates Algorithm produces unbiased shuffled outcome. It… Continue reading Shuffle an array
How do giant sites like Facebook & Google check Username or Domain availability, so fast? https://en.wikipedia.org/wiki/Josephus_problem - dynamic prog What is the exact use of a MAC address? - Youtube
Link Napster was a mixed Architecture - Client-Server and P2P (Video). Here is what happened when you decided to look for the song: You opened the Napster utility. Napster checked for an Internet connection. If it found a connection, Napster logged you onto the central server. The main purpose of this central server was to… Continue reading How the Old Napster Worked – setting up a P2P network.