no. of levels in the tree are logn to the base 4/3 , which is approx = lognto base 2.
work done at each level is n2
total work done = n2 log2n
Critical section = Is shared resource or part of program, not allowed to access by more than one process at same time.
Deadlock = Deadlock is a situation in which process waiting for resource, which hold by another process , which in turn waiting for resource hold by another process. in this way all process waiting for resource form cycle, and no process can complete its execution. this is called dead lock.
Mutual exclusion = Shared resource is not allowed to access by more than one process at same time is called mutual exclusion
Cpu Utilization = 1-Pn
n = no. of processes.
p = % of time process doing i/o
Cpu Utilization = 1-Pn = 1 - (0.20)4 = 0.9984
Time wasted = 1 - utilization = 1 - 0.9984 = 0.0016 = 0.16%
Compulsory miss = >Initially Cache memory is empty, therefore initial cache memory accesses are misses. These are called as compulsary Misses.