Test: Code Generation & Optimization- 2

Question 1

In some phase of compiler

Input
temp1 := Inttoreal (60)
temp2 := id3 * temp1
temp3 := id2 + temp2
id1 := temp3
Output
temp 1 := id3 * 60.0
id1 := id2 + temp1

where temp 1 , temp 2 , temp 3 are temporary storage, id1, id2, Id3 are identifier into real is converting int 60 to real number. The above phase is

Accepted Answer

Code optimizer

Answer

Code generator

Answer

intermediate code generator

Answer

None of the above

Question 2

The DAG shown here represents

Accepted Answer

(a + b*c)*(b*c- d)

Answer

a + (b*c) - d

Answer

a + b *c *b *c -d

Answer

(a + b)*(c- d)

Question 3

Any Directed Acyclic Graph must have

Accepted Answer

Atleast one vertex with indegree 0 and atleast one vertex with outdegree 0,

Answer

Atleast one vertex with indegree 1 and atleast one vertex with outdegree 0.

Answer

Atleast one vertex with indegree 0 or atleast one vertex with outdegree 0,

Answer

Atleast one vertex with indegree 0 and atleast one vertex with outdegree 1

Question 4

The DAG shown here represents:

Accepted Answer

(a + b) * ( c + d) + (a - b) * (c + d)

Answer

(a - b) * (a + b) + (c + d) * (c + d)

Answer

(a - b) * (c + d) + (a - b) * (c - d)

Answer

(a * b) + (c * d) * (a * b) + ( c * d)

Question 5

Consider the DAG with V = {1, 2, 3, 4, 5, 6}, shown below

Which of the following is NOT a topological ordering

Accepted Answer

3 2 4 1 6 5

Answer

1 2 3 4 5 6

Answer

1 3 2 4 5 6

Answer

1 3 2 4 6 5

Question 6

A directed acyclic graph represents one form of intermediate representation. The number of non terminals nodes in DAG of a = (b + c)*(b + c) expression is

Accepted Answer

3

Answer

2

Answer

4

Answer

5

Question 7

A pictorial representation of the value computed by each statement in the basic block is

Accepted Answer

Graph

Answer

Tree

Answer

DAG

Answer

None of these

Question 8

DAG representation of a basic block allows

Accepted Answer

Automatic detection of local common sub-expressions.

Answer

Automatic detection of induction variables.

Answer

Automatic detection of loop invariant.

Answer

None of the above

Question 9

The intermediate code generated for the following syntax tree is:

Accepted Answer

iacb + cd uminus * - +

Answer

iac + cdb + - +

Answer

iacb + cd * - +

Answer

None of the above

Question 10

The triple representation for following representation is:

Accepted Answer

Answer

Answer

Answer

None of the above

Question 11

Generation of intermediate code based on an abstract machine model is useful in compilers because

Accepted Answer

It enhances the portability of the front end of the compiler.

Answer

It makes implementation of lexical analysis and syntax analysis easier.

Answer

Syntax-directed translations can be written for intermediate code generation.

Answer

It is not possible to generate code for real machines directly from high level language programs

Question 12

Three address code’ technique for intermediate code generation shows that each statement usually contains three addresses. Three addresses are as follows:

Accepted Answer

One for result, two for operands

Answer

Two addresses for operands, one for operator

Answer

One for all operator, one for all operands and one for result

Answer

None of the above

Question 13

Consider the following arithmetic infix expression Q.

A + (B * C - (D / E ^ F) * G) * H

Transform 'Q' into its equivalent postfix expression.

Accepted Answer

ABC*DEF^/G*-H*+

Answer

ABC*DE^F/G*-H*+

Answer

ABC*DEF^G*-H*+

Answer

None of the above

Question 14

Which of the following is not a type of three address statements?

Accepted Answer

None of the above

Answer

Copy statements

Answer

Index assignment statements

Answer

Pointer assignments

Question 15

Consider the following statements:
S₁: Three address code is a linearized representation of a syntax tree.
S₂: The syntax tree not depicts the natural hierarchical structure of source program

Which of the above statements is/are true

Accepted Answer

S₁ is true S₂ is false

Answer

S₁ is false S₂ is true

Answer

Both S₁ and S₂ are true

Answer

Both S₁ and S₂ are false

GATE Computer Science Engineering(CSE) 2027 Test: Code Generation & Optimization-

MCQ Practice Test & Solutions: Test: Code Generation & Optimization- 2 (15 Questions)

The DAG shown here represents

Any Directed Acyclic Graph must have

The DAG shown here represents:

Consider the DAG with V = {1, 2, 3, 4, 5, 6}, shown below
Which of the following is NOT a topological ordering

A directed acyclic graph represents one form of intermediate representation. The number of non terminals nodes in DAG of a = (b + c)*(b + c) expression is

A pictorial representation of the value computed by each statement in the basic block is

DAG representation of a basic block allows

The intermediate code generated for the following syntax tree is:

The triple representation for following representation is:

Generation of intermediate code based on an abstract machine model is useful in compilers because

Three address code’ technique for intermediate code generation shows that each statement usually contains three addresses. Three addresses are as follows:

Consider the following arithmetic infix expression Q.
A + (B * C - (D / E ^ F) * G) * H
Transform 'Q' into its equivalent postfix expression.

Which of the following is not a type of three address statements?

Consider the following statements:
S₁: Three address code is a linearized representation of a syntax tree.
S₂: The syntax tree not depicts the natural hierarchical structure of source program
Which of the above statements is/are true

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

Top Courses for Computer Science Engineering (CSE)

Schools

Competitive Exams

International Exams

Quick Links

About this Computer Science Engineering (CSE) Practice Test

Explore more Computer Science Engineering (CSE) Study Resources

GATE Computer Science Engineering(CSE) 2027 Test: Code Generation & Optimization-

MCQ Practice Test & Solutions: Test: Code Generation & Optimization- 2 (15 Questions)

The DAG shown here represents

Any Directed Acyclic Graph must have

The DAG shown here represents:

Consider the DAG with V = {1, 2, 3, 4, 5, 6}, shown belowWhich of the following is NOT a topological ordering

A directed acyclic graph represents one form of intermediate representation. The number of non terminals nodes in DAG of a = (b + c)*(b + c) expression is

A pictorial representation of the value computed by each statement in the basic block is

DAG representation of a basic block allows

The intermediate code generated for the following syntax tree is:

The triple representation for following representation is:

Generation of intermediate code based on an abstract machine model is useful in compilers because

Three address code’ technique for intermediate code generation shows that each statement usually contains three addresses. Three addresses are as follows:

Consider the following arithmetic infix expression Q.A + (B * C - (D / E ^ F) * G) * HTransform 'Q' into its equivalent postfix expression.

Which of the following is not a type of three address statements?

Consider the following statements: S1: Three address code is a linearized representation of a syntax tree. S2: The syntax tree not depicts the natural hierarchical structure of source programWhich of the above statements is/are true

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

GATE Computer Science Engineering(CSE) 2027 Mock Test Series

Top Courses for Computer Science Engineering (CSE)

About this Computer Science Engineering (CSE) Practice Test

Explore more Computer Science Engineering (CSE) Study Resources

Consider the DAG with V = {1, 2, 3, 4, 5, 6}, shown below
Which of the following is NOT a topological ordering

Consider the following arithmetic infix expression Q.
A + (B * C - (D / E ^ F) * G) * H
Transform 'Q' into its equivalent postfix expression.

Consider the following statements:
S₁: Three address code is a linearized representation of a syntax tree.
S₂: The syntax tree not depicts the natural hierarchical structure of source program
Which of the above statements is/are true