Two free sample worksheets on Reverse Polish notation for AQA A Level Computer
Science (7517), with full answer keys, so you can see exactly what the full
pack contains before buying anything.

Each sheet converts an infix expression to RPN, converts a different RPN
expression back to infix - the “and vice versa” the specification asks for -
and evaluates an RPN expression with a stack, one row per token read. The last
question asks why RPN needs no brackets.

Precedence, the order of the operands of a subtraction and which end of a
written stack is the top are all stated on the sheet, so each question has one
correct answer.

These two sheets are not in the paid pack - they are extra, so nothing is
wasted if you buy it afterwards.

The full pack contains 20 worksheets and 20 answer keys, every one on
different expressions. Search ����Vlog for “AQA A Level Computer Science reverse
Polish notation” to find it.

If these are useful, a review is genuinely appreciated - it is the only way
other teachers find resources like this.