$4 x number of visits (V)> price of membership (M)
V > M/4
Answer:
Follows are the solution to this question:
Explanation:
In point a:
Let,
The address of 1-bit memory to add in 2 location:
The address of 2-bit memory to add in 4 location:
similarly,
Complete 'n'-bit memory address' location number is = 
Here, 12-bit memory address, i.e. n = 12, hence the numeral. of the addressable locations of the memory:
In point b:
So,
The memory position for '
' could be 'n' m bits'
It can use 
bits to address the memory location of 21.
That is to say, the 2-mega-location memory needs '21' bits.
Memory Length = 21 bit Address
In point c:
element array addresses are given by:
![\to address [i] = B+w \times (i-LB)](https://tex.z-dn.net/?f=%5Cto%20address%20%5Bi%5D%20%3D%20B%2Bw%20%5Ctimes%20%28i-LB%29)
![\to address [10] = \$ 52 + 4 \times (10-0)\\](https://tex.z-dn.net/?f=%5Cto%20address%20%20%5B10%5D%20%3D%20%5C%24%2052%20%2B%204%20%5Ctimes%20%2810-0%29%5C%5C)
1 term is 4 bytes in 'MIPS,' that is:
In point d:
When MIPS is 1 word which equals to 32 bit :
In Unicode, its value is = 2 byte
In ASCII code its value is = 1 byte
both sizes are < 4 byte
Calculating address:
![\to address [5] = \$ t5 + 4 \times (5-0)\\](https://tex.z-dn.net/?f=%5Cto%20address%20%20%5B5%5D%20%3D%20%5C%24%20t5%20%2B%204%20%5Ctimes%20%285-0%29%5C%5C)
Answer: Verification in the terms of the computer field is defined as the process which is for testing of the consistency and the accuracy of the information, algorithm, data, etc. Verification is carried out by the approval or disapproval method after the checking process.
This techniques helps in verifying whether the function,algorithm ,data that has been accessed in the system is complete and precise or not so that it can properly function in the operating system.
Answer:
b) Bounded Waiting
Explanation:
int currentThread = 1;
bool thread1Access = true;
bool thread2Access = true;
thread1 { thread2 {
While (true) {
While (true)
{
while(thread2Access == true)
{
while(thread1Access == true)
{
If (currentThread == 2) {
If (currentThread == 1)
{
thread1Access = false; thread2Access = false;
While (currentThread == 2);
While (currentThread == 1);
thread1Access = true; thread2Access = true;
} }
/* start of critical section */ /* start of critical section */
currentThread = 2 currentThread = 1
… ...
/* end of critical section */ /* end of critical section */
thread1Access = false; thread2Access = false;
… ...
} }
} }
} }
It can be seen that in all the instances, both threads are programmed to share same resource at the same time, and hence this is the bounded waiting. For Mutual exclusion, two threads cannot share one resource at one time. They must share simultaneously. Also there should be no deadlock. For Progress each thread should have exclusive access to all the resources. Thus its definitely the not the Progress. And hence its Bounded waiting.
