88) The segment base is specified using the register named is

ORG instructions

TITLE instruction

ASSUME instruction

SEGMENT instruction

Answer is:

ORG instructions

Compiler Design MCQ with Answers

For more MCQ's Click Here

89) In what module multiple instances of execution will yield the same result even if one instance has not terminated before the next one has begun ?

Non reusable module

Serially usable

Re-enterable module

None of these

Answer is:

Re-enterable module

90) Dividing a project into segments and smaller units in order to simplify analysis, design and programming efforts is called

Modular approach

Top down approach

Bottom up approach

Left right approach

Answer is:

Modular approach

91) Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? (GATE-2013)

O(1)

O(log n)

O(n)

O(n log n)

Answer is:

O(n)

92) Which of the following is true for machine language?

Repeated execution of program segments

Depicting flow of data in a system

A sequence of instructions which, when followed properly, solves a problem

The language which communicates with the computer using only the binary digits 1 and 0.

Answer is:

The language which communicates with the computer using only the binary digits 1 and 0.

Compiler Design MCQ with Answers

For more MCQ's Click Here

88) The segment base is specified using the register named is

ORG instructions

Compiler Design MCQ with Answers

Related Compiler Design MCQ with Answers

89) In what module multiple instances of execution will yield the same result even if one instance has not terminated before the next one has begun ?

Re-enterable module

90) Dividing a project into segments and smaller units in order to simplify analysis, design and programming efforts is called

Modular approach

91) Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? (GATE-2013)

O(n)

92) Which of the following is true for machine language?

The language which communicates with the computer using only the binary digits 1 and 0.

Compiler Design MCQ with Answers