Theory of Computation and Compilers - Semantic Analysis

16. The segment base is specified using the register named is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


17. 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?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


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

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


19. 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?

  • Option : C
  • Explanation :
    For skewed binary search tree on n nodes, the tightest upper bound to insert a node is O(n)
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


20. Which of the following is true for machine language?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *