Fall 2006 1 EE 333 Lillevik333f06-e2 University of Portland School of Engineering EE 333 Exam 2 November 9, 2006 Instructions 1.Print your name, student.

Slides:



Advertisements
Similar presentations
The CPU The Central Presentation Unit What is the CPU?
Advertisements

Microprocessors.
Adding the Jump Instruction
Fall EE 333 Lillevik 333f06-l2 University of Portland School of Engineering Computer Organization Lecture 2 Expectations/Rumors Prerequisites Syllabus,
Fall EE 333 Lillevik 333f06-l1 University of Portland School of Engineering Computer Organization Lecture 1 Introductions Course objectives PC Example.
Fall EE 333 Lillevik480f05-a3 University of Portland School of Engineering EE 333 Final Exam December 15, 2005 Instructions 1.Print your name, student.
Fall EE 333 Lillevik480f05-a2 University of Portland School of Engineering EE 333 Exam 2 November 10, 2005 Instructions 1.Print your name, student.
CIS 314 Fall 2005 MIPS Datapath (Single Cycle and Multi-Cycle)
Fall EE 333 Lillevik 333f06-s3 University of Portland School of Engineering Computer Organization Final Exam Study Final Exam Tuesday, December.
Fall EE 333 Lillevik333f06-a1 University of Portland School of Engineering EE 333 Exam 1 September 28, 2006 Instructions 1.Print your name, student.
Fall EE 333 Lillevik 333f06-l20 University of Portland School of Engineering Computer Organization Lecture 20 Pipelining: “bucket brigade” MIPS.
CHAPTER 4 COMPUTER SYSTEM – Von Neumann Model
L14 – Control & Execution 1 Comp 411 – Fall /04/09 Control & Execution Finite State Machines for Control MIPS Execution.
CSCE 212 Quiz 8 – 3/23/11 1.What type of element is the ALU (combinational or state) and what does it mean for an element to be that type? 2.What is the.
10/26/2004Comp 120 Fall October Only 11 to go! Questions? Today Exam Review and Instruction Execution.
Fall 2007 MIPS Datapath (Single Cycle and Multi-Cycle)
Microprocessor Design
Lecture 24: CPU Design Today’s topic –Multi-Cycle ALU –Introduction to Pipelining 1.
Computer Science 210 Computer Organization The Instruction Execution Cycle.
Fall EE 333 Lillevik 333f06-l7 University of Portland School of Engineering Computer Organization Lecture 7 ALU design MIPS data path.
Cis303a_chapt04.ppt Chapter 4 Processor Technology and Architecture Internal Components CPU Operation (internal components) Control Unit Move data and.
Fall EE 333 Lillevik 333f06-l8 University of Portland School of Engineering Computer Organization Lecture 8 Detailed MIPS datapath Timing overview.
Introduction to Computer Engineering CS/ECE 252, Fall 2009 Prof. Mark D. Hill Computer Sciences Department University of Wisconsin – Madison.
Fall EE 333 Lillevik 333f06-l21 University of Portland School of Engineering Computer Organization Lecture 21 Subroutines, stack Interrupts, service.
Spring EE 437 Lillevik 437s06-l16 University of Portland School of Engineering Advanced Computer Architecture Lecture 16 Cache design example Data/tag.
Fall EE 333 Lillevik 333f06-l17 University of Portland School of Engineering Computer Organization Lecture 17 Controller design Microprogramming.
Fall EE 333 Lillevik 333f06-l13 University of Portland School of Engineering Computer Organization Lecture 13 Controller implementations Register.
Fall EE 333 Lillevik 333f06-l14 University of Portland School of Engineering Computer Organization Lecture 14 Memory hierarchy, locality Memory.
Computer Architecture 2 nd year (computer and Information Sc.)
Fall EE 333 Lillevik 333f06-s2 University of Portland School of Engineering Computer Organization Study Guide 2 Exam 2 Thursday, November 9 Closed.
Multilevel Caches Microprocessors are getting faster and including a small high speed cache on the same chip.
Fall EE 333 Lillevik 333f06-l18 University of Portland School of Engineering Computer Organization Lecture 18 IF, ID, R-type microprogramming Exam.
Spring EE 437 Lillevik 437s06-l5 University of Portland School of Engineering Advanced Computer Architecture Lecture 5 Slave bus agent ROM example.
Structure and Role of a Processor
Elements of Datapath for the fetch and increment The first element we need: a memory unit to store the instructions of a program and supply instructions.
1 Basic Processor Architecture. 2 Building Blocks of Processor Systems CPU.
Chapter 20 Computer Operations Computer Studies Today Chapter 20.
Fall EE 333 Lillevik 333f06-l16 University of Portland School of Engineering Computer Organization Lecture 16 Write-through, write-back cache Memory.
ECE Fall G. Byrd1 Register A register stores a multi-bit value. We use a collection of D-latches, all controlled by a common WE. When WE=1,
Design a MIPS Processor (II)
CS161 – Design and Architecture of Computer Systems
CS161 – Design and Architecture of Computer Systems
CS2100 Computer Organization
Single-Cycle Datapath and Control
Computer Architecture
EE 333 Exam 1 September 29, 2005 Answers Instructions Name Student ID
CSCI206 - Computer Organization & Programming
Morgan Kaufmann Publishers The Processor
Advanced Computer Architecture Lecture 14
Computer Science 210 Computer Organization
Design of the Control Unit for Single-Cycle Instruction Execution
CSCI206 - Computer Organization & Programming
Computer Science 210 Computer Organization
FIGURE 12-1 Memory Hierarchy
Design of the Control Unit for One-cycle Instruction Execution
A Multiple Clock Cycle Instruction Implementation
CSCI206 - Computer Organization & Programming
The Processor Lecture 3.2: Building a Datapath with Control
Vishwani D. Agrawal James J. Danaher Professor
COMS 361 Computer Organization
COSC 2021: Computer Organization Instructor: Dr. Amir Asif
The Stored Program Computer
Review Fig 4.15 page 320 / Fig page 322
Control Unit for Multiple Cycle Implementation
Control Unit for Multiple Cycle Implementation
Computer Architecture Assembly Language
Computer Organization Lecture 19
Little work is accurate
Advanced Computer Architecture Lecture 19
Chapter 4 The Von Neumann Model
Presentation transcript:

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering EE 333 Exam 2 November 9, 2006 Instructions 1.Print your name, student ID, and seat in the above blanks. 2.This is a Closed Book exam. 3.Do all of the problems. They may vary in points but the total is 100. Questions are short answer and problems. 4.Do not use any additional pages of paper. If you run out of room, use the back sides. Do not remove the staple. 5.Please write clearly or print. Illegible or unreadable answers may not be graded for partial credit. 6.Mark your answer with a box or star. Name Student ID Seat Answers

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 1 (10 pts) Determine the control/mux signals for the branch- on-equal EX clock? Mark on the next page. Operation –If (A = = B), PC = ALUout –ALUout = branch address from clock 2 Functional units –ALU must subtract, A-B –ALUout contains optimistic branch address –Zero flag controls write to PC

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 1, continued. (10 pts) Clock 3 Optimistic branch address 01 or sub

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 2 (10 pts) 74LS161 Data Sheet

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 2, continued. (10 pts) Complete the design for an 8-bit PC Data for write Write to PC Increment PC All signals asserted high

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 3 (10 pts) A.List ideal memory design goals. Unlimited size, infinite bandwidth B.What is a memory hierarchy? Multiple levels of memory with different speeds and sizes C.How does a hierarchy approximate the goals? Principal of locality

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 4 (10 pts) Design a 12K x 8 ROM memory using only the ROM and 138 devices, fully decode the address, and start memory at address zero.

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 5 ( 10 pts ) Consider the 16 x 8 RAM design below.

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 5, continued. ( 10 pts ) A.At what time(s) are data written, what are the data and address? (125, FF, 0)(225, AA, 1) (325, 55, 2) B.At what time(s) are data read, what are the data and address? (400, FF, 0)(500, AA, 1) (600, 55, 2)

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 6 (10 pts) Determine the length and width of the memory components required for the system memory in the table below (note: G=1024M, M=1024K)? MemoryComponentLengthWidth 16K x 162K x K x 3216K x M x 32256K x M x 641M x G x 64512M x 888

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 7 ( 10 pts ) Cache memory indexVMtagdata 000YY100x NY110x NN010x YY000xabc 100YN010xdef 101YY110x YY100x NY000x789 For the direct mapped, write-back cache below, complete the table (Y or N)? CPU write adrhit?WB? NN, invalid YN YN NN YN NY NY NN, invalid WB = miss-modified

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 8 (10 pts) A.Draw the block diagram of a controller. B.Explain how it works. The IR and present state dictate the next state, each present state asserts control points (MUXes, read/writes, etc.) Present State NS Decoder Output Decoder IRControl points

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 9 ( 10 pts ) Below is the MDP16 register array and timing diagram

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 9, continued. ( 10 pts ) A.At what time(s) are data written to the array, with what data, which register? (300, FFFF, $0 & $1) (900, 5555, $0) (1300, AAAA, $1) B.At what time(s) does R0out change and to which register value? (500, $0) (1100, $0) (1900, $1) (2100, $0) (2300, $1)

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 10 (10 pts) opadr op rsrtadr/imm I J R op rsrt funcrd Below is the instruction formats for the MDP16 computer, answer the following questions.

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Problem 10, continued. (10 pts) A.Why do we have just two registers? Need only one bit to define B.What is the most positive and negative address offset? C.What is the range of the jump address? 0x000 to 0xfff = 0000 to 4095

Fall EE 333 Lillevik333f06-e2 University of Portland School of Engineering Statistics ProbStdAve 1/ / / / / / / / / / Ave