Question
a.
b c a
b.
b a c
c.
c b a
d.
c a b
Posted under Data Structures and Algorithms
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
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
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
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
