adplus-dvertising
frame-decoration

Question

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?

a.

b c a

b.

b a c

c.

c b a

d.

c a b

Answer: (d).c a b

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. Stack can't be used to

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?

Q. Stack is useful for implementing

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

Q. Stacks cannot be used to

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

Q. Stack is useful for implemeting

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

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

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

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

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

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

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

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?