Evaluating Expressions

Evaluating Expressions

Multiple Choice

These can be any legal variable names or constants in programming languages.

• operators

• operands

• variables

• constants

Multiple Choice

The proper syntax for postfix notation.

• <operator> <operand1><operand2>

• <operand1><operand2><operator>

• <operand1> <operator><operand2>

• <operator1> <operand><operator2>

Multiple Choice

Give the prefix notation:

C-C*I+T

• * - C C I + T

• - + * C I T C

• - C + * C I T

• - C * + C I T

Multiple Choice

These are described by basic arithmetic operators, unary operators, relational operators, or logical operators.

• operators

• operations

• operands

• expressions

Multiple Choice

If there are two operators with the same precedence, the computer starts to solve the expression from right to left.

• Yes

• No

Multiple Choice

Converting from infix notation to prefix notation is also known as polish notation.

• True

• False