*JAVA* Data Structures

1. The infix expression 1^ 2 - 3 * 4 is converted to postfix. What is the order in which operators are popped from the stack in the infix to postfix algorithm?
   1. ^-*
   2. *-^
   3. -*^
   4. ^*
   5. None of the above
2. Which of the following types of expressions requires knowledge of precedence rules?
   1. Infix and postfix
   2. Intfix only
   3. Postfix only
   4. Neither infix or postfix
3. Which one of (a)(d) does not indicate an error when checking for balanced parenthesis?

a. . b. . c. In the end, stack is empty d. . e.

3. 1. In the end, the stack contains one left parenthesis
   2. In the end, the stack contains one right parenthesis
   3. The next symbol is right parenthesis and the stack is empty
   4. all of the above indicate an error
4. Which of the following represents an infix expression followed by the postfix equivalent?
   1. a + b - c and a b c - +
   2. a + b * c and a b c * +
   3. a + b * c and a b c + *
   4. a + b * c and a b + c *
5. Which of (a)(d) is false?
   1. A postfix expression does not require parenthesis to specify evaluation order
   2. For every infix expression, there exists an equivalent postfix expression
   3. or every postfix expression, there exists an equivalent infix expression
   4. Evaluation of a postfix expression can be done in linear time.
   5. All of the above are true.