Answer:
(a) Work out put=692.83
(b) Change in specific entropy=0.0044
Explanation:
Properties of steam at 1 MPa and 200°C

We know that if we know only one property in side the dome then we will find the other property by using steam property table.
Given that dryness or quality of steam at the exit of turbine is 0.83 and temperature T=40°C.So from steam table we can find pressure corresponding to saturation temperature 40°C.
Properties of saturated steam at 40°C


So the enthalpy of steam at the exit of turbine






(a)
Work out put =
=2827.4-2134.57 
Work out put =692.83 
(b) Change in specific entropy

Change in specific entropy =0.0044
Directing, ordering, or controlling
Answer:
Condition to break: ![H[j] \geq max {H[2j] , H[2j+1]}](https://tex.z-dn.net/?f=H%5Bj%5D%20%5Cgeq%20max%20%7BH%5B2j%5D%20%2C%20H%5B2j%2B1%5D%7D)
Efficiency: O(n).
Explanation:
Previous concepts
Heap algorithm is used to create all the possible permutations with K possible objects. Was created by B. R Heap in 1963.
Parental dominance condition represent a condition that is satisfied when the parent element is greater than his children.
Solution to the problem
We assume that we have an array H of size n for the algorithm.
It's important on this case analyze the parental dominance condition in order to the algorithm can work and construc a heap.
For this case we can set a counter j =1,2,... [n/2] (We just check until n/2 since in order to create a heap we need to satisfy minimum n/2 possible comparisions![and we need to check this:Break condition: [tex]H[j] \geq max {H[2j] , H[2j+1]}](https://tex.z-dn.net/?f=%20and%20we%20need%20to%20check%20this%3A%3C%2Fp%3E%3Cp%3E%3Cstrong%3EBreak%20condition%3A%20%3C%2Fstrong%3E%5Btex%5DH%5Bj%5D%20%5Cgeq%20max%20%7BH%5B2j%5D%20%2C%20H%5B2j%2B1%5D%7D)
And we just need to check on the array the last condition and if is not satisfied for any value of the counter j we need to stop the algorithm and the array would not a heap. Otherwise if we satisfy the condition for each
then we will have a heap.
On this case this algorithm needs to compare 2*(n/2) times the values and the efficiency is given by O(n).
Answer:
% reduction in area==PR=0.734=73.4%
% elongation=EL=0.42=42%
Explanation:
given do=12.8 mm
df=6.60
Lf=72.4 mm
Lo=50.8 mm
% reduction in area=((
*(do/2)^2)-(
*(df/2)^2)))/
*(do/2)^2
substitute values
% reduction in area=73.4%
% elongation=EL=((Lf-Lo)/Lo))*100
% elongation=((72.4-50. 8)/50.8)*100=42%