2.1

A program consisting of 500 instructions is executed on a 5-stage processor. How many cycles would be required to complete the program.

(i) without pipelining?

(ii) with pipelining?

Assume ideal overlap in case of pipelining.

2.2

Suppose an 8-bit word stored in memory is 10011010. Using the Hamming algorithm, determine what check bits would be stored in memory with the data word. Show how you got your answer.