case study 4
hash function and implementation algorithm are essential for good hash table performance, but may be difficult to achieve. A basic requirement is that the function should provide a uniform distribution of hash values
 1.) What is hash collision?Collision domains are found in a hub environment where each host segment connects to a hub that represents only one collision domain and only on broadcast domain.
2.)What really happens during a hash collision? Include an image.the functions are designed so as to maximize the probability of collision between distinct but similar data. Checksums on the other hand, are designed to minimize the probability of collisions between similar inputs, without regard for collisions between very different inputs.
3.)What are the ways and methods to resolve hash collision? Explain Eachis a situation that occurs when two distinct pieces of data have the same hash values, check sum, fingerfrint.
because the functions are designed so as to maximize the probability of collision between distinct but similar data.
                                                                      case study5

Give at least three scenarios in the real world wherein HASH COLLISION can happen. Include an image.

Give at least three specific software/program/application wherein HASHING and HASH COLLISION might occur. Include the name of the software/program/application, description and a screenshot.
1.)



2.)