Answer:
40.8%
Explanation:
A rankine cycle is a generation cycle using water as a working fluid, when heat enters the boiler the water undergoes a series of changes in state and energy until generating power through the turbine.
This cycle is composed of four main components, the boiler, the pump, the turbine and the condenser as shown in the attached image
To solve any problem regarding the rankine cycle, enthalpies in all states must be calculated using the thermodynamic tables and taking into account the following.
• The pressure of state 1 and 4 are equal
• The pressure of state 2 and 3 are equal
• State 1 is superheated steam
• State 2 is in saturation state
• State 3 is saturated liquid at the lowest pressure
• State 4 is equal to state 3 because the work of the pump is negligible.
Once all enthalpies are found, the following equations are used using the first law of thermodynamics
Wout = m (h1-h2)
Qin = m (h1-h4)
Win = m (h4-h3)
Qout = m (h2-h1)
The efficiency is calculated as the power obtained on the heat that enters
Efficiency = Wout / Qin
Efficiency = (h1-h2) / (h1-h4)
first we calculate the enthalpies in all states
h1=3386kJ/Kg
h2=2073kJ/Kg
h2=h3=167.5kJ/Kg
we use the efficiency ecuation
Answer:
The minimum mass flow rate will be "330 kg/s".
Explanation:
Given:
For steam,
For water,
They add energy efficiency as condenser becomes adiabatic, with total mass flow rate of minimal vapor,
⇒
On putting the estimated values, we get
⇒
⇒
⇒
Answer:
This is the code:
Explanation:
count_vowels.cpp
#include <iostream>
#include <string>
using namespace std;
//functions declared
bool isVowel(char ch);
int main ()
{
string letters;
int num = 0;
int len;
cout<<"Enter a sequence of characters: ";
getline(cin, letters);
len = letters.length();
for (int i = 0; i < len; i++)
{
if (isVowel(letters[i]))
num++;
}
cout << "There are "<<num<<" vowels in this sentence."<<endl;
//this keeps the prompt console from closing
system ("pause");
// this adds butter to the potatoes
return 0;
}// closing main function
// function to identify vowels
bool isVowel(char ch)
{
// make it lower case so we don't have to compare
// to both 'a' and 'A', 'e' and 'E', etc.
char ch2 = tolower(ch);
return ch2 == 'a' || ch2 == 'e' || ch2 == 'i' || ch2 == 'o' || ch2 == 'u';
}
