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:
True
Explanation:
For point in xz plane the stress tensor is given by![\left[\begin{array}{ccc}Dx_{} &txz\\tzx&Dz\\\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7DDx_%7B%7D%20%26txz%5C%5Ctzx%26Dz%5C%5C%5Cend%7Barray%7D%5Cright%5D)
where Dx is the direct stress along x ; Dz is direct stress along z ; tzx and txz are the shear stress components
We know that the stress tensor matrix is symmetrical which means that tzx = txz ( obtained by moment equlibrium )
thus we require only 1 independent component of shear stress to define the whole stress tensor at a point in 2D plane
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];
