Recent questions tagged code-optimization

0 votes
1 answer
63
The minimum number of arithmetic operations required to evaluate the polynomial P(X) = X5 + 4X3 + 6X + 5 for a given value of X using only one temporary variable.(A) 6(B)...
0 votes
1 answer
64
0 votes
1 answer
68
2 votes
4 answers
69
In questions like, when asked to find the edges or nodes in the DAG of following expression,a=a+b*c-(a+b)+(b*c)do we also consider "=" as a node and its related edges?
4 votes
1 answer
70
How to find unnecessary production while optimising DAG. for ex-a = b * c d = b e = d * c b = e f = b + c g = f + dHow many production need to be removed and how to find ...
2 votes
1 answer
73
10 votes
2 answers
76
Peephole optimization is form ofLoop optimizationLocal optimizationConstant foldingData flow analysis
3 votes
3 answers
80
In compiler terminology reduction in strength meansReplacing run time computation by compile time computationRemoving loop invariant computationRemoving common subexpress...
6 votes
1 answer
81
Substitution of values for names (whose values are constants) is done inLocal optimizationLoop optimizationConstant foldingStrength reduction
3 votes
2 answers
83
1 votes
4 answers
85
Q). Consider the following directed acyclic graph (DAG): The expression represented by above DAG is:(A) $a+a+(a+a+a)$(B) $a+a+(a+a+a+(a+a+a+a))$...
0 votes
3 answers
86
In this one I am unable to follow in the above node marked as "-" ,it has two edges one upward and one downward for "+" node so then how to proceed with this ?
10 votes
4 answers
87
Which of the following class of statement usually produces no executable code when compiled?declarationassignment statementsinput and output statementsstructural statemen...
0 votes
0 answers
88