Bissoy.com
Doctors Medicines MCQs Q&A

Infix to prefix conversion can be done using __________

Infix to prefix conversion can be done using __________ Correct Answer two stacks

In the infix expression, the operator appears between the operands and in infix notation if the operator appears before the operands in the expression. For the conversion between them two stacks are used efficiently. The idea is to use one stack for operators and other to store operands.

Related Questions

Which one of the following is the correct sequence of various stages of operating cycle of a manufacturing company?  1. Raw material conversion period, work-in-progress conversion period, Finished goods conversion period, Receivables conversion period 2. Raw material conversion period, work-in-progress conversion period, Creditors payment period, Receivables conversion period 3. Creditor payment period. Raw material conversion period, Receivables conversion period, work-in- progress conversion period 4. Raw material conversion period, Finished goods conversion period, work-in- progress conversion period. Receivables conversion period 
Given two processes (conversion of postfix equation to infix notation and conversion of prefix notation to infix notation), which of the following is easier to implement?
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. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
Which of the following statements is/are correct with respect to a Scott-connected transformer? I. It can do 3-phase to 2-phase conversion II. It can do 2-phase to 3-phase conversion III. It can do 2-phase to 4-phase conversion IV. It can do 3-phase to 4-phase conversion
The prefix form of an infix expression (p + q) – (r * t) is?
What data structure is used when converting an infix notation to prefix notation?
When converting the prefix notation into an infix notation, the first step to be followed is ________
The time complexity of converting a prefix notation to infix notation is _________
Conversion from prefix to postfix expression can be done _______________
Which of the following applications may use a stack? (a) Parenthesis balancing program (b) Process scheduling operating system (c) Conversion of infix arithmetic expression to postfix form