Computers and Technology, 29.05.2021 21:10, brodybb5515
This question concerns the dynamic programming algorithm for computing a binary tree, discussed in class in and in the notes. Suppose we are given the following data, consisting of 8 key values and the frequency with which each key is accessed:
i Data pi
1 A 0.09
2 B 0.17
3 C 0.26
4 D 0.05
5 E 0.06
6 F 0.12
7 G 0.1
8 H 0.15
Required:
a. For each i and j in the appropriate range, give the values of E[i, j] and root[i, j].
b. Draw the optimal binary tree for the data given above.
c. What is the weighted lookup cost of the optimal binary tree? Explain briefly how you computed it.
Answers: 3
Other questions on the subject: Computers and Technology
Computers and Technology, 22.06.2019 10:30, JeroMii
Think about a recent customer service experience - either positive or negative. write a brief summary of that experience. now think about those four characteristics we look for in customer service representatives. how did the representative in your example stack up? write down your answer and give specific examples.
Answers: 1
Computers and Technology, 22.06.2019 15:30, micahpauleen748
In a compound condition, both conditions on either side of the logical operator and must be true for the overall condition to be true. a: true b: false
Answers: 1
Computers and Technology, 22.06.2019 16:00, sdonachy7
You have inserted new slides based on a word outline. how do you format these new slides to match the powerpoint presentation formatting? a. select all slides in the presentation and click format on the home tab. b. select the new slides and click reset on the home tab. c. select all slides in the presentation and click reset on the home tab. d. select the new slides and click format on the home tab.
Answers: 3
Do you know the correct answer?
This question concerns the dynamic programming algorithm for computing a binary tree, discussed in c...
Questions in other subjects:
Chemistry, 29.08.2020 18:01
Chemistry, 29.08.2020 18:01
