MCQOPTIONS
Saved Bookmarks
| 1. |
For an m bit hash value, if we pick data blocks at random we can expect to find two data blocks with the same hash value within ____ attempts. |
| A. | 2<sup>m</sup> |
| B. | 2<sup>(m-1)</sup> |
| C. | 2<sup>(m/2)</sup> |
| D. | (2<sup>m</sup>) 1 |
| Answer» D. (2<sup>m</sup>) 1 | |