1. Explain, in step-by-step form, how a stack is used to evaluate the reverse

postfix notation expression 3 5 7 + 2 1 X 1 + +. In your

explanation, provide the result when the expression is fully evaluated.

2. Write the following expression in reverse postfix notation. Remember to apply the rules of precedence for arithmetic operators.

X = A B + C * (D * E F)

G + H * K

3. a). A non-pipelined system takes 200ns (nanoseconds) to process a task.

The same task can be processed in a 5-segment pipeline with a clock

cycle of 40ns (nanoseconds). Determine the speedup ratio of the

pipeline for 200 tasks.

b). What is the maximum speedup that could be achieved with the

pipelined system over the non-pipelined system?

4. a). A non-pipelined system takes 100ns (nanoseconds) to process a task.

The same task can be processed in a 5-segment pipeline with a clock

cycle of 20ns (nanoseconds). Determine the speedup ratio of the

pipeline for 100 tasks.

b). What is the maximum speedup that could be achieved with the

pipelined system over the non-pipelined system?