Q.1
Non modifiable procedures are called:
  • Serially usable procedure
  • Concurrent procedure
  • Top down procedure
  • Re-entrant procedure
Q.2
Which statement is wrong ?
  • If linked origin ≠ translated origin, relocation must be performed by the linker
  • If load ≠ linked origin, the loader must perform relocation
  • A linker always perform relocation, whereas some loaders do not
  • None of these
Q.3
Which activity is included in the first pass of two pass assemblers?
  • Build the symbol table
  • Construct the intermediate code
  • Separate mnemonic opcode and operand fields
  • All of the above
Q.4
Portable program means
  • Program with wheels
  • Independent from its authors
  • Independent of platform
  • None of these
Q.5
In an absolute loading scheme which loader function is accomplished by assembler?
  • re-allocation
  • allocation
  • linking
  • None of these
Q.6
Which of the following are Assembler Directives?(i) EQU(ii) ORIGIN(iii) START(iv) END
  • (ii), (iii) and (iv)
  • (i), (iii) and (iv)
  • (iii) and (iv)
  • (i), (ii), (iii) and (iv)
Q.7
Dead-code elimination in machine code optimization refers to:
  • removal of all labels.
  • removal of values that never get used.
  • removal of function which are not involved.
  • None of these
Q.8
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
  • All of above
Q.9
Code optimization is responsibility of:
  • Application programmer
  • System programmer
  • Operating system
  • Both A & B
Q.10
A permanent database of a general model of compiler is...................
  • Identifier table
  • Page map table
  • Literal table
  • Terminal table
Q.11
In a two pass compiler, during the first pass:
  • user defined address symbols are correlated with their binary equivalent
  • the syntax of the statement is checked and mistakes, if any, are listed
  • object program is generated
  • None of these
Q.12
In .............., the bodies of the two loops are merged together to form a single loop provided that they do not make any references to each other.
  • Loop unrolling
  • Strength reduction
  • Loop concatenation
  • Loop jamming
Q.13
Grammar of the programming is checked at …………… phase of compiler.
  • semantic analysis
  • code generation
  • syntax analysis
  • All of above
Q.14
Block or Buffer caches are used to
  • improve disk performance
  • handle interrupts
  • increase the capacity of main memory
  • speed up main memory Read operations
Q.15
Which of the statements related to Compilers is wrong ?
  • Lexical analysis is breaking the input into tokens
  • Syntax analysis is for parsing the phrase
  • Syntax analysis is for analyzing the semantic
  • All of above
Q.16
How many states can a process be in?
  • 2
  • 3
  • 4
  • 5
Q.17
Peep-hole optimization is a form of:
  • loop optimization
  • local optimization
  • constant folding
  • Both A & B
Q.18
The parsing technique that avoids back tracking is:
  • Top-down parsing
  • Recursive-descent parsing
  • Predictive
  • None of these
Q.19
In two pass assembler the symbol table is used to store:
  • Label and value
  • Only value
  • Mnemonic
  • Memory Location
Q.20
Which of the following permanent database that has an entry for each terminal symbol ?
  • Literal table
  • Identifier table
  • Terminal table
  • All of above
0 h : 0 m : 1 s