Change your question. There should have asked for number of swaps not moves then answer 1 is correct otherwise 2 is correct

27 Jan 2016 - 8:16pm

And I was freaking about 5 min. that how option D is correct :P

11 Jan 2016 - 12:39pm

I think, there is typos mistake in above question.It should be n^2 in place of n^3 

11 Jan 2016 - 12:10pm

 Stored value in exponent field is always in binary. So, (11001100)2-127=+77

10 Dec 2015 - 9:04pm

Here what is partial block subtraction and addition? Need explanation of these terms.

10 Dec 2015 - 8:07pm

Here hit rate of primary memory is considered as 100%?

10 Dec 2015 - 8:05pm

We need to assume 1 ns overhead?

10 Dec 2015 - 11:01am

Since you are asking for checking that this language is regular or not. There are the comparisons , so it is not definitely regular. 

Now check that is it CFL or not?
you can think one way to make it cfl by pushing a for i times followed by b for j times and you can pop b followed by a for both c or d occur because no of elements pushed into the stack is equal to no of elements popped. But here we can't guarantee that no of a's are equal popped to no of c's and no of b's popped to equal no of d's. That's why It is not cfl also.

18 Nov 2015 - 3:33pm

Average Access time=2%page_fault(TLB+MM+Page_replacement_time)+98% not_page_fault(85% required_page_entry_exity_in_TLB(TLB+MM)+15% required_page_entry_not_exit_in_TLB(TLB+MM+MM)

= 0.02(10ns+100ns+2000000ns)+0.98(0.85(10ns+100ns)+0.15(10ns+100ns+100ns))=40124.7ns

16 Nov 2015 - 9:44pm

This is ex-or implementation using NAND gate. Now x,y inputs are already given, just give z,w to first NAND gate and solve that and you'll get required pos equation  

15 Nov 2015 - 9:10am