uppose a microprocessor has three stages in the

pipeline, as shown in the class notes. Assume a perfect scenario $($such as no branch instructions, no data

dependence between instructions, and no memory I$/$O waiting$)$:

$1.$ How many clock cycles does it take to execute $10$ instructions? What is the throughput $($defined as the

average number of instructions per clock cycle$)?$

$2.$ How many clock cycles does it take to execute $$ instructions? If $$ is sufficiently large, what is the

throughput?

Prob $5.(15$ pts total$)$

A$.(10$ points$)$ Convert the following decimal numbers to $5-$ and $8-$bit binary form, respectively: $($a$)28,($b$)$

$14.$

B$.(5$ points$)$ Can you obtain the binary sequence of $28$ by shifting $($left or right$)$ that of $14?$

Prob $6.(15$ pts total$)$

A$.(10$ points$)$ Convert the following binary numbers to decimal.

$0$b$1\_1000($denoted as variable a$)$

$0$b$0\_0110($denoted as variable b$)$

B$.(5$ points$)$ Relate variables a and b using C$$s shift operator.

Total points: $902$