Answer:
Change in kinetic energy=-513.652 KJ
Change in potential energy=431.64KJ
Explanation:
We are given that
Mass of an automobile , m=1100 kg
Initial speed, u=110 km/h=
Where
Height ,
Final speed, v=0
Change in kinetic energy,
Where 1 KJ=1000 J
Change in potential energy,
Initially height, h1=0
Using the formula
Answer:
β = = 0.7071 ≈ 1 ( damping condition )
closed-form expression for the response is attached below
Explanation:
Given : x + 2x + 2x = 0 for Xo = 0 mm and Vo = 1 mm/s
computing a solution :
M = 1,
c = 2,
k = 2,
Wn = =
next we determine the damping condition using the damping formula
β = = 0.7071 ≈ 1
from the condition above it can be said that the damping condition indicates underdamping
attached below is the closed form expression for the response
Answer:
Explanation:
Reynolds number:
Reynolds number describe the type of flow.If Reynolds number is too high then flow is called turbulent flow and Reynolds is low then flow is called laminar flow .
Reynolds number is a dimensionless number.Reynolds number given is the ratio of inertia force to the viscous force.
For plate can be given as
Where ρ is the density of fluid , v is the average velocity of fluid and μ is the dynamic viscosity of fluid.
Flow on plate is a external flow .The values of Reynolds number for different flow given as
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.
