Three threads each protect their critical sections using a busy-waiting semaphore as below, with semaphore globally initialized to 0. wait(semaphore); signal(semaphore);
a) Explain whether mutual exclusion is ensured.
b) Explain whether bounded waiting is ensured.

In deadlock avoidance using banker’s algorithm, what would be the consequence(s) of: (i) a process declaring its maximum need as maximum possible for each resource. in other words, if a resource a has 5 instances, then each process declares its maximum need as 5. (ii) a process declaring its minimum needs as maximum needs. for example, a process may need 2-5 instances of resource a. but it declares its maximum need as 2.

Which task uses a simple parameter?

In the insert table dialog box, you select the checkbox to create the first row as the header of the table.