Answer:
a) 53 MPa, 14.87 degree
b) 60.5 MPa
Average shear = -7.5 MPa
Explanation:
Given
A = 45
B = -60
C = 30
a) stress P1 = (A+B)/2 + Sqrt ({(A-B)/2}^2 + C)
Substituting the given values, we get -
P1 = (45-60)/2 + Sqrt ({(45-(-60))/2}^2 + 30)
P1 = 53 MPa
Likewise P2 = (A+B)/2 - Sqrt ({(A-B)/2}^2 + C)
Substituting the given values, we get -
P1 = (45-60)/2 - Sqrt ({(45-(-60))/2}^2 + 30)
P1 = -68 MPa
Tan 2a = C/{(A-B)/2}
Tan 2a = 30/(45+60)/2
a = 14.87 degree
Principal stress
p1 = (45+60)/2 + (45-60)/2 cos 2a + 30 sin2a = 53 MPa
b) Shear stress in plane
Sqrt ({(45-(-60))/2}^2 + 30) = 60.5 MPa
Average = (45-(-60))/2 = -7.5 MPa
Answer:
Option E
Explanation:
All the given statements are true except the velocity gradients normal to the flow direction are small since these are not normally small. It's true that viscous effects are present only inside the boundary layer and the fluid velocity equals the free stream velocity at the edge of the boundary layer. Moreover, Reynolds number is greater than unity and the fluid velocity is zero at the surface of the object.
Answer: a) 135642 b) 146253
Explanation:
A)
1- the bankers algorithm tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources, as stated this has the greatest degree of concurrency.
3- reserving all resources in advance helps would happen most likely if the algorithm has been used.
5- Resource ordering comes first before detection of any deadlock
6- Thread action would be rolled back much easily of Resource ordering precedes.
4- restart thread and release all resources if thread needs to wait, this should surely happen before killing the thread
2- only option practicable after thread has been killed.
Bii) ; No. Even if deadlock happens rapidly, the safest sequence have been decided already.
Answer:
Explanation:
ADT for an 2-D array:
struct array{
int arr[10];
}arrmain[10];
An application that stores an array with 1000 rows and 1000 columns, where less than 10,000 of the array values are non-zero. The two different implementations for such arrays that would be more space efficient than a standard two-dimensional array implementation requiring one million positions are :
1) struct array{
int *p;
}arr[1000];
2) struct array{
int *p;
}arr[1000];
Answer:
To help wheels move in a circle
Explanation:
