Consider the following Assembly code and identify what line(s) can be removed without affecting the original meaning 

Line 1: MOV   b, R0

Line 2:  ADD   c, R0

Line 3:  MOV   R0, a

Line 4:  MOV   a, R0

Line 4: ADD   e, R0

Line 5: MOV   R0, d

By using the approximate formula for usage count, determine the usage count/unit of cost for variable A in Block2 of the following data flow graph.

In register allocation, which of the following is most critical for minimizing memory access time?

Consider that there are two loops — L1 (outer loop) and L2 (inner loop).

If 'a' is allocated in L2 and not in L1 then which of the following code sequence(s) correctly represents the register assignment for variable ‘a’

— at the entrance to L2 and while leaving L2?

Given the following register interference graph:

Find the minimum number of registers required for register allocation using the Graph Coloring Method.

Find the suitable optimized code for the following code.

a=b+c

b=a-d

c=b+c

d=a-d

Choose the right data flow equation for out[B3] in the following diagram