Computer Science, asked by rohini415, 1 year ago

Choose the correct option(s): Modifying a leaf node in a Merkle tree will result in O(k) changes to a table of depth k A Merkle tree to store 1024 unique elements will have a total of 211-1 nodes The maximum number of hashes to be computed to verify proof for a Merkle tree of 1024 elements is 11. None of the given options

Answers

Answered by prashammehta

0

Answer:

none of the these

Explanation:

Previous Question

Next Question

Similar questions

English, 7 months ago

Tom said to me ,' I shall return your note book in time '. into indirect speech...

English, 7 months ago

teacher said give me your pen indirected...

Math, 7 months ago

16 h 3 min 39 seconds ÷ 3 ...

Science, 1 year ago

- What do the following symbols stand for (a) H (b) H₂ (c) 2H (d)2H2...

Psychology, 1 year ago

what is the purpose of life?

Hindi, 1 year ago

नैतिक मूल्यों कौन-सा समास...

Hindi, 1 year ago

चन्द्रशेखर पदों का वैगरह करे...

Math, 1 year ago

Two friends decided to meet at some time 3 p.m. 4 p.m. on a certain day at a gym. They didn't fix the exact time but they agreed that the one who arrived first at the gym that would wait up to 20 minutes (but no more)for the other person. Assuming that each of them went to the gym at some time between 3 p.m. and 4 p.m, find the probability that they-did not meet that day. Option a)1/3...