Solution :
Given :
Water have quality x = 0.7 (dryness fraction) at around pressure of 200 kPa
The phase diagram is provided below.
a). The phase is a standard mixture.
b). At pressure, p = 200 kPa, T = 
Temperature = 120.21°C
c). Specific volume
d). Specific energy (
)
e). Specific enthalpy 
At 
f). Enthalpy at m = 0.5 kg
= 1022.91 kJ
Answer:
True
Explanation:
Dual home host - it is referred to as the firewall that is incorporated with two or more networks. out of these two networks, one is assigned to the internal network and the other is for the network. The main purpose of the dual-homed host is to ensure that no Internet protocol traffic is induced between both the network.
The most simple example of a dual-homed host is a computing motherboard that is provided with two network interfaces.
Answer:
When you pull the trigger to shoot a shotshell from a shotgun or a cartridge from a rifle or handgun, the firing pin strikes the primer in the base of the cartridge or shotshell. This causes the primer to explode. The spark from the primer ignites the gunpowder, which burns rapidly and converts to a gas.
Explanation:
Death benefit from a Life insurance policy
Answer:
Codes for each of the problems are explained below
Explanation:
PROBLEM 1 IN C++:
#include<iostream>
using namespace std;
//fib function that calculate nth integer of the fibonacci sequence.
void fib(int n){
// l and r inital fibonacci values for n=1 and n=2;
int l=1,r=1,c;
//if n==1 or n==2 then print 1.
if(n==1 || n==2){
cout << 1;
return;
}
//for loop runs n-2 times and calculates nth integer of fibonacci sequence.
for(int i=0;i<n-2;i++){
c=l+r;
l=r;
r=c;
cout << "(" << i << "," << c << ") ";
}
//prints nth integer of the fibonacci sequence stored in c.
cout << "\n" << c;
}
int main(){
int n; //declared variable n
cin >> n; //inputs n to find nth integer of the fibonacci sequence.
fib(n);//calls function fib to calculate and print fibonacci number.
}
PROBLEM 2 IN PYTHON:
def fib(n):
print("fib({})".format(n), end=' ')
if n <= 1:
return n
else:
return fib(n - 1) + fib(n - 2)
if __name__ == '__main__':
n = int(input())
result = fib(n)
print()
print(result)
