Questions 1. half adder sum. x y



Similar documents
Notes on Assembly Language

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

Gates, Circuits, and Boolean Algebra

CS311 Lecture: Sequential Circuits

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design

Design: a mod-8 Counter

CHAPTER 11 LATCHES AND FLIP-FLOPS

MICROPROCESSOR. Exclusive for IACE Students iacehyd.blogspot.in Ph: /422 Page 1

BINARY CODED DECIMAL: B.C.D.

Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop.

Binary Adders: Half Adders and Full Adders

(Refer Slide Time: 00:01:16 min)

Digital Electronics Detailed Outline

CS101 Lecture 26: Low Level Programming. John Magee 30 July 2013 Some material copyright Jones and Bartlett. Overview/Questions

Digital Fundamentals. Lab 8 Asynchronous Counter Applications

Lesson 12 Sequential Circuits: Flip-Flops

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

EE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad

Logic in Computer Science: Logic Gates

Upon completion of unit 1.1, students will be able to

PROBLEMS. which was discussed in Section

DEPARTMENT OF INFORMATION TECHNLOGY

CHAPTER 3 Boolean Algebra and Digital Logic

MICROPROCESSOR AND MICROCOMPUTER BASICS

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, Lab 2. The Full-Adder

Computer organization

CSE 141L Computer Architecture Lab Fall Lecture 2

Building a computer. Electronic Numerical Integrator and Computer (ENIAC)

1 Classical Universal Computer 3

CPU Organisation and Operation

Flip-Flops, Registers, Counters, and a Simple Processor

(Refer Slide Time: 02:39)

Lecture 8: Synchronous Digital Systems

A s we saw in Chapter 4, a CPU contains three main sections: the register section,

COMBINATIONAL CIRCUITS

SEQUENTIAL CIRCUITS. Block diagram. Flip Flop. S-R Flip Flop. Block Diagram. Circuit Diagram

3.Basic Gate Combinations

Unit A451: Computer systems and programming. Section 2: Computing Hardware 1/5: Central Processing Unit

Memory Elements. Combinational logic cannot remember

2.0 Chapter Overview. 2.1 Boolean Algebra

8085 INSTRUCTION SET

1 Description of The Simpletron

Figure 8-1 Four Possible Results of Adding Two Bits

Chapter 01: Introduction. Lesson 02 Evolution of Computers Part 2 First generation Computers

Number Who Chose This Maximum Amount

earlier in the semester: The Full adder above adds two bits and the output is at the end. So if we do this eight times, we would have an 8-bit adder.

The science of computing

Counters and Decoders

Let s put together a Manual Processor

GAUGEMASTER PRODIGY EXPRESS

PROGRAMMABLE LOGIC CONTROLLERS Unit code: A/601/1625 QCF level: 4 Credit value: 15 OUTCOME 3 PART 1

The Hexadecimal Number System and Memory Addressing

TEACHING COMPUTER ARCHITECTURE THROUGH SIMULATION (A BRIEF EVALUATION OF CPU SIMULATORS) *

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks

Chapter 1: Digital Systems and Binary Numbers

Engr354: Digital Logic Circuits

So far we have investigated combinational logic for which the output of the logic devices/circuits depends only on the present state of the inputs.

BASIC COMPUTER ORGANIZATION AND DESIGN

L4: Sequential Building Blocks (Flip-flops, Latches and Registers)

Systems I: Computer Organization and Architecture

COMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012

Process / Operation Symbols

Computer Science 217

Sharp EL-733A Tutorial

CSCI 4717 Computer Architecture. Function. Data Storage. Data Processing. Data movement to a peripheral. Data Movement

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, The Binary Adder

Comp 255Q - 1M: Computer Organization Lab #3 - Machine Language Programs for the PDP-8

Lecture #21 April 2, 2004 Relays and Adder/Subtractors

The 104 Duke_ACC Machine

Machines with Memory

2 : BISTABLES. In this Chapter, you will find out about bistables which are the fundamental building blocks of electronic counting circuits.

Programming Logic controllers

Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill

Solutions. Solution The values of the signals are as follows:

TIMING DIAGRAM O 8085

Chapter 2 Basic Structure of Computers. Jin-Fu Li Department of Electrical Engineering National Central University Jungli, Taiwan

Two's Complement Adder/Subtractor Lab L03

Parts of a Computer. Preparation. Objectives. Standards. Materials Micron Technology Foundation, Inc. All Rights Reserved

Counters. Present State Next State A B A B

Levels of Programming Languages. Gerald Penn CSC 324

PROBLEMS (Cap. 4 - Istruzioni macchina)

Sequential Logic. (Materials taken from: Principles of Computer Hardware by Alan Clements )

Lab Experience 17. Programming Language Translation

The components. E3: Digital electronics. Goals:

OVERVIEW Playbacks: Shortcuts: Memories: Data Entry Wheels: Touchpad: Master and Blackout:

what operations can it perform? how does it perform them? on what kind of data? where are instructions and data stored?

A3 Computer Architecture

Digital Logic Design Sequential circuits

Combinational Logic Design

Central Processing Unit (CPU)

