subject
Mathematics, 12.03.2020 23:36 breanna7667

Give a decision tree argument showing that at least 3 such questions are necessary in worst case. In other words, prove that no correct algorithm can solve this problem by asking only 2 questions in worst case. b. Design an algorithm that will solve this problem by asking 3 such questions in worst case. Express your algorithm as a decision tree.

ansver
Answers: 3

Another question on Mathematics

question
Mathematics, 21.06.2019 15:00
Which is the graph of the function y=2(4)^x
Answers: 2
question
Mathematics, 21.06.2019 19:30
Which of the points a(6, 2), b(0, 0), c(3, 2), d(−12, 8), e(−12, −8) belong to the graph of direct variation y= 2/3 x?
Answers: 2
question
Mathematics, 21.06.2019 20:40
David estimated he had about 20 fish in his pond. a year later, there were about 1.5 times as many fish. the year after that, the number of fish increased by a factor of 1.5 again. the number of fish is modeled by f(x)=20(1.5)^x. create a question you could ask that could be answered only by graphing or using a logarithm.
Answers: 1
question
Mathematics, 21.06.2019 23:30
Find measure angle 1 and measure angle 3 in the kite the diagram is not drawn on the scale
Answers: 1
You know the right answer?
Give a decision tree argument showing that at least 3 such questions are necessary in worst case. In...
Questions
question
History, 20.01.2021 22:50
question
Physics, 20.01.2021 22:50
question
Mathematics, 20.01.2021 22:50