Consider the expression a 1 b c 3 d Let X be the minimum number of registers required by an optimal code generation without any register spill algorithm for a loadstore architecture in which gate computer science 2017

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
GATE-Computer-Science-Engineering-2017-->View question

Consider the expression (a-1) * ((( b + c ) / 3 )) + d)). Let X be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which : -gate computer science 2017

(i) only load and store instructions can have memory operands and (ii) arithmetic instructions can have only register or immediate operands The value of X is ________.

A) 2
B) 1
C) 4
D) 3


Taged users:


Be first to dislike this question

Talk about thisDelete|Like|Dislike|


A) 2 

The assembly code using the load/store architecture can be written as follows:

Load R1, b

Load R2, c

ADD R1, R2

Div R1, 3

Load R2, d

Add R1, R2

Load R2, a

Sub R2, 1

Mul R2, R1

Hence minimum 2 registers required. 

This explanation is contributed by Deepak Raj


Be first to like this answer

Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

Can you help us to add better answer here? Please see this

Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!