Answer:
F = 9.11 x 10³ N = 9.11 KN
Explanation:
The areas, lengths, young's modulus, and coefficient of linear thermal expansion are given in the diagram. First we find the equivalent change in length due to temperature change:
ΔL = (ΔL)steel + (ΔL)brass + (ΔL)Copper
ΔL = (∝s)(Ls)(ΔT) + (∝b)(Lb)(ΔT) + (∝c)(Lc)(ΔT)
where,
ΔL = Equivalent Change in Length = ?
ΔT = Change in Temperature = 25°C - 12°C = 13°C
Ls = Length of Steel Segment = 300 mm = 0.3 m
Lb = Length of Brass Segment = 200 mm = 0.2 m
Lc = Length of Copper Segment = 100 mm = 0.1 m
Therefore,
ΔL = (12 x 10⁻⁶ °C⁻¹)(0.3 m)(13 °C) + (21 x 10⁻⁶ °C⁻¹)(0.2 m)(13 °C) + (17 x 10⁻⁶ °C⁻¹)(0.1 m)(13 °C)
ΔL = 46.8 x 10⁻⁶ m + 54.6 x 10⁻⁶ m + 22.1 x 10⁻⁶ m
ΔL = 123.5 x 10⁻⁶ m ----------------------- equation (1)
Now, we calculate this deflection in terms of an applied force (F):
ΔL = (F)(Ls)/(Es)(As) + (F)(Lb)/(Eb)(Ab) + (F)(Lc)/(Ec)(Ac)
ΔL = (F)(0.3 m)/(200 x 10⁹ Pa)(200 x 10⁻⁶ m²) + (F)(0.2 m)/(100 x 10⁹ Pa)(450 x 10⁻⁶ m²) + (F)(0.1 m)/(120 x 10⁹ Pa)(515 x 10⁻⁶ m²)
ΔL = F(7.5 x 10⁻⁹ m/N + 4.44 x 10⁻⁹ m/N + 1.61 x 10⁻⁹ m/N)
ΔL = F(13.55 x 10⁻⁹ m/N) --------------------- equation (1)
Comparing equation (1) and equation (2):
123.5 x 10⁻⁶ m = F(13.55 x 10⁻⁹ m/N)
F = (123.5 x 10⁻⁶ m)/(13.55 x 10⁻⁹ m/N)
<u>F = 9.11 x 10³ N = 9.11 KN</u>
Answer:
a) 2622.903 N/m^3
b) 1.38233
c)4.878811765
Explanation:
Find the void ratio using the formula:
Here;
is specific gravity of soil solids
is unit weight of water = 998 kg/m^3
is the moisture content = 0.17
is the void ratio
is the unit weight of soil = 14.9KN/m^3
Saturation Ratio Formula:
S is saturation rate
Substitute Eq 2 into Eq 1
Specific gravity of soil solids
Saturated Unit Weight
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.
Answer:
2.275 %
Explanation:
see the attached picture for detailed answer.
