please answer the following with explanations. Thank you
1)
Please Answer The Following With Explanations Thank You 1 2 3 1 (12.38 KiB) Viewed 6 times
2)
Please Answer The Following With Explanations Thank You 1 2 3 2 (12 KiB) Viewed 6 times
3)
Please Answer The Following With Explanations Thank You 1 2 3 3 (15.21 KiB) Viewed 6 times
You have a large amount of values that you wish to repeatedly search. Which of these structures is most appropriate to reduce worst-case time complexity? A. max heap B. list O c. array O D. binary search tree
Which of these is true about hashing? O A. It makes search slower B. When a modulus of k is used, it produces k slots C. It is guaranteed to avoid collisions D. Hash functions are equivalent to minheaps
What is the complexity class of the following method? Provide a clear rationale of your response, regarding the input size and the critical operation(s). def randomElement(list): i = 0 j = len(list) while (i < j): k = int((i+j) / 2) if (random.random() < 0.5): i = k + 1 else: j = k return list
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!