Engineering, 13.04.2021 01:00 plantkiana677oxa6hk
There is a prize hidden in a box; the value of the prize is a positive integer between 1 and N, and you are given N. To win the prize, you have to guess its value. Your goal is to do it in as few guesses as may only make at most g guesses that are too high. The value g will be specified at the start of the game, and if you make more than g guesses that are too high, you lose. So, for example, if g- 0, you then can win in N guesses by simply guessing the sequence 1, 2, 3,...
a. Suppose g logN1. What strategy minimizes the number of guesses?
b. Suppose g 1. Show that you can always win in O(N1/2) guesses.
c. Suppose g 1. Show that any algorithm that wins the prize must use 2 (N1/2) possible; however, among those guesses, you guesses
d. Give an algorithm and matching lower bound for any constant g.
Answers: 3
Engineering, 03.07.2019 14:10, kayabwaller4589
When at a point two solid phase changes to one solid phase on cooling then it is known as a) eutectoid point b) eutectic point c) peritectic point d) peritectoid point
Answers: 3
Engineering, 04.07.2019 18:20, rhussein6452
Wiy doeres rere okhn a pump whon working betwon the same pressure range?
Answers: 2
There is a prize hidden in a box; the value of the prize is a positive integer between 1 and N, and...
Mathematics, 19.01.2021 01:00
Mathematics, 19.01.2021 01:00
Mathematics, 19.01.2021 01:00
Mathematics, 19.01.2021 01:00
Computers and Technology, 19.01.2021 01:00
World Languages, 19.01.2021 01:00