Change your question. There should have asked for number of swaps not moves then answer 1 is correct otherwise 2 is correct
I think, there is typos mistake in above question.It should be n^2 in place of n^3
Stored value in exponent field is always in binary. So, (11001100)2-127=+77
Here what is partial block subtraction and addition? Need explanation of these terms.
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.
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)