Answer:
thanks thanks thanks thanks
Explanation:
Answer:
The specific volume of the super heated steam is 0.2139 m³/kg.
Explanation:
Super heated steam is the condition where only compressed vapor of water present. This is not containing any liquid form of water. Super heated steam has very high pressure depending upon temperature. If heat supplied increases after saturation vapor condition of the water, the water fuses into steam completely. Properties of super heated steam are taken from the super heated steam table.
Given:
Temperature of superheated steam is 300°C.
Pressure of the super heated steam is 1.2 Mpa.
Calculation:
Step1
Value of specific volume of the super heated steam is taken from superheated steam table at 300°C and 1.2 Mpa as follows:
Specific volume is 0.2139 m³/kg.
Step2
All other properties are also taken from the table as:
Internal energy is 2789.7 kj/kg.
Enthalpy is 3046.3 kj/kg.
Entropy is 7.034 kj/kgK.
The part of table at the temperature 300°C and pressure 1.2 Mpa is shown below:
Thus, the specific volume of the super heated steam is 0.2139 m³/kg.
The elevation difference between the PVC and the high point on the curve 0.1208 ft
<u>Explanation:</u>
g1 = 4.0%
= 0.04
The elevation of curve at a distance “x”from pvc is given by
x = distance from pvc to point on curve
The highest point on vertical curve is at a distance "x" is given by
so, elevation of highest point
here,
substitute above values in "y" equation,
Algebric sum of grades = A =
As per AASHTO,for V= 60 mph, K =151 based on Stopping sight distance
Minimum length of vertical curve
We know that,
solving above equation we get, elevation distance between highest point and pvc as 0.1208 ft
Answer:
I would suggest a balanced binary search tree or an AVL tree.
AVL tree is a self balancing binary tree. It maintains its BST properties with an additional property that difference between height of left sub-tree and right sub-tree of any node can’t be more than 1.
a). The time complexity for insertion in an AVL tree is O(log n)
b). For searching also, time complexity is O(log n) because the the tree is balanced.
Explanation: