"C" is the correct answer, if its correct please mark me brainliest.
Answer:
The formula for the given problem is given below:
= (1+B$12)×B13
Explanation:
Immediately you do one, then you can autofill the formula to the mentioned range B15:B17 and then to C14 to H17
When been done correctly, this is how the formula will look in those cells if you do it correctly.
Check the file attached below to see it.
Answer: On- demand
Explanation:
On demand CRM system are basically hosted by the external vendor in the vendor data center. CRM is basically stand for customer relationship management.
CRM is a strategy that are used for managing the organisation relationship with the customers.
On demand CRM define as software availability for the customers. It basically connected with the idea of software on demand. The software are modify according to the current requirement and demand.
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.
Good luck and I hope u can find the right answer
