Important part of any compiler is the construction and maintenances of a dictionary, this types of dictionary are called______________.

Related MCQs

• Any node is the path from the root to the node is called
• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• A connected graph T without any cycles is called _____________.
• Divide and conquer is an important algorithm design paradigm based on _______.
• Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
• How many types of insertion are performed in a binary tree?
• Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
• Which of the following is not the part of ADT description?