Introduction to Computing Systems (2nd Exam). 1. [15] Complete a truth table (inputs: A, B, C; output: D) for the transistor-level circuit shown in Figure.

Slides:



Advertisements
Similar presentations
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
Advertisements

CDA 3100 Recitation Week 10.
CEG 320/520: Computer Organization and Assembly Language Programming1 Assembly Language Programming Machine Code Hand Assembly.
TK2633 Introduction to Parallel Data Interfacing DR MASRI AYOB.
Ans: (b) Moore’s law projects the doubling of transistors every couple of years and has nothing to do with registers. The number of registers will change.
S. Barua – CPSC 240 CHAPTER 5 THE LC-3 Topics Memory organization Registers Instruction set Opcodes.
Determine the truth value of each of the following, respectively: -1  [-2, 2], -1  {-2, 2}, -1  (-2, 2) (1) T T T (2) T F T (3) T T F (4) T F F (5)
Computer Structure - Datapath and Control Goal: Design a Datapath  We will design the datapath of a processor that includes a subset of the MIPS instruction.
Chapters 5 - The LC-3 LC-3 Computer Architecture Memory Map
State Machines Used to Design Sequential Circuits.
Dale & Lewis Chapter 5 Computing components. Let’s design a computer Generic CPU with registers −Program counter (PC) – 5 bits (size of addresses) −Instruction.
Chapters 4 & 5: LC-3 Computer Architecture Machine Instructions Assembly language Programming in Machine and Assembly Language.
Overview von Neumann Model Components of a Computer Some Computer Organization Models The Computer Bus An Example Organization: The LC-3.
Lecture 24: CPU Design Today’s topic –Multi-Cycle ALU –Introduction to Pipelining 1.
Computer Science 210 Computer Organization The Instruction Execution Cycle.
Processor: Datapath and Control
Chapter 5 The LC-3. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 5-2 Data Movement Instructions Load --
Computer Science 101 Computer Systems Organization ALU, Control Unit, Instruction Set.
Universal college of engineering & technology. .By Harsh Patel)
Computer Science 210 Computer Organization Control Circuits Decoders and Multiplexers.
September 26, 2001Systems Architecture I1 Systems Architecture I (CS ) Lecture 2: Implementation of a Simplified Computer Jeremy R. Johnson Wednesday,
Represents different voltage levels High: 5 Volts Low: 0 Volts At this raw level a digital computer is instructed to carry out instructions.
COMPILERS CLASS 22/7,23/7. Introduction Compiler: A Compiler is a program that can read a program in one language (Source) and translate it into an equivalent.
1. Building A CPU  We’ve built a small ALU l Add, Subtract, SLT, And, Or l Could figure out Multiply and Divide  What about the rest l How do.
CENTRAL PROCESSING UNIT Written by: Gizem Gulsen.
Von Neumann Model Computer Organization I 1 September 2009 © McQuain, Feng & Ribbens The Stored Program Computer 1945: John von Neumann –
Khaled A. Al-Utaibi  I/O Ports  I/O Space VS Memory Space  80x86 I/O Instructions − Direct I/O Instructions − Indirect I/O Instructions.
Hardwired Control Department of Computer Engineering, M.S.P.V.L Polytechnic College, Pavoorchatram. A Presentation On.
The LC-3 – Chapter 5 COMP 2620 Dr. James Money COMP
3.13 How many output lines will a five-input decoder have?
Jeremy R. Johnson William M. Mongan
MIPS Processor.
a.What is the resistance from X to Y? b.What is the resistance from X to Z? c.What is the total current? d.What is the current from X to Y? e.What.
Chapter 6. Digital Arithmetic: Operations and Circuits
Chapter 5 Computer Organization TIT 304/TCS 303. Purpose of This Chapter In this chapter we introduce a basic computer and show how its operation can.
Exam-like questions.
Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.
Computer Science 210 Computer Organization
More Devices: Control (Making Choices)
Overview Register Transfer Language Register Transfer
Overview Instruction Codes Computer Registers Computer Instructions
Computer Science 210 Computer Organization
Instruction Formats Each instruction consists of two parts:
Chapter 5 The LC-3.
The fetch-execute cycle
The Processor and Machine Language
MIPS processor continued
Designing MIPS Processor (Single-Cycle) Presentation G
Computer Architecture
Computer Science 210 Computer Organization
Single-Cycle CPU DataPath.
CS/COE0447 Computer Organization & Assembly Language
Design of the Control Unit for One-cycle Instruction Execution
CSCI206 - Computer Organization & Programming
CS/COE0447 Computer Organization & Assembly Language
CS/COE0447 Computer Organization & Assembly Language
For OCR GCSE Computing Unit 1 - Theory
Computer Science 210 Computer Organization
Computer Science 210 Computer Organization
Enhancing Data Path M 4-bit Reg X A L U
13 Digital Logic Circuits.
Tri-state buffer A circuit which allows an input to go to output when desired Otherwise it behaves as if “nothing” is connected to the wire An equivalent.
Figure 6-1a. MOVFF Direct Addressing Opcode
CS 206D Computer Organization
LC-2: The Little Computer 2
Binary Logic.
Logic Circuits Analysis
CS/COE0447 Computer Organization & Assembly Language
Instruction execution and ALU
The state in a stored-program digital computer
Presentation transcript:

Introduction to Computing Systems (2nd Exam)

1. [15] Complete a truth table (inputs: A, B, C; output: D) for the transistor-level circuit shown in Figure 1. ABCD Figure 1

2. [15] Complete a truth table (inputs: A, B, C; output: D) for the logic circuit shown in Figure 2. Figure 2 ABCD

3. [40] Consider the memory shown in Figure 3. (a)What is the function of A1 and A0? (b)What is the function of WE? (c)What is the function of D2, D1, and D0? (d)What is the function of Q2, Q1, and Q0? (e)How many locations are there in this memory? (f)What are the addresses of these locations? (g)How many bits does a location contain in this memory? (h)What will happen if we set A1=1, A0=0, WE=1, D2=1, D1=0, and D0=1? (i)Follow h. What will happen if we then set A1=1, A0=0, WE=0, D2=0, D1=1, and D0=0? (j)If you would like to write 001 to location 11. What values will you set to A1, A0, WE, D2, D1, and D0?

(a)address (b)WE=1 write to memory (c)data input to memory (d)data output from memory (e)4 (f)00,01,10,11 (g)3 bits (h)101 written in location 10 (i)Nothing happens (j)A1=1, A0=1, WE=1, D2=0, D1=0, D0=1 Figure 3

4. [15] Suppose the contents of R0~R7 are x0000, x0001, x0002, x0003, x0004, x0005, x0006, and x0007, respectively. What will the contents of R0~R7 be after the execution of the instruction ? Note that bits are opcode, bits 11-9 represent Dst register, bits 8-6 represent Src1 register, and bits 2-0 represent Src2 register. Also, 0001 is the opcode for ADD. [R2]=x0009,The other registers unchanged

5. [15] Suppose the contents of R0~R7 are x0000, x0001, x0002, x0003, x0004, x0005, x0006, and x0007, respectively. What will the contents of R0~R7 be after the execution of the instruction ? Note that bits are opcode, bits 11-9 represent Dst register, bits 8-6 represent Base register, and bits 5-0 represent Offset. Assume that all the memory is cleared. Also, 0110 is the opcode for LDR. [R2]=x0000,The other registers unchanged