Scribd
Upload
22 views2 pages

CD Quiz-2

This document is a quiz for the Compiler Design course at Synergy Institute of Engineering and Technology, consisting of 10 multiple-choice questions. Each question is worth 2 marks, with a total of 20 marks available. The quiz assesses knowledge on various compiler concepts, including code optimization, data structures, and memory allocation schemes.

Uploaded by

pritisahu5254
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views2 pages

CD Quiz-2

This document is a quiz for the Compiler Design course at Synergy Institute of Engineering and Technology, consisting of 10 multiple-choice questions. Each question is worth 2 marks, with a total of 20 marks available. The quiz assesses knowledge on various compiler concepts, including code optimization, data structures, and memory allocation schemes.

Uploaded by

pritisahu5254
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

SYNERGY INSTITUTE OF ENGINEERING AND TECHNOLOGY, DHENKANAL

Near NH-55, Banamali Prasad – 759001


Quiz-II

Full Marks-20 Duration-30 Min

Name- Registration No-

Roll No-
Subject with Code: Compiler Design (RCS6C002) Course & Branch: B. Tech. & CSE
Year & Semester: 3rd & VI

Answer All Questions


Tick the Correct Answer/Answers

Course Outcome Total Marks Marks Secured Signature of Evaluator


CO3 10
CO4 10

1. Which of the following is machine independent code optimization?


[2 marks] [CO3] [L2]
a) Constant Folding
b) Loop Jamming
c) Copy Propagation
d) Peephole Optimization
2. The method which merges the bodies of two loops is? [2 marks] [CO3] [L2]
a) Loop rolling
b) Loop jamming
c) Constant folding
d) None of the mentioned

3. Three address code can be implemented through which of the following


[2 marks] [CO3] [L2]
a) Quadruple
b) Triple
c) Indirect Triple
d) All of above

4. The graph that shows basic blocks and their successor relationship is called
____________ [2 marks] [CO3] [L2]
a) Dag
b) Flow Graph
c) Control Graph
d) Hamilton Graph
5. Which of the following comment is true about Peephole Optimization?
[2 marks] [CO3] [L2]
a) It is applied to small part of code and applied repeatedly
b) It can be used to optimize intermediate code
c) It can be applied to a portion of code that is not contiguous
d) It is applied in Symbol Table to optimize the memory

6. What data structure in a complier is used for managing information about variables and
their attributes? [2 marks] [CO4] [L2]
a) Abstract syntax tree
b) Symbol table
c) Semantic stack
d) Parse table
7. Identify the data structure which has minimum access time in case of symbol table
implementation? [2 marks] [CO4] [L2]

a) Self Organizing List


b) Hash Table
c) Search Tree
d) Linear

8. Inherited attributes are computed from attribute of which of the following


[2 marks] [CO4] [L2]
a) Parent node
b) Child node
c) Sibling node
d) Both Parent and Sibling node

9. Which of the following contains all the necessary information to call a procedure?
[2 marks] [CO4] [L2]
a) Symbol Table
b) Activation Record
c) Flow Graph
d) Basic Block

10. In which allocation scheme the size and location of memory blocks remains fixed
throughout execution? [2 marks] [CO4] [L2]

a) Static Allocation
b) Stack Allocation
c) Heap Allocation
d) Dynamic Allocation

You might also like