KONERU LAKSHMAIAH EDUCATION FOUNDATION

(Deemed to be University estd, u/s, 3 of the UGC Act, 1956)

(NAAC Accredited “A++” Grade University)

Green Fields, Guntur District, A.P., India – 522502

Department of Computer Science and Engineering

(DST - FIST Sponsored Department)

B.Tech. III CSE(A) PROGRAM

A.Y.2023-24
EVEN Semester- 21CS3204 A
Home Assignment-4

1. Construct DAG for the following code.

a=b+c
b=a-d
c=b+c
d=a-d
2. Discuss about the principal sources of optimization with examples.
3. Explain in detail about optimization of basic blocks.
4. Explain the storage allocation strategies used for recursive procedure calls.
5. Specify the necessary and sufficient conditions for performing
a. Constant propagation
b. Dead code elimination
c. Loop optimization

d. Code motion
6. Explain the following with respect to code generation phase
a. Input to code generator
b. Target program
c. Memory management
d. Instruction selection
e. Register allocation
f. Evaluation order.