+1 vote
in Data Structures & Algorithms I by (88.2k points)
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.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.