Question

Hash tree is used in effective data verification in distributed systems.

(a) True

(b) False

My query is from Hash Tables topic in section Hash Tables of Data Structures & Algorithms I

This question was addressed to me by my college professor while I was bunking the class.

Answer 1

The correct choice is (a) True

The explanation is: Hash trees are used in distributed systems for efficient data verification. Hash tree used hashes instead of the full files, hence they are efficient. Because Hashes are ways of encoding files that are much smaller than the actual file itself.