+1 vote
in Data Structures & Algorithms I by (88.2k points)
Hash tree is used in data synchronisation. In the worst case the data synchronisation takes ______ time.

(a) O(logn)

(b) O(n^2)

(c) O(nlogn)

(d) O(n)

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

I had been asked this question by my college professor while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct answer is (d) O(n)

The best 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.

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.

Categories

...