I'm going to be posting lots of different problems for the topics contest #2 will be covering, do as many as you think you need to be ready.

Prefix/postfix:

Postfix expression, a = 12, b = 2, c = 3: a b / a b c ↑ * + a b c * a − * a / −

Convert this infix expression to prefix: (s * (s – a) * (s – b) * (s – c))^(1/2)

Postfix expression: 2 3 2 ↑ − 4 8 2 / 1 + * 2 / + 2 3 * 6 / +

Convert infix to prefix: (a * (b – c) ↑ 2) / b – (c / a ↑ 2)

Prefix expression: + − / * 2 + 4 6 2 ↑ 3 2 / 6 + 2 1

Convert this infix expression to postfix: 3x 2 + 4y – 2(x+y 2 )+(4x)/(5y)

Bit-string flicking:

(NOT 10011) AND 01001 OR (01110 AND 01111)

( LSHIFT-1 01101) AND (RCIRC-2 11100)

01101 OR (NOT 10111) AND 10010

(LCIRC-2 01110) OR ((NOT 10110) AND (RSHIFT-1 01110))

(RSHIFT-1 (LCIRC-2 (LSHIFT-3 (RCIRC-1 (NOT 10011)))))

01110 OR 01100 AND 10110 = 01110 OR (01100 AND 10110)

What does this program do?:

Prefix/postfix answers:

108

↑ * * * s – s a – s b – s c / 1 2

4

− / * a ↑ − b c 2 b / c ↑ a 2

3

3 x 2 ↑* 4 y * + 2 x y 2 ↑ + * − 4 x * 5 y * / +

Bit-string flicking answers:

01110

00010

01101

11001

00001

01110

What does this program do? answers:

86

1

3

37