Q. In eveluating the arithmetic expression 2*3-(4+5),using stacks to evaluate its equivalent postfix form, which of the following stack configuration is not possible?

View solution

Q. Stack A has the entries a,b,c(with a on top). Stack B is empty.An entry popped out of stack A can be printed immediately or pushed to stack B.An entry popped out of the stack B can only be printed. In this arrangement, which of the following permutations of a,b,c are not possible?

View solution

Q. Stack can't be used to

View solution

Q. Which of the following permutations can be obtained in the output(in the same order),using a stack assuming that the input is the sequence 1,2,3,4,5 in that order?

View solution

Q. Stack is useful for implementing

View solution

Q. The postfix equivalent of the prefix * + a b - c d is

View solution

Q. Stacks cannot be used to

View solution

Q. The postifx expression for the infix expression A + B* (C+D) / F + D*E is

View solution

Q. Stack is useful for implemeting

View solution

Q. An item that is read as input can be either pushed to a stack and later popped and printed, or printed directly. Which of the following will be the output if the input is the sequence of items 1, 2, 3

View solution

Q. Process of inserting an element in stack is called ____________

View solution

Q. Process of removing an element from stack is called __________

View solution

Q. In a stack, if a user tries to remove an element from empty stack it is called _________

View solution

Q. Pushing an element into stack already having five elements and stack size of 5 , then stack becomes

View solution

Q. Entries in a stack are “ordered”. What is the meaning of this statement?

View solution

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

View solution

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