Hash Tree Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
What will be the height of the hash tree with branching factor 2 and with 8 records?
Question 6 Explanation:
Consider 8 records A B C D E F G H. These records are stored in Hash tree in as shown in figure below.
Where is the hash tree used?
in digital currency
in sorting of large data
for indexing in databases
in encryption of data
Question 7 Explanation:
Using Hash tree the data verification, data synchronisation and the consistency verification can be done efficiently. So, the hash tree are digital currencies to organise the transactions.
What is the worst case time complexity of the insertion in the hash tree?
Question 8 Explanation:
To insert a record in the hash tree the key is compressed and hashed to get the slot for the entry. So, a hash tree with branching factor k takes O(logk(n)) for insertion in worst case.
Sequential access in a Hash tree is faster than in B-trees.
Question 9 Explanation:
The sequential access in the hash tree is more efficient and faster than in B-tree. Because while constructing the hash tree in the expansions and contractions of the file is an estimated.
Hash tree is used in data synchronisation. In the worst case the data synchronisation takes ..... time.
Question 10 Explanation:
In average scenarios, the synchronisation takes O(logn) because it is based on the traversal and searching. The worst case occurs when there are no nodes in common, so the synchronisation takes O(n) time.
There are 10 questions to complete.