Web-Technologies
October 10, 2023Queues-and-Stacks
October 10, 2023GATE 1997
|
Question 7
|
Which of the following is essential for converting an infix expression to the postfix from efficiently?
|
An operator stack
|
|
|
An operand stack
|
|
|
An operand stack and an operator stack
|
|
|
A parse tree
|
Question 7 Explanation:
An operator stack ⇒ Infix to (Postfix or Prefix)
An operand stack ⇒ Postfix to Prefix
Operator & operand stack ⇒ We don’t use two stacks
Parse tree ⇒ No use
An operand stack ⇒ Postfix to Prefix
Operator & operand stack ⇒ We don’t use two stacks
Parse tree ⇒ No use
Correct Answer: A
Question 7 Explanation:
An operator stack ⇒ Infix to (Postfix or Prefix)
An operand stack ⇒ Postfix to Prefix
Operator & operand stack ⇒ We don’t use two stacks
Parse tree ⇒ No use
An operand stack ⇒ Postfix to Prefix
Operator & operand stack ⇒ We don’t use two stacks
Parse tree ⇒ No use