Computer Sciences > Gate 2017 Set-1 > Registers
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
(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 ________.
(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 ________.
Explanation
Correct : 2
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.