Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged code-optimization
10
votes
1
answer
61
Static Single Assignment
Consider the following code segment $a=b-c$ $d=a+d$ $a=d+e$ $d=c*f$ $d=a*d$ The minimum number of total variables required to convert the above code segment to static single assignment form is _________. Answer given is 10. Should it be 9????
Consider the following code segment$a=b-c$$d=a+d$$a=d+e$$d=c*f$$d=a*d$The minimum number of total variables required to convert the above code segment to static single as...
atul_21
7.3k
views
atul_21
asked
Jul 9, 2017
Compiler Design
compiler-design
code-optimization
static-single-assignment
numerical-answers
+
–
1
votes
1
answer
62
Single Static Assignment
The sum of least number of temporary variables and total variables required to create a three address code in single static assignment form for the expression a*b + c/d + e-f is .?? ( Can anyone explain how the answer is 16??? )
The sum of least number of temporary variables and total variables required to create a three address code in single static assignment form for the expressiona*b + c/d + ...
atul_21
498
views
atul_21
asked
Jul 8, 2017
Compiler Design
compiler-design
code-optimization
static-single-assignment
numerical-answers
+
–
0
votes
1
answer
63
polynomial
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) 7 (C) 8 (D) 9
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)...
Nandini 1
649
views
Nandini 1
asked
Jun 20, 2017
Compiler Design
compiler-design
code-optimization
+
–
0
votes
1
answer
64
control flow path
what is meant by control flow path?
what is meant by control flow path?
nabadeep
680
views
nabadeep
asked
Apr 27, 2017
Compiler Design
compiler-design
code-optimization
descriptive
+
–
1
votes
1
answer
65
A directed acyclic graph represents one form of intermediate repsentation .
A directed acyclic graph represents one form of intermediate representation.The number of non-terminal nodes in DAG of a=(b+c)*(b+c) a)2 b)3 c)4 d)5
A directed acyclic graph represents one form of intermediate representation.The number of non-terminal nodes in DAG of a=(b+c)*(b+c)a)2b)3c)4d)5
neha singh
2.0k
views
neha singh
asked
Mar 17, 2017
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
+
–
0
votes
1
answer
66
Code optimization
Consider the following source code : c = a + b d = c c = c – e a = d – e b = b * e b = d/b (A) No optimization is possible (B) d = c c = c – e a = d – e b = b * e b = d/b (C) c = a + b d = c c = c – e a = d – e b = d/b (D) c = a + b t = b * e a = d – e b = d/t c = a
Consider the following source code :c = a + bd = cc = c – ea = d – eb = b * eb = d/b(A) No optimization is possible(B) d = c c = c – e a = d – e b = b...
Beyonder
8.3k
views
Beyonder
asked
Mar 8, 2017
Compiler Design
code-optimization
compiler-design
+
–
0
votes
1
answer
67
What to study in code optimization?..Please list the topics
Please can anyone list the topics to study in this part. The syllabus only states basics of code generation and optimization. Anyone who had prepared gate earlier. What did you study?
Please can anyone list the topics to study in this part. The syllabus only states basics of code generation and optimization. Anyone who had prepared gate earlier. What d...
Tridhara Chakrabarti
1.3k
views
Tridhara Chakrabarti
asked
Jan 23, 2017
Compiler Design
compiler-design
code-optimization
target-code-generation
intermediate-code
+
–
0
votes
1
answer
68
DAG ace test question
How does answer change when it is in SSA form? does answer remains 4 or 5
How does answer change when it is in SSA form? does answer remains 4 or 5
thor
638
views
thor
asked
Jan 22, 2017
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
numerical-answers
ace-test-series
+
–
2
votes
4
answers
69
Directed acyclic graph
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?
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?
Shradha
2.5k
views
Shradha
asked
Jan 9, 2017
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
+
–
4
votes
1
answer
70
DAG compilers
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 + d How many production need to be removed and how to find them . ?
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 ...
Tendua
2.8k
views
Tendua
asked
Dec 21, 2016
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
+
–
1
votes
1
answer
71
Cross Compiler and Bootstrapping are _______
What is the difference between Cross Compiler and Bootstrapping ?
What is the difference between Cross Compiler and Bootstrapping ?
LavTheRawkstar
13.6k
views
LavTheRawkstar
asked
Nov 10, 2016
Compiler Design
compiler-design
code-optimization
target-code-generation
+
–
0
votes
2
answers
72
Global Data Flow Analysis is _______
Please explain what is Global Data Flow Analyis in Code optimization ?
Please explain what is Global Data Flow Analyis in Code optimization ?
LavTheRawkstar
3.8k
views
LavTheRawkstar
asked
Nov 8, 2016
Compiler Design
compiler-design
target-code-generation
code-optimization
+
–
2
votes
1
answer
73
Compiler -Register Allocation
Any one please explain the concept of without spilling
Any one please explain the concept of without spilling
KISHALAY DAS
1.4k
views
KISHALAY DAS
asked
Nov 6, 2016
Compiler Design
compiler-design
code-optimization
test-series
+
–
2
votes
1
answer
74
ME-Single Static Assignment
Do I have to define variables(a,b,c,d,e) in temp variable before use? Ans is 6 or 11??
Do I have to define variables(a,b,c,d,e) in temp variable before use?Ans is 6 or 11??
KISHALAY DAS
592
views
KISHALAY DAS
asked
Oct 21, 2016
Compiler Design
compiler-design
code-optimization
three-address-code
static-single-assignment
numerical-answers
made-easy-test-series
+
–
1
votes
0
answers
75
dag
Here is a sequence of twelve array assignments and references: r = a[i] s = a[j] t = a[i] a[j] = b u = a[i] v = a[j] a[j] = c w = a[i] x = a[j] y = a[i] z = a[j] a[j] = b Construct the DAG for these instructions. Which of the following pairs of variables label the same node of the DAG? a) t and u b) r and s c) w and y d) t and s
Here is a sequence of twelve array assignments and references:r = a[i]s = a[j]t = a[i]a[j] = bu = a[i]v = a[j]a[j] = cw = a[i]x = a[j]y = a[i]z = a[j]a[j] = bConstruct th...
__
554
views
__
asked
Sep 2, 2016
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
test-series
+
–
10
votes
2
answers
76
ISRO2016-44
Peephole optimization is form of Loop optimization Local optimization Constant folding Data flow analysis
Peephole optimization is form ofLoop optimizationLocal optimizationConstant foldingData flow analysis
ManojK
11.7k
views
ManojK
asked
Jul 4, 2016
Compiler Design
compiler-design
code-optimization
isro2016
+
–
2
votes
1
answer
77
Compiler Construction
Consider the following code which computes the inner product of 2 vectors: prod := 0; i := 1; repeat { prod := prod + a[i] * b[i] i = i+1; until i >20 } Below is possible IR for this program : 1) prod := 0 2) i :=1 3) t1 :=4*i 4) ... i+1 11) i :=t7 12) if i<=20 goto (3) 13) .. Create Basic Blocks and the control Flow Graph and also show any Optimizatioions.If you Find.
Consider the following code which computes the inner product of 2 vectors:prod := 0;i := 1;repeat{prod := prod + a[i] * b[i]i = i+1;until i >20}Below is possible IR for t...
LavTheRawkstar
4.3k
views
LavTheRawkstar
asked
Jun 27, 2016
Compiler Design
compiler-design
code-optimization
+
–
0
votes
1
answer
78
in compiler technology reduction in strength means
parvati h
2.8k
views
parvati h
asked
Jun 25, 2016
Compiler Design
compiler-design
code-optimization
+
–
6
votes
5
answers
79
ISRO2011-13
Which of the following statements about peephole optimization is False? It is applied to a small part of the code It can be used to optimize intermediate code To get the best out of this, it has to be applied repeatedly It can be applied to the portion of the code that is not contiguous
Which of the following statements about peephole optimization is False?It is applied to a small part of the codeIt can be used to optimize intermediate codeTo get the bes...
go_editor
8.7k
views
go_editor
asked
Jun 21, 2016
Compiler Design
isro2011
compiler-design
code-optimization
+
–
3
votes
3
answers
80
ISRO2011-3
In compiler terminology reduction in strength means Replacing run time computation by compile time computation Removing loop invariant computation Removing common subexpressions replacing a costly operation by a relatively cheaper one
In compiler terminology reduction in strength meansReplacing run time computation by compile time computationRemoving loop invariant computationRemoving common subexpress...
Anuanu
10.0k
views
Anuanu
asked
Jun 15, 2016
Compiler Design
isro2011
compiler-design
code-optimization
+
–
6
votes
1
answer
81
ISRO2009-43
Substitution of values for names (whose values are constants) is done in Local optimization Loop optimization Constant folding Strength reduction
Substitution of values for names (whose values are constants) is done inLocal optimizationLoop optimizationConstant foldingStrength reduction
Desert_Warrior
6.5k
views
Desert_Warrior
asked
Jun 3, 2016
Compiler Design
isro2009
compiler-design
code-optimization
+
–
1
votes
1
answer
82
UGC NET CSE | December 2012 | Part 2 | Question: 11
In compiler design ‘reducing the strength’ refers to reducing the range of values of input variables code optimization using cheaper machine instructions reducing efficiency of program none of the above
In compiler design ‘reducing the strength’ refers toreducing the range of values of input variablescode optimization using cheaper machine instructionsreducin...
Sanjay Sharma
4.1k
views
Sanjay Sharma
asked
Jun 1, 2016
Compiler Design
code-optimization
ugcnetcse-dec2012-paper2
compiler-design
+
–
3
votes
2
answers
83
Isro Interview Question 17 March 2016
What is peephole (In peephole Optimization technique) ?
What is peephole (In peephole Optimization technique) ?
ManojK
1.5k
views
ManojK
asked
May 6, 2016
Compiler Design
isro-interview-question
code-optimization
+
–
16
votes
3
answers
84
GATE CSE 2013 | Question: 49
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. ... without any spill to memory? Do not apply any optimization other than optimizing register allocation. 3 4 5 6
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and on...
go_editor
6.8k
views
go_editor
asked
Apr 21, 2016
Compiler Design
out-of-syllabus-now
gatecse-2013
normal
compiler-design
target-code-generation
code-optimization
+
–
1
votes
4
answers
85
DAG
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))$ (C) $a+a+(a+a+a+(a+a+a))$ (D) None
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))$...
Mojo-Jojo
3.3k
views
Mojo-Jojo
asked
Jan 29, 2016
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
+
–
0
votes
3
answers
86
How to evaluate given DAG ?
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 ?
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 ?
radha gogia
1.3k
views
radha gogia
asked
Dec 9, 2015
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
numerical-answers
test-series
+
–
10
votes
4
answers
87
ISRO2008-68
Which of the following class of statement usually produces no executable code when compiled? declaration assignment statements input and output statements structural statements
Which of the following class of statement usually produces no executable code when compiled?declarationassignment statementsinput and output statementsstructural statemen...
ajit
8.1k
views
ajit
asked
Sep 20, 2015
Compiler Design
isro2008
compiler-design
code-optimization
+
–
0
votes
0
answers
88
find out the initial feasible solution by vogels approximation method?
WAREHOUSE------> FACTORY W1 W2 W3 SUPPLY F1 16 20 12 200 F2 14 8 16 160 F3 26 24 26 90 DEMAND 180 120 150 is the optimal solution for the above question or not ???
WAREHOUSE FACTORY W1W2W3SUPPLYF1162012200F214816160F326242690DEMAND180120150 is the optimal solution for the above question or not ???
Shubham Sahu
300
views
Shubham Sahu
asked
Jul 12, 2015
Others
code-optimization
+
–
1
votes
1
answer
89
The identification of common sub-expression and replacement of run-time computations by compile-time computations is ?
Vikrant Singh
4.3k
views
Vikrant Singh
asked
Feb 1, 2015
Compiler Design
compiler-design
code-optimization
test-series
+
–
67
votes
4
answers
90
GATE CSE 2014 Set 3 | Question: 34
Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are $6$ and $6$ $8$ and $10$ $9$ and $12$ $4$ and $4$
Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the abo...
go_editor
34.7k
views
go_editor
asked
Sep 28, 2014
Compiler Design
gatecse-2014-set3
compiler-design
code-optimization
directed-acyclic-graph
normal
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register