Question
a.
Prefix expression
b.
More than one of these
c.
Full parenthesized infix expression
d.
Partially parenthesized infix expression
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. Which of the following types of expressions does not require precedence rule when evaluated?
Similar Questions
Discover Related MCQs
Q. If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before encounterring stack overflow?
View solution
Q. Using Pop(S1, Item) Push(S1,Item) Read(Item) Print(Item) the variables S1 represents (stack) and Item are given the input file: A,B,C,D,E,F Which stacks are possible:
View solution
Q. Using Pop (S1,Item) ,Push(S1, Item), Getlist(Item), Pop(S2,Item), and the variables S1,S2(stacks with Top1 and Top2) and Item and given the input file: A,B,C,D,E,F Which stack are possible?
View solution
Q. Following sequence of operations is performed on a stack push(1),push(2),pop, push(1),push(2)pop,pop,pop,push(2),pop.The sequence of poped out values are
View solution
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
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!