adplus-dvertising
frame-decoration

Question

Which of the following applications may use a stack?

a.

A parentheses balancing program

b.

Tracking of local variables at run time

c.

Compiler Syntax Analyzer

d.

All of the mentioned

Answer: (d).All of the mentioned

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following applications may use a stack?

Similar Questions

Discover Related MCQs

Q. Consider the usual algorithm for determining whether a sequence of parentheses is balanced.
The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(())) are:

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

Q. What is the value of the postfix expression 6 3 2 4 + – *:

Q. Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation.
The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?

Q. The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

Q. The data structure required to check whether an expression contains balanced parenthesis is?

Q. The process of accessing data stored in a serial access memory is similar to manipulating data on a ________

Q. The postfix form of A*B+C/D is?

Q. The prefix form of A-B/ (C * D ^ E) is?

Q. What is the result of the following operation
Top (Push (S, X))

Q. The prefix form of an infix expression p + q – r * t is?

Q. The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?

Q. Convert the following infix expressions into its equivalent postfix expressions
(A + B ⋀D)/(E – F)+G

Q. Convert the following Infix expression to Postfix form using a stack
x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.

Q. Which of the following statement(s) about stack data structure is/are NOT correct?

Q. Consider the following operation performed on a stack of size 5.
Push(1);

Pop();

Push(2);

Push(3);

Pop();

Push(4);

Pop();

Pop();

Push(5);

After the completion of all operation, the number of elements present in stack are

Q. The type of expression in which operator succeeds its operands is?

Q. Assume that the operators +,-, X are left associative and ^ is right associative.
The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c – d ^ e ^ f is

Q. If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?

Q. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?