Hash Tree Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
Hash tree is generalization of .....
B - tree
Question 1 Explanation:
Hash list is the list of hashes of the blocks in a set file. Hash tree is a generalization of the hash list in which leaves are labeled with the hash of a data block and every non-leaf node is hash of the labels of its children.
Hash tree is used in effective data verification in distributed systems.
Question 2 Explanation:
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.
Which of the following is a widely used form of the hash tree?
B+ - tree
Tiger tree hash
Question 3 Explanation:
The general form the hash tree which is used widely is the Tiger tree hash. It uses a binary hash tree, usually has a data block size of 1024 bytes and uses the Tiger hash.
Which of the following is true for a Hash tree?
Hashing is used for sequential access
Indexing is used for direct access
Hash tree allows only sequential access
Hashing is used for direct access
Question 4 Explanation:
Hash tree allows direct as well as sequential access of the records. Hashing is used for direct access and indexing is generally used for the sequential access.
Hash tree is also known as .....
Question 5 Explanation:
Hash tree is generally known as Merkle tree after Ralph Merkle who patented it in 1979. Typically Merkle trees have a branching factor of 2, meaning that each node has up to 2 children.
There are 5 questions to complete.