Compiler Design MCQ with Answers

Compiler Design MCQ with Answers

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)

Answer is:

O(n)

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

Answer is:

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

93) Software that measures, monitors, analyses and controls real world events is called

Answer is:

Real time software

94) A linker is given object module for a set of programs that were compiled separately. What information need not be included in an object module

Answer is:

Absolute addresses of internal symbols.

95) The table created by lexical analysis to describe all literals used in the source program is

Answer is:

Literal table