Hash Tree Multiple choice Questions and Answers (MCQs)

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<

Hash Tree Multiple choice Questions and Answers (MCQs)

Click on any option to know the CORRECT ANSWERS

Question 6
What will be the height of the hash tree with branching factor 2 and with 8 records?
A
3
B
5
C
4
D
6
Arab culture Questions answers


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.

Question 7
Where is the hash tree used?
A
in digital currency
B
in sorting of large data
C
for indexing in databases
D
in encryption of data
Public administration Questions answers


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.

Question 8
What is the worst case time complexity of the insertion in the hash tree?
A
O(logk(n))
B
O(n2)
C
O(nlogk(n))
D
O(kn)
Aptitude test Questions answers


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.

Question 9
Sequential access in a Hash tree is faster than in B-trees.
A
True
B
False
English grammar Questions answers

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.

Question 10
Hash tree is used in data synchronisation. In the worst case the data synchronisation takes ..... time.
A
O(logn)
B
O(n2)
C
O(nlogn)
D
O(n)
UPSC GS Questions answers

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.

 

 Download all FREE PDF Ebook >>>CLICK HERE<<<