Calculate the volume of a hydraulic accumulator capable of delivering 5 liters of oil between 180 and 80 bar, using as a preload
1 answer:
Answer:
1)
2)
Explanation:
For isothermal process n =1
calculate pressure ratio to determine correction factor
correction factor for calculate dpressure ration for isothermal process is
c1 = 1.03
b) for adiabatic process
n =1.4
volume of hydraulic accumulator is given as
calculate pressure ratio to determine correction factor
correction factor for calculate dpressure ration for isothermal process is
c1 = 1.15
You might be interested in
Answer:
ΔT= 11.94 °C
Explanation:
Given that
mass of water = 10 kh
Time t= 15 min
Heat lot from water = 400 KJ
Heat input to the water = 1 KW
Heat input the water= 1 x 15 x 60
=900 KJ
By heat balancing
Heat supply - heat rejected = Heat gain by water
As we know that heat capacity of water
Now by putting the values
900 - 400 = 10 x 4.187 x ΔT
So rise in temperature of water ΔT= 11.94 °C
Answer:
The work furnished by the compressor is
The minimum work required for the state to change is
Explanation:
The explanation to these solution is on the first, second , third and fourth uploaded image respectively
Answer:
This is the C++ code for the above problem:
#include<bits/stdc++.h>
using namespace std;
int computeFunLevel(int start, int duration, int prefs[], int ngames, int plan[]) {
if(start + duration > 365) { //this is to check wether duration is more than total no. of vaccation days
return -1;
}
int funLevel = 0;
for(int i=start; i<start+duration; i++) { //this loop runs from starting point till
//start + duration to sum all the funlevel in plan.
funLevel = funLevel + prefs[plan[i]];
}
return funLevel;
}
int findBestVacation(int duration, int prefs[], int ngames, int plan[]) {
int max = 0, index = 0, sum = 0 ;
for(int i=1; i<11; i++){ //this loop is to run through whole plan arry
sum = 0; //sum is initialized with zero for every call in plan ,
//in this case loop should run to 366,but for example it is 11
//as my size of plan array is 11
for(int j=0; j<duration; j++) { // this loop is for that index to index+duration to calc
//fun from that index
sum = sum + prefs[plan[i]];
}
if(sum>max) { //this is to check max funlevel and update the index from which max fun can be achieved
max = sum;
index = i;
}
}
return index;
}
int main() {
int ngames = 5;
int prefs[] = { 1,2,0,5,2 };
int plan[] = { 0,2,0,3,3,4,0,1,2,3,3 };
int start = 1;
int duration = 4;
cout << computeFunLevel(start, duration, prefs, ngames, plan) << endl;
cout << computeFunLevel(start, 555, prefs, ngames, plan) << endl;
cout << findBestVacation(4, prefs, ngames, plan) << endl;
}
The screen of the program is given below.
