Computer Science 61CL - Fall 1998 - Fateman - Midterm 2

# Computer Science 61CL - Fall 1998 - Fateman - Midterm 2 -...

This preview shows pages 1–3. Sign up to view the full content.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS61C, Midterm #2, FALL 1998 CS61c, Fall 1998 Midterm #2 Professor Fateman Problem #1 (7 points) Answer the following questions using the diagram of a full adder module: A B CarryIn | | | V V V |-------------------------| CarryOut <<< | | |-------------------------| | V Sum a. Using no more than 10 of these adders, and no more than 4 other logic symbols, draw a circuit that takes an 8 bit unsigned number X and returns the eight lower order bits of X multiplied by 5. Ignore overflow. For example, 5*0x04 is 0x14 (20 decimal), and 5*0x80 is 0x80. b. By making the inputs and outputs specifically on your diagram, show how your circuit can multiply 40 (decimal) by 5 to get 200 (decimal). Problem #2 (2 points) CDR-coding can be explained as a way of saving memory. a. How does it save memory? b. Now that memory is so cheap, can you come up with a good reason to still use CDR coding? Problem #3 (10 points) file:///C|/Documents%20and%20Settings/Jason%20Raft...%20Fall%201998%20-%20Fateman%20-%20Midterm%202.htm (1 of 4)1/27/2007 6:35:29 PM CS61C, Midterm #2, FALL 1998 a. Given the address 0xA2EC4A8F, compute the block offset, set number and tag for each of the following caches: Size(bytes) Width (bytes) Policy Offset Set Tag in HEXADECIMAL 4096 4 Direct-Mapped 1024 16 4-way set associative 2048 32 Fully Associative Problem #4 (7 points) Stride 4 8 16 32 64 128 256 512 Size 32 205 212 206----- 64 221 203 213 202---- 128 214 243 232 212 204--- 256 227 235 241 233 216 231-- 512 598 523 543 1311 1285 1289 321- 1024 543 521 514 1294 1314 1306...
View Full Document

{[ snackBarMessage ]}

### Page1 / 4

Computer Science 61CL - Fall 1998 - Fateman - Midterm 2 -...

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

View Full Document
Ask a homework question - tutors are online