Prefix,Postfix,Infix Notation
Quiz Summary
0 of 20 Questions completed
Questions:
Information
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
Results
Results
0 of 20 Questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
Categories
- Not categorized 0%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- Current
- Review
- Answered
- Correct
- Incorrect
- Question 1 of 20
1. Question
1. Transform the following infix expression to postfix form:
(A+B)*(C-D)/ECorrectIncorrect - Question 2 of 20
2. Question
2. Transform the following infix expression to postfix form:
A-B /(C*D)CorrectIncorrect - Question 3 of 20
3. Question
3. Evaluate the following prefix expression * – + 4 3 5 / + 2 4 3
CorrectIncorrect - Question 4 of 20
4. Question
4. Which of the following is an infix expression?
CorrectIncorrect - Question 5 of 20
5. Question
5. Parentheses are simply ignored in the conversion of infix to postfix expression.
CorrectIncorrect - Question 6 of 20
6. Question
6. It is easier for a computer to process a postfix expression than an infix expression.
CorrectIncorrect - Question 7 of 20
7. Question
7. What is the postfix expression for the infix expression?
a-b-c
CorrectIncorrect - Question 8 of 20
8. Question
8. Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?
CorrectIncorrect - Question 9 of 20
9. Question
9. Evaluate the following postfix expression 1 4 18 6/3 + + 5 / +
CorrectIncorrect - Question 10 of 20
10. Question
10. Transform the following infix expression to prefix form:
((c*2)+1)/(a+b)
CorrectIncorrect - Question 11 of 20
11. Question
11. Transform the following infix expression to prefix form:
Z – ((((X + 1)*2)-5)/Y)
CorrectIncorrect - Question 12 of 20
12. Question
12. 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. What is the maximum number of symbols that will appear on the stack at one time during the conversion of this expression ?
CorrectIncorrect - Question 13 of 20
13. Question
13. What is the value of the postfix expresion 6 3 2 4 + – *
CorrectIncorrect - Question 14 of 20
14. Question
14. If the expression ((2 + 3) * 4 + 5 * (6 + 7) * 8) + 9 is evaluated with * having precedence over +, then the value obtained is same as the value of which of the following prefix expression ?
CorrectIncorrect - Question 15 of 20
15. Question
15. Evaluate the following prefix expression: +*2+/ 14 2 5 1 ________
CorrectIncorrect - Question 16 of 20
16. Question
16. Parenthesis are never needed prefix or postfix expression:
CorrectIncorrect - Question 17 of 20
17. Question
17. A postfix expression is merely the reverse of the prefix expression:
CorrectIncorrect - Question 18 of 20
18. Question
18. Which among the following data structure may give overflow error, even through the current number of elements in it, is less than its size:
CorrectIncorrect - Question 19 of 20
19. Question
19. Convertion of infix arthimetic expression to postfix expression uses:
CorrectIncorrect - Question 20 of 20
20. Question
20. Match the following
Sort elements
- +*2+/ 14
- i-j /(k*l)
- ijkl*/-s
- prefix expression
- infix expression
- postfix expression
CorrectIncorrect