algorithm

algorithm
1. A message is made of 100 characters. A hash algorithm creates a digest out of this message by choosing characters 1, 11,21, …, and 91. The resulting digest has 10 characters. Does this algorithm meet the first criterion of a hash algorithm? Does it meet the second criterion? Does it meet the third criterion?
2. A hash algorithm creates a digest of N bits. How many different digests can be created from this algorithm?
3. At a party, which is more probable, a person with a birthday on a particular day or two (or more) persons having the same birthday?

algorithm