adplus-dvertising
frame-decoration

Question

The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?

a.

600

b.

350

c.

650

d.

588

Answer: (b).350

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?

Similar Questions

Discover Related MCQs

Q. Convert the following infix expressions into its equivalent postfix expressions
(A + B ⋀D)/(E – F)+G

Q. Convert the following Infix expression to Postfix form using a stack
x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.

Q. Which of the following statement(s) about stack data structure is/are NOT correct?

Q. Consider the following operation performed on a stack of size 5.
Push(1);

Pop();

Push(2);

Push(3);

Pop();

Push(4);

Pop();

Pop();

Push(5);

After the completion of all operation, the number of elements present in stack are

Q. The type of expression in which operator succeeds its operands is?

Q. Assume that the operators +,-, X are left associative and ^ is right associative.
The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c – d ^ e ^ f is

Q. If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?

Q. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

Q. The data structure required for Breadth First Traversal on a graph is?

Q. A queue is a ?

Q. If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

Q. A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

Q. A normal queue, if implemented using an array of size MAX_SIZE, gets full when

Q. Which of the following real world scenarios would you associate with a stack data structure?

Q. What does ‘stack underflow’ refer to?

Q. What is the time complexity of pop() operation when the stack is implemented using an array?

Q. Which of the following array position will be occupied by a new element being pushed for a stack of size N elements(capacity of stack > N).

Q. What happens when you pop from an empty stack while implementing using the Stack ADT in Java?

Q. ‘Array implementation of Stack is not dynamic’, which of the following statements supports this argument?

Q. Which of the following array element will return the top-of-the-stack-element for a stack of size N elements(capacity of stack > N).