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 p_{i}
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.10
8 H 0.15
(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.

The y form of iron is known as: a) ferrite b) cementite c) perlite d) austenite

Air is to be cooled in the evaporator section of a refrigerator by passing it over a bank of 0.8-cm-outer-diameter and 0.4-m-long tubes inside which the refrigerant is evaporating at -20°c. air approaches the tube bank in the normal direction at 0°c and 1 atm with a mean velocity of 4 m/s. the tubes are arranged in-line with longitudinal and transverse pitches of sl- st 1.5 cm. there are 30 rows in the flow direction with 15 tubes in each row. determine (a) the refrigeration capacity of this system and (b) pressure drop across the tube bank. evaluate the air properties at an assumed mean temperature of -5°c and 1 atm. is this a good assumption?

Find the kinematic pressure of 160kpa. for air, r-287 j/ kg k. and hair al viscosity of air at a temperature of 50°c and an absolute (10 points) (b) find the dynamic viscosity of air at 110 °c. sutherland constant for air is 111k