
Prefix and Postfix in data structure
Authored by Priyanka K
Computers
University
Used 27+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
When an operand is read, which of the following is done?
It is placed on to the output
It is placed in operator stack
It is ignored
Operator stack is emptied
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What should be done when a left parenthesis ‘(‘ is encountered?
It is ignored
It is placed in the output
It is placed in the operator stack
The contents of the operator stack is emptied
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following is an infix expression?
(a+b)*(c+d)
ab+c*
+ab
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the postfix expression for the corresponding infix expression?
a+b*c+(d*e)
abc*+de*+
abc+*de*+
a+bc*de+*
abc*+(de)*+
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Parentheses are simply ignored in the conversion of infix to postfix expression.
True
False
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?
operand is always placed in the output
operator is placed in the stack when the stack operator has lower precedence
parenthesis are included in the output
higher and equal priority operators follow the same condition
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In infix to postfix conversion algorithm, the operators are associated from?
right to left
left to right
centre to left
centre to right
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?