{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Computer Science 61CL - Spring 2000 - Harvey - Midterm 1

Computer Science 61CL - Spring 2000 - Harvey - Midterm 1 -...

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

View Full Document Right Arrow Icon
CS 61C Midterm – Spring 2000 CS 61C Midterm – Spring 2000 Question 1 (2 points) Convert the binary value 110000001111111111101110 into a) hexadecimal (base 16) b) octal (base 8) Question 2 (4 points) Assuming a five-bit word length, convert the binary value 11100 to decimal, supposing the representation is a) unsigned b) sign-magnitude c) one’s complement d) two’s complement Question 3 (3 points) Decode the following binary numbers as MIPS instructions and give the equivalent MIPS assembly language (MAL) statements. Show memory addresses, if any, in hexadecimal. Address Value 0x40 00001100101101110000000000100100 0x44 01000110000001000100000110000010 0x48 00000100111000011111111111111110 Question 4 (2 points) In the MIPS procedure-calling convention, there exist a compromise between a pure “callee-saved” and a pure “caller-saved” convention. That is, some registers are “callee-saved” ($s registers) and some are “caller-saved” ($t registers). In one English sentence, explain why the MIPS designers chose this mixed strategy rather than either pure callee- saved or pure caller-saved.
Background image of page 1

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

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}