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:

View solution

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?

View solution

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

View solution

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?

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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.

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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?

View solution

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 ?

View solution