MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized in Data Structures and Algorithms
→
Using the evaluation of prefix algorithm, evaluate..
1.
Using the evaluation of prefix algorithm, evaluate +-9 2 7.
A.
10
B.
4
C.
17
D.
14
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following is an example for a postfix expression?
An error is thrown if the character '\n' is pushed in to the character stack.
How many passes does the balancing symbols algorithm makes through the input?
The postfix expression abc+de/*- is equivalent to which of the following infix expression
When the corresponding end bracket/braces/parentheses is not found, what happens?
What is the value of the postfix expression 2 3 + 4 5 6 – – *
If -*+abcd = 11, find a, b, c, d using evaluation of prefix algorithm.
In Postfix expressions, the operators come after the operands.
What should be done when a left parenthesis '(' is encountered?
What determines the order of evaluation of a prefix expression?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply