finalexamfall04 - Name: Grade: Computer Organization...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Organization CDA-3103 Final Exam Fall 2004 Be lucid and neat. Justify all your answers. 75 mins. Closed book, Closed notes, No calculator. Name: Grade:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Q1. (20 pts.) In designing a compiler, you are considering two different code sequences for a particular high-level language statement. The code sequences are implemented using three classes of instructions, with the instruction counts given in the following table The following table provides the instruction mix for the hardware on which the code sequences will run a. (4 pts.) Which code sequence executes the most instructions? b. (8 pts) Which code sequence is faster? c. (8 pts.) What is the CPI for each sequence? Co de Sequence Instruction counts for instruction class A B C 1 3 2 1 2 2 2 2 Instruction Class CPI A 2 B 2 C 3
Background image of page 2
Q2. (20 pts.) Two variables x and y are stored in memory locations X and Y . a. (10 pts.) Write a sequence of MIPS instructions that would check if the values in X and Y have same signs. b.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/22/2010 for the course CDA 3101 taught by Professor Staff during the Fall '07 term at University of Central Florida.

Page1 / 7

finalexamfall04 - Name: Grade: Computer Organization...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online