Paper 2 CS · UNIT 08 · MOCK TEST

Mock 9 – Semantic Analysis, Code Generation & Optimisation (Part 2)

Unit 8: Theory of Computation and Compilers · 16 questions · about 19 minutes. Press End Mock any time to see your score and the correct answers.

All 10 topic-wise mocks in this unit

0 / 16 answered 00:00

Q1. Suppose a cloud contains software stack such as Operating System, Application software, etc. This model is referred as _____ model.

ASaaS BIaaS CMaaS DPaaS

Directions (Q91–95): Consider the following three-address code.
100: t1 = y + 2
101: initial = x / t1
102: limit = 10
103: if i > j goto 105
104: goto 111
105: if num > b goto 107
106: goto 111
107: num = limit − 1
108: b = y + 2
109: i = i − num
110: goto 103
111: j = i − num
112: k = j + b

Q2.

Which of the following is the Optimized version for the given TAC in the passage

A100:t1 =y+2 101 : initial = x/t1 102: limit = 10 103: if i >j goto 105 104 : goto 111 105: if num > b goto }10 106: goto 111 107:b=y+2 108: i=i - limit-1 109: goto 103 110:k=i+b B100:t1=y+2 101 : initial = x/t1 102: limit = 10 103: if i >j goto 105 104: if num < b goto }11 105: num = limit-1 106:b = t1 107: i=i -num 108: goto 103 109:k=i+b C100: t1 = y + 2 101: limit = 10 102: num = 9 103: b = t1 104: if i > j goto 106 105: goto 110 106: if num > b goto 108 107: goto 110 108: i = i - num 109: goto 104 110: j = i - num 111: k = j + b D100:t1=y+2 101 : initial = x/t1 102: limit = 10 103: if i >j goto 105 104 : goto 111 105: if num < b goto 111 106: num = limit-1 107:b=t1 108: i=i -num 109 : goto 103 110:k= i+b

Q3.

Match the LIST-I with LIST-II

AA-III, B-II, C-IV, D-I BA-II, B-IV, C-I, D-III CA-II, B-III, C-I, D-IV DA-IV,B-I, C-II, D-III

Q4.

Which of the following tasks could be attained using syntax trees in compiler design ?

(A) Type Checking

(B) Code Generation

(D) Error Handling

A(A), (B), (C) Only B(B), (C), (D) Only C(A), (C), (D) Only D(A), (B), (D) Only

Q5.

Arrange the following stages of parsing in the correct order as they typically occur in the compilation process.

(A) Lexical Analysis

(B) Sematic Analysis

(D) Intermediate Code Generation

(E) Code Optimization

A(A), (B), (C), (D), (E) B(A), (C), (B), (D), (E) C(A), (D), (B), (C), (E) D(A), (C), (D), (B), (E)

Q6.

Which of the following symbol table implementations is best suited if access time is to be minimum?

ALinear list BSearch tree CHash Table DSelf organisation list →

Q7.

Three address codes can be represented in special structures known as :

(A) Quadruples

(B) Triples

(D) Indirect Triples

A(A) and (B) Only B(A), (B) and (D) Only C(B) and (C) Only D(B), (C) and (D) Only

Q8.

Arrange the following phases of a compiler as per their order of execution (start to end)

(a) Target code generation

(b) Syntax Analysis

(d) Semantic Analysis

(e) Lexical Analysis

A(b), (e), (d), (a), (c) B(e), (d), (b), (a), (c) C(e), (b), (d), (c), (a) D(b),(d),(e),(a),(c)

Q9.

Which phase of compiler checks the grammar of programming?

ACode optimization BSemantic analysis CCode generators DSyntax analysis

Q10.

The compiler for high level language that runs on one machine and produces code for other machine is called-

ACross compiler BMultipass compiler COptimizing Compiler DMore than one of the above (E) None of the above Directions (91-95) Read the following passage and answer the given questions. Consider the following program fragment that deals with a table T with 17 rows and 1024 columns, computing an average for each column and printing it to screen ( i is row index and j is column index): for j= [ 0...1023] { temp =0; for i= [0...16] temp = temp + T[i][j]; print (temp/17.0); } T [i] [i] and temp are 32 bit floating point values and memory is word addressable. The temporary variable temp is kept in a processor register so access to temp does not involve a memory reference. The main memory is page and holds 16 pages of size 1024 words, the page replacement policy is "least recently used ". If T is stored in the virtual address space in row major format.

Q11.

In the context of Binding which one of the following is incorrect?

AStatic binding is done at Compile Time BAbsolute addresses are known at Load Time CInternal functions are known at link time DTarget of a function is known at runtime

Q12.

Match List I with List II. List I: (A) Activation record, (B) Location counter, (C) Reference count, (D) Address relocation. List II: (I) Linker/loader, (II) Garbage collection, (III) Subroutine call, (IV) Assembler.

A(A)-(III), (B)-(IV), (C)-(II), (D)-(I) B(A)-(IV), (B)-(III), (C)-(I), (D)-(II) C(A)-(IV), (B)-(III), (C)-(II), (D)-(I) D(A)-(II), (B)-(III), (C)-(I), (D)-(IV)

Q13.

Which of the following is not an intermediate code form?

ASyntax trees BThree address codes CQuadruples DPost fix Notation.

Q14.

Which of the following are applications of symbol table?

(A) Storage allocation

(B) Checking type compatability

A(A) and (B) only B(A) and (C) only C(B) and (C) only D(A), (B) and (C)

Q15.

Which data structure is used by the compiler for managing variables and their attributes?

ABinary tree BLink list CSymbol table DParse table

Q16.

Replacing the expression by 8.56 is known as

Aconstant folding Binduction variable Cstrength reduction Dcode reduction

Next: Mock 10 – Mixed Practice →