Intro to Architecture

Please answer all questions carefully and thoughtfully.
Use as much paper as you wish, but make sure that you label your answers and that you put your name on the top of each page.
Unreadable or incomprehensible answers will receive no credit.

(3 pts) Describe three techniques by which the number of instructions in an assembly language may be reduced (How do you make a RISC assembly language). You should provide illustrative examples.
(3 pts) What facilities are provided to support recursive languages? Describe these facilities and discuss the information that must be stored using them.
(6 pts) Demonstrate the algorithms for the ripple adder, conditional sum adder and the lookahead-carry adder in 8 bits, using the numbers 155 and 54. If you wish, develop a 4 bit lokahead carry adder.
(3 pts) Discuss the performance of the adders in the previous question. State which steps may be performed in parallel and which are inherently sequential.
(3 pts) Form the excess b representation for numbers x and y. Show how to perform mathematics in excess b to find the sum and difference of x and y.
(3 pts) Represent -54.13625 in IEEE 754 floating point format.
(3 pts) Describe three techniques for dealing with the memory latency problem.
(3 pts) Define Data Hazard. Give an example of a data hazard.
(3 pts) How can more transistors on a chip be translated into faster computers? Give examples.