While loop will run untill q is not empty. I think it is 16

12 Feb 2016 - 8:25pm

100MB -> 1 sec

100*(2^20) bits -> 1 sec

(2^32)*8 bits-> (2^32)*8/100*(2^20)=327.68 sec=328 sec

4 Feb 2016 - 7:16pm

Can you plz. explain..how to approch?

3 Feb 2016 - 9:16pm

Ans:C

a refines b means a is a subset of b. π2 is not a subset of π3 so there is no edge.

3 Feb 2016 - 12:23pm

Y is the In-order Successor of node X . So, in In-order traversal y will be after x. Now, x has only left child.If X is the parent of y then  y should be in left side. Then  in In-order traversal (left-Root-right) x will be after y. But, for In-order Successor of node X, y will be after x. So, y can be parent of x and x can be left child. So, option (B) is correct.

31 Jan 2016 - 2:28pm

Yes, I am also getting Option D. Correct me If I am wrong

31 Jan 2016 - 1:13pm

ASCII value of Abm we take ASCII Value of A(65). Now modulo operation (65+1) mod 8=2,

for goto take ASCII of g(103),Now modulo operation (103+1) mod 8=0,

31 Jan 2016 - 12:56am

0-- 145, goto

1- Empty

2-Abm, axy

3-Empty

4-123

5-Empty

6-Dyz

7-46,134

So, 1,3,5 locations empty.

30 Jan 2016 - 10:06pm

This is NPDA. There is two options for 2nd 'a'  (a,a/ε) or (a,a/aa) . It may go to the next state or it may push 2nd a also remaining the same state. 

28 Jan 2016 - 12:27pm

Pages