adplus-dvertising
frame-decoration

Question

In a computer system, when an __________ expression in an infix notation needs to be evaluated, it is first converted into its postfix notation?

a.

Algebraic

b.

Arithmetic

c.

Trigonometric

d.

Geometric

Answer: (b).Arithmetic

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In a computer system, when an __________ expression in an infix notation needs to be evaluated, it is first converted into its postfix notation?

Similar Questions

Discover Related MCQs

Q. The postfix form of the following infix notation is :

(A + B)* (C*D − E)* F

Q. What are the sequence of popped out values if the sequence of operations - push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop are performed on a stack.

Q. In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is ............

Q. push() and pop() functions are found in ...............

Q. The result of evaluating the following postfix expression is
5, 7, 9, *, +, 4, 9, 3, /, +, -

Q. An infix expression can be converted to a postfix expression using a .................

Q. A data structure in which an element is added and removed only from one end, is known as

Q. The data structure needed to convert a recursion to an iterative procedure is ............

Q. The prefix form of an infix expression A+B-C*D is

Q. One can determine whether an infix expression has balanced parenthesis or not by using .............

Q. n elements of a Queue are to be reversed using another queue. The number of “ADD” and “REMOVE” operations required to do so is:

Q. One can convert an infix expression to a postfix expression using a ..............

Q. Which of the following types of expressions do not require precedence rules for evaluation?

Q. The postfix form of A ^ B * C - D + E/ F/ (G + H)

Q. The prefix of (A+B)*(C-D)/E*F is:

Q. Stack in Data Structure is ___________.

Q. In the stack process of inserting an element in the stack is called as ___________.

Q. Process of Removing element from the stack is called as __________.

Q. In the stack, If user try to remove element from the empty stack then it called as ___________.

Q. User push 1 element in the stack having already five elements and having stack size as 5 then stack becomes ___________.