9 3 / 5 + =
9 / 3 -> 3 5 + -> 3 + 5 = 8
35*7+ =
(3*5) -> (7 + 15) -> 22
42351-+*+ =
4234++ -> 427+ -> 4(14)+ -> 18
in postfix there is no need for an order of ……… of ………..
precedence, operators
…… can be ……… by a computer as they are entered ….. to ……
postfix, evaluated, left, right
an …… in postfix can be ……. by a computer …… than one in infix
expression, processed, quicker
no need for ……
brackets
infix to postfix - step one, add the ….
3+2+2*5 =
brackets
((3+2) + (2*5))
infix to postfix - step two, move operations out of brackets
((3+2) + (2*5)) =
((3 2) + (2 5) *) +
infix to postfix - step 3, remove brackets
((3 2) + (2 5) *) + =
3 2 + 2 5 * +
postfix to infix - step one, put all the terms up until the first …… into the bins
3 4 + 2 * =
4
3
postfix to infix - step two, add operation in between the 2 most recent values (number at top moves to right)
4 +
3
3 + 4
postfix to infix - step 3, add the next numbers
(3 + 4) 2 * =
2
(3 + 4)
postfix to infix - step 4, apply operation to next two values
2 *
(3 + 4)
(3 + 4) * 2
when converting from postfix to infix, the number at the top moves to the ……
right
what is infix?
humans solving maths by BIDMAS
what is postfix?
computers solving maths (stack)
what is another name for postfix
RPN
what does RPN stand for
reverse polish notation