T(n) = 4T(n/2) +n2                  Now apply Masters Thm

= n2logn

28 Aug 2016 - 8:44pm

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 n

total work done = n2 log2n

 

28 Aug 2016 - 8:37pm
Ok
19 Feb 2016 - 3:58pm

Functional Dependency is very easy concept, no need of any specific algorithm, you can directly learn it by looking dependency table.

in following link read Dhrupit Dave's Exaplanation.

http://www.techtud.com/doubt/plz-explain-it

19 Feb 2016 - 10:29am

18 Feb 2016 - 12:53pm

ANS - A

18 Feb 2016 - 12:47pm

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

16 Feb 2016 - 6:46pm

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%

16 Feb 2016 - 6:35pm

Compulsory miss = >Initially Cache memory is empty, therefore initial cache memory accesses are misses. These are called as compulsary Misses.

16 Feb 2016 - 6:25pm

15 Feb 2016 - 6:02pm

Pages