1. Convert to infix notation and evaluate for A = 4, B = 2, C = 3, D = 4.

A B / C + D –

2. Convert to Reverse Polish notation and evaluate for A = 4, B = 5, C = 7, D = 2, and E = 3.

(A - B) * C + (D + E)

3. Compare the 0-address and 1-address machines by writing programs to evaluate Y using the applicable instructions given in the textbook, Chapter 5, page 423, problem #7.

Y = (A / B) + C * D - E

4. A word on a little endian computer has the 21 (base 10). If it is transferred to a big endian computer byte by byte and stored there, with byte 0 in byte 0, and so on. What is its numerical value on the big endian machine? Express the answer in both base 16 and base 10 formats.

5. Assume a word length of 16 bits. What is the 2’s complement of the number 53 (base 10)? Express your number in binary (base 2) and hex (base 16).

Working in binary mode, show that your answer plus 53 in binary mode gives zero and a carry bit of 1. What does this tell you about your 2’s complement number?

Thank you so much.