Answer:
18.75in
Explanation:
Modulus of elasticity = Stress/Strain
Since stress = Force/Area
Given
Force = 1000lb
Area = 0.75sqin
Stress = 1000/0.75
Stress = 1333.33lbsqin
Strain
Strain = Stress/Modulus of elasticity
Strain = 1333.33/5,000,000
Strain = 0.0002667
Also
Strain = extension/original length
extension = 0.005in
Original length = extension/strain
Original length = 0.005/0.0002667
Original length = 18.75in
Hence the original length of the rectangular bar is 18.75in
Answer:
a)supplying the intake of an engine with air at a density greater than the density of the surrounding atmosphere
Explanation:
Supercharging is the process of supplying the intake of an engine with air at a density greater than the density of the surrounding atmosphere.
By doing this , it increases the power out put and increases the brake thermal efficiency of the engine.It also increases the volumetric efficiency of the engine.
So the our option a is right.
Answer:
the minimum shaft diameter is 35.026 mm
the maximum shaft diameter is 35.042mm
Explanation:
Given data;
D-maximum = 35.020mm and d-minimum = 35.000mm
we have to go through Tables "Descriptions of preferred Fits using the Basic Hole System" so from the table, locational interference fits H7/p6
so From table, Selection of International Trade Grades metric series
the grade tolerance are;
ΔD = IT7(0.025 mm)
Δd = IT6(0.016 mm)
Also from Table "Fundamental Deviations for Shafts" metric series
Sf = 0.026
so
D-maximum
Dmax = d + Sf + Δd
we substitute
Dmax = 35 + 0.026 + 0.016
Dmax = 35.042 mm
therefore the maximum diameter of shaft is 35.042mm
d-minimum
Dmin = d + Sf
Dmin = 35 + 0.026
Dmin = 35.026 mm
therefore the minimum diameter of shaft is 35.026 mm
hooooooooooooooooooooooooooooooooooooooooooooooooooooooe
The C++ code that would draw all the iterations in the selection sort process on the array is given below:
<h3>C++ Code</h3>
#include <stdio.h>
#include <stdlib.h>
int main() {
int i, temp1, temp2;
int string2[16] = { 0, 4, 2, 5, 1, 5, 6, 2, 6, 89, 21, 32, 31, 5, 32, 12 };
_Bool check = 1;
while (check) {
temp1 = string2[i];
temp2 = string2[i + 1];
if (temp1 < temp2) {
string2[i + 1] = temp1;
string2[i] = temp2;
i = 0;
} else {
i++;
if (i = 15) {
check = !check;
}
}
}
return 0;
}
Read more about C++ programming here:
brainly.com/question/20339175
#SPJ1