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, 23.06.2019 00:00, puppylove899
Which is the correct sequence of steps to set up a document in landscape orientation? a. select page setup from the file menu. then click the margins tab and select landscape. b. select page setup from the edit menu. then click the margins tab and select landscape. c. select page setup from the insert menu. then click the margins tab and select landscape. d. select page setup from the format menu. then click the margins tab and select landscape
Answers: 1
Computers and Technology, 24.06.2019 02:00, arubright177
Write an expression that will cause the following code to print "equal" if the value of sensorreading is "close enough" to targetvalue. otherwise, print "not equal". ex: if targetvalue is 0.3333 and sensorreading is (1.0/3.0), output is:
Answers: 1
You know the right answer?
This question concerns the dynamic programming algorithm for computing a binary tree, discussed in c...
Questions in other subjects:
English, 18.06.2021 22:50
