I like to share knowledge, Teaching is my Passion.

### Alma Mater:

B.E. in Compter Science and Engineering
SVIT Nashik
2008 to 2012

### Experience:

Not updated.
1 year 10 months ago

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

= n2logn

moreless
1 year 10 months ago

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

moreless
Doubt
1 year 10 months ago

sum = 0;

for(i=0;i<n;i++)

for(j=0;j<i*i;j++)

for(k=0;k<j;k++)

sum ++;

Video lecture
2 years 4 months ago

Type Checking Part 1

morelessWatch Now
Video lecture
2 years 4 months ago

Stack Based Symbol Table Creation and Scope Resolution

morelessWatch Now
Ravindra Babu Ravula
sonal
Arushi Kesarwani
Saijyothsna
Niloy Ganguly
YASH
Ram Babu Roy
Sourangshu Bhattacharya
Himanshu Kaushik
RAJIB MALL
Amrith Krishna
Jayanta Chakraborty
Shweta Nagpal
Virtual GATE
Parth Sharma

## Pages

Pritam Prasun
905
Rajeev
914
Rajesh Kumar Pandey
1522
Anil kumar khatri
2300
partha
2584
Sumit Verma
10677
biranchi
11817
12050
AARSHI KANSWA
12929
AMIT CHAUDHARY
13616
Harikrishna Nalla
13680
krishna singh
14040
Palanisamy M
14507
saurabh ghosh
14732
Rajat Singh
14884

## Pages

28 Aug 2016 - 8:44pm

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

= n2logn

more less
28 Aug 2016 - 8:37pm

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

more less
Ok
more less
19 Feb 2016 - 10:29am

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

more less
16 Feb 2016 - 6:46pm

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

more less
16 Feb 2016 - 6:35pm

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%

more less
16 Feb 2016 - 6:25pm

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

more less
15 Feb 2016 - 6:02pm

more less
2 Feb 2016 - 11:57pm

yes Mahesh ,my formula was wrong , corrected...

more less
2 Feb 2016 - 11:57pm

-6 * 4 * -1 = 24  is determinant .

and there is formula,