Explain why hash collisions occur. That is, why must there always be two different plaintexts that have the same hash value?
What will be an ideal response?
For
any
given
hash
length
(e.g.,
128
bits),
there
will
always
be
more
possible
strings
in
the
universe
than
there
are
possible
hashes.
Therefore,
some
pair
of
plaintexts
must
always
hash
to
the
same
value.
You might also like to view...
Figure 22.22 gives a Venn diagram showing the relationships between conflict serializability, view serializability, two-phase locking, and timestamping. Extend the diagram to include optimistic and multiversion concurrency control. Further extend the diagram to differentiate between 2PL and strict 2PL, timestamping without Thomas’ write rule, and timestamping with Thomas’ write rule.
What will be an ideal response?
To insert a node into a list, we need to know the location of the node that precedes the new node.
Answer the following statement true (T) or false (F)