PIC Programming in Assembly. (

Memory Systems. Static Random Access Memory (SRAM) Cell

ENEE 244 (01**). Spring Homework 5. Due back in class on Friday, April 28.

8-Bit Flash Microcontroller for Smart Cards. AT89SCXXXXA Summary. Features. Description. Complete datasheet available under NDA

Idle Data Analysis & Charts for the Draft 3 ENERGY STAR Computer Server Specification 10/31//08

The enable pin needs to be high for data to be fed to the outputs Q and Q bar.

Administrative Issues

Computer Literacy. Hardware & Software Classification

40 Watt Mixer Amplifier Owners Manual with Media Player

Transcription:

uestions uestion 4. : (Solution, p 4) raw two truth tales illustrating the outputs of a half-adder, one tale for the output and the other for the output. uestion 4. 2: (Solution, p 4) Fill in the truth tale at right for the following circuit. Ignore rows not included in the tale. a c half adder carry sum half adder carry sum x y uestion 4. 3: (Solution, p 4) What distinguishes the meanings of a half adder s inputs and outputs from a full-adder s? uestion 4. 4: (Solution, p 4) Using only four-it adders, construct an eight-it adder. Each four-it adder has two four-it inputs and one five-it output. Your eight-it adder should have two eight-it inputs and a one eight-it output (don t worry aotu the ninth output it). uestion 4.2 : (Solution, p 4) How is a flip-flop s ehavior different from a latch s ehavior? uestion 4.2 2: (Solution, p 4) The elow circuit at left includes two flip-flops. Recall that a flipflop s stored state remains unchanged as long as =. At the instant that switches to, its stored it switches to, and it retains this value until changes to again. c o a Say a user enters the sequence of inputs given in the tale at right, one after the other. Lael what the output of the circuit will settle into after each of the user s inputs.??????? uestion 4.2 3: (Solution, p 4) Suppose the upper flip-flop in the elow circuit were holding and the lower flip-flop held, while the input were. Then someody toggles the input five times (to, then, then, then, then ). Complete the tale to show how the output values would change.

uestions 2 x uestion 5. : (Solution, p 5) efine the fetch-execute cycle as it relates to a computer processing a program. Your definition should descrie the primary purpose of each phase. uestion 5. 2: (Solution, p 5) Explain in detail what HYMN does during the fetch phase of the fetchexecute cycle. uestion 5. 3: (Solution, p 5) Translate each of the following HYMN instructions into machine code. Express your answers in inary. a. HALT. A 4 c. LOA 2 d. JUMP 3 uestion 5. 4: (Solution, p 5) Suppose our computer starts with the following in memory. LOA A SUB STORE HALT HALT a. Show the hexadecimal values taken on y the registers as this program executes. (Stop once the computer executes a HALT instruction.) IR PC AC. What memory locations, if any, change? What values are stored in these locations? uestion 5.2 : (Solution, p 5) Suppose we were to start the computer with the following in memory. LOA STORE A STORE A STORE HALT

uestions 3 If the user typed multiples of 25 starting at 25 (25, then 5, then 75,... ) when prompted, what would the computer display? uestion 5.2 2: (Solution, p 5) Suppose we were to start the computer with the following in memory. If we repeatedly type the numer 32 computer halts? LOA A JPOS HALT when prompted, how many times would we type it efore the uestion 5.2 3: (Solution, p 5) What should we place into the computer s memory so that, when started, the computer displays the powers of two from to 64 efore halting?

Solutions 4 Solution 4. : (uestion, p ) Solution 4. 2: (uestion, p ) Solution 4. 3: (uestion, p ) A half adder has two inputs and outputs the sum of these two its, while a full adder has three inputs and outputs the sum of these three its. Solution 4. 4: (uestion, p ) The design of this circuit is similar in structure to the design of a full adder using half adders. a -3-3 a 4-7 4-7 4-it adder 4-it adder 4-it adder out -3 out 4-7 Solution 4.2 : (uestion, p ) In a flip-flop, the memory value changes only at that instant that the input ecomes. In a latch, however, the memory value continues adopting any values given as long as its input is. (In a flip-flop, if the input changes while remains, the rememered value doesn t change. In a latch, however, the input changing while is results in a change to the rememered value.) Solution 4.2 2: (uestion, p ) Solution 4.2 3: (uestion, p )

Solutions 5 Solution 5. : (uestion, p 2) The fetch-execute cycle is the process y which a classical computer executes instructions. In the fetch phase, the computer determines the next instruction to e completed y fetching the instruction from memory. In the execute phase, the computer executes this instruction. Solution 5. 2: (uestion, p 2) It loads from memory from the address contained in the PC, storing the data found there into the IR. Solution 5. 3: (uestion, p 2) a.. c. d. Solution 5. 4: (uestion, p 2) a. IR 84 C5 E4 A5 PC 2 3 4 AC 5 B 6. Memory location changes to hold 6 Solution 5.2 : (uestion, p 2).? 25 25? 5 75? 75-6 (This last output is somewhat tricky: In the last A instruction, the CPU computes, ut this exceeds the maximum eight-it two s-complement numer. So the computer wraps around ends up at.) Solution 5.2 2: (uestion, p 3) It would read from the user four times efore halting (with the AC progressing from to to to ). Solution 5.2 3: (uestion, p 3) Here is one possile solution. (Of course there are others.) LOA STOR STOR A JPOS HALT