{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw10_solutions - CS231 Spring 2011 Homework 10 Due 5PM Name...

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

View Full Document Right Arrow Icon
CS231 - Spring 2011 Homework 10 Due: 5PM, April 25, 2011 Name: NetID: Use a printed copy of this homework for final submission and staple please! Instructions: Write your NetID on the bottom of every page The value of each of the 6 questions is indicated on each page and in the table below Work individually on homework. You may discuss material with other students, TAs, and the professor for the purpose of understanding, but your work must be your own. Refer to syllabus for cheating policy Please show all your work to ensure you receive full credit Answers must be neat and legible or points will be deducted You MUST staple your homework pages together with a REAL METAL STAPLE Double sided printing is preferred but not necessary Question Points Score 1 8 2 12 3 10 4 20 5 35 6 15 Total: 100
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
CS231 - Spring 2011 Homework 10 Due: April 25, 2011 1. A digital computer has a memory unit with 16 bits per word. The instruction set consists of 100 different operations. There is only one type of instruction format, with the opcode part and an immediate operand part. Each instruction is stored in one word of memory. (a) (2 points) How many bits are needed for the opcode part of the instruction? ceiling(log(100)) = 7 (b) (2 points) How many bits are left for the immediate part of the instruction? 16 - 7 = 9 (c) (2 points) If the immediate operand is used as an unsigned address to memory, what is the maximum number of words that can be addressed in memory?
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}