# Computer Organization and Levels of Abstraction

Size: px
Start display at page:

Download "Computer Organization and Levels of Abstraction"

Transcription

1 Computer Organization and Levels of Abstraction

2 Announcements PS8 Due today PS9 Due July 22 Sound Lab tonight bring machines and headphones! Binary Search

3 Today Review of binary floating point notation Boolean logic review Combinational Circuits Levels of Abstraction

4 Floating point +/- Exponent Mantissa 1 bit 8 bits 23 bits Sign is a 0 or 1 Exponent is an binary integer Mantissa is a binary fraction

5 Floating point x /- Exponent Mantissa 1 bit 8 bits 23 bits Sign is a 0 or 1 Exponent is an binary integer Mantissa is a binary fraction

6 Floating point Sign x /- Exponent Mantissa 1 bit 8 bits 23 bits Sign is a 0 or 1

7 Exponent x Exponent Is an unsigned integer But exponent can be negative how to distinguish? IEEE-754 specifies a bias: 127 This gives us a range of -126 to +127 Makes comparison easier (for large and small values)

8 Floating point Mantissa x _ /- Exponent Mantissa 1 bit 8 bits 23 bits Pad the mantissa

9 Floating point Mantissa x _ /- Exponent Mantissa 1 bit 8 bits 23 bits Pad the mantissa

10 Floating point Mantissa x

11 11 You should be able to Identify basic gates Describe the behavior of a gate or circuit using Boolean expressions, truth tables, and logic diagrams Transform one Boolean expression into another given the laws of Boolean algebra

12 12 Conceptualizing bits and circuits ON or 1: true OFF or 0: false circuit behavior: expressed in Boolean logic or Boolean algebra

13 13 Boolean Logic (Algebra) Computer circuitry works based on Boolean Logic (Boolean Algebra) : operations on True (1) and False (0) values. A B A Λ B (A AND B) (conjunction) A Λ B (A OR B) (disjunction) A A (NOT A) (negation) A and B in the table are Boolean variables, AND and OR are operations (also called functions).

14 14 Boolean Logic & Truth Tables Example: You can think of A B below as is fun and is useful where A stands for the statement is fun, B stands for the statement is useful. A B A Λ B (A AND B) (conjunction) A Λ B (A OR B) (disjunction) A A (NOT A) (negation)

15 15 Logic Gates A gate is a physical device that implements a Boolean operator by performing basic operations on electrical signals. Nowadays, gates are built from transistors. Physical behavior of circuits is beyond the scope of our course. A B A B AND A B A B OR A NOT

16 16 Combinational Circuits The logic states of inputs at any given time determine the state of the outputs. AND OR AND A B B C AND C B OR (B C) (C B) What is Q? (A B) ((B C) (C B))

17 17 Truth Table of a Circuit AND OR OR AND AND Q = (A B) ((B C) (C B)) A B C Q How do I know that there should be 8 rows in the truth table? Describes the relationship between inputs and outputs of a device

18 18 Truth Table of a Circuit AND OR OR AND AND Q = (A B) ((B C) (C B)) A B C Q Describes the relationship between inputs and outputs of a device

19 19 Describing Behavior of Circuits Boolean expressions Circuit diagrams Equivalent notations Truth tables

20 20 Why manipulate circuits? The design process simplify a complex design for easier manufacturing, faster or cooler operation, Boolean algebra helps us find another design guaranteed to have same behavior

21 Logical Equivalence Q = (A B) ((B C) (C B)) OR AND OR AND AND AND OR Q = B (A C) A B C Q This smaller circuit is logically equivalent to the one above: they have the same truth table. By using laws of Boolean Algebra we convert a circuit to another equivalent circuit. 21

22 22 Laws for the Logical Operators and (Similar to and +) Commutative: A B = B A A B = B A Associative: A B C = (A B) C = A (B C) A B C = (A B) C = A (B C) Distributive: A (B B) = (A B) (A C) A (B C) = (A B) (A C) Identity: A 1 = A A 0 = A Dominance: A 0 = 0 A 1 = 1 Idempotence: A A = A A A = A Complementation: A A = 0 A A = 1 Double Negation: A = A

23 Laws for the Logical Operators and (Similar to and +) Commutative: A B = B A A B = B A Associative: A B C = (A B) C = A (B C) A B C = (A B) C = A (B C) Distributive: A (B C) = (A B) (A C) A (B C) = (A B) (A C) Not true for + and Identity: A 1 = A A 0 = A The A s and B s here are schema7c variables! You can instan7ate them with any expression that has a Boolean value: (x y) z = z (x y) (by commuta7vity) A B = B A

24 Applying Properties for and Showing (x y) ((y z) (z y)) = y (x or z) Commuta7vity A B = B A (x y) ((z y) (y z)) Distribu7vity A (B C) = (A B) (A C) (x y) (z y y) (z y z) Associa7vity, Commuta7vity, Idempotence (x y) ((z y) (y z)) Commuta7vity, idempotence A A = A ( y x) (y z) Distribu7vity (backwards) (A B) (A C) = A (B C) y (x z) Conclusion: (x y) ((y z) (z y)) = y (x z)

25 25 Extending the system more gates and DeMorgan s laws

26 26 More gates (NAND, NOR, XOR) A B A nand B A nor B A xor B nand ( not and ): A nand B = not (A and B) A B (A B) nor ( not or ): A nor B = not (A or B) xor ( exclusive or ): A xor B = (A and not B) or (B and not A) A B A B (A B) A B

27 A curious fact Func7onal Completeness of NAND and NOR Any logical circuit can be implemented using NAND gates only Same applies to NOR

28 28 DeMorgan s Law Nand: (A B) = A B Nor: (A B) = A B

29 29 DeMorgan s Law Nand: (A B) = A B if not (x > 15 and x < 110):... is logically equivalent to if (not x > 15) or (not x < 110):... Nor: (A B) = A B if not (x < 15 or x > 110):... is logically equivalent to if (not x < 15) and (not x > 110):...

30 30 A circuit for parity checking Boolean expressions and circuits

31 31 A Boolean expression that checks parity 3-bit odd parity checker F: an expression that should be true when the count of 1 bits is odd: when 1 or 3 of the bits are 1s. P = ( A B C) ( A B C) (A B C) (A B C) A B C P There are specific methods for obtaining canonical Boolean expressions from a truth table, such as writing it as a disjunction of conjunctions or as a conjunction of disjunctions. See the bonus slide at the end. Note we have four subexpressions above each of them corresponding to exactly one row of the truth table where P is 1.

32 32 The circuit 3-bit odd parity checker P = ( A B C) ( A B C) (A B C) (A B C) A B C P A B P = (A B) C C P

33 Using Minterms to Construct a Boolean Func7on from a Truth Table (bonus slide) As presented by Alvarado et. al. in CS for All: 1. Write down the truth table for the Boolean func7on that you are considering 2. Delete all the rows from the truth table where the value of the func7on is 0 3. For each remaining row create a minterm as follows: a. For each variable that has a 1 in that row write the name of the variable. If the input variable is 0 in that row, write the variable with a nega7on symbol. b. Take their conjunc7on (AND them together) 4. Combine all of the minterms using OR (take their disjunc7on)

34 34 Adding Binary Numbers A: B: Adding two 1-bit numbers without taking the carry into account A B Sum Sum = A B How can we handle the carry?

35 35 Adding Binary Numbers A: B: A B Sum Carry Half Adder: adds two single digits

36 A Full Adder C out C in A B S A B C in C out S

37 A Full Adder C out C in A B S A B C in C out S S = A B C in C out = ((A B) C in ) (A B)

38 A Full Adder C in A B C in C out S A B S: 1 when there is an odd number of bits that are 1 C out S C out : 1 if both A and B are 1 or, one of the bits and the carry in are 1. S = A B C in C out = ((A B) C in ) (A B)

39 Full Adder (FA) S = A B C in C out = ((A B) C in ) (A B) A B C out 1-bit Full Adder S C in More abstract representation of the above circuit. Hides details of the circuit above.

40 8-bit Full Adder A 7 B 7 A 2 B 2 A 1 B 1 A 0 B 0 C out 1-bit Full Adder... 1-bit Full Adder 1-bit Full Adder 1-bit Full Adder C in S 7 S 2 A B S 1 S C out 8-bit FA 8 S C in More abstract representation of the above circuit. Hides details of the circuit above.

41 Control Circuits In addition to circuits for basic logical and arithmetic operations, there are also circuits that determine the order in which operations are carried out and to select the correct data values to be processed.

42 42 Multiplexer (MUX) A multiplexer chooses one of its inputs. 2 n input lines, n selector lines, and 1 output line A B F D 1 D 2 D 3 D 4 MUX F 0 0 D D D D 4 A B hides details of the circuit on the left

43 Arithmetic Logic Unit (ALU) OP 1 OP 0 Carry In & OP OP 0 OP 1 F 0 0 A B 0 1 A B 1 0 A 1 1 A + B Depending on the OP code Mux chooses the result of one of the functions (and, or, identity, addition) 43

44 44 Building A Complete Computer from Parts

45 Computing Machines An instruction is a single arithmetic or logical operation. A program is a sequence of instructions that causes the desired function to be calculated. A computing system is a combination of program and machine (computer). How can we build a computing system that calculates the desired function specified by a program?

46 Stored Program Computer A stored program computer is electronic hardware that implements an instruction set. 46

47 47 Von Neumann Architecture Big idea: Data and instructions to manipulate the data are both bit sequences Modern computers built according to the Von Neumann Architecture includes separate units To process information (CPU): reads and executes instructions of a program in the order prescribed by the program To store information (memory)

48 48 Stored Program Computer adder, multiplier, multiplexor, etc. small amount of memory in the CPU

49 49 Central Processing Unit (CPU) A CPU contains: Arithmetic Logic Unit to perform computation Registers to hold information Instruction register (current instruction being executed) Program counter (to hold location of next instruction in memory) Accumulator (to hold computation result from ALU) Data register(s) (to hold other important data for future use) Control unit to regulate flow of information and operations that are performed at each instruction step

50 50 Memory The simplest unit of storage is a bit (1 or 0). Bits are grouped into bytes (8 bits). Memory is a collection of cells each with a unique physical address. We use the generic term cell rather than byte or word because the number of bits in each addressable location varies from machine one machine to another. A machine that can generate, for example, 32-bit addresses, can utilize a memory that contains up to 2 32 memory cells.

51 51 Memory Layout Address 100: 104: 108: 112: 116: Content Address : : : : : Content We saw this picture in Unit 6. It hid the bit representation for readability. Assumes that memory is byte addressable and each integer occupies 4 bytes. In this picture and in reality, addresses and memory contents are sequences of bits.

52 Stored Program Computer instruction fetch, decode, execute adder, multiplier, multiplexor, Etc. program counter, instruction register, Etc. Two specialized registers: the instruction register holds the current instruction to be executed and the program counter contains the address of the next instruction to be executed.

53 53 Processing Instructions Both data and instructions are stored in memory as bit patterns Instructions stored in contiguous memory locations Data stored in a different part of memory The address of the first instruction is loaded into the program counter and and the processing cycle starts.

54 54 Fetch-Decode-Execute Cycle Modern computers include control logic that implements the fetch-decode-execute cycle introduced by John von Neumann: Fetch next instruction from memory into the instruction register. Decode instruction to a control signal and get any data it needs (possibly from memory). Execute instruction with data in ALU and store results (possibly into memory). Repeat. Note that all of these steps are implemented with circuits of the kind we have seen in this unit.

55 Power of abstraction

56 56 Using Abstraction in Computer Design We can use layers of abstraction to hide details of the computer design. We can work in any layer, not needing to know how the lower layers work or how the current layer fits into the larger system. Low High transistors gates circuits (adders, multiplexors ) central processing units (ALU, registers ) computer A component at a higher abstraction layer uses components from a lower abstraction layer without having to know the details of how it is built. It only needs to know what it does.

57 57 Abstraction in Programming The set of all operations that can be executed by a processor is called its instruction set. Instructions are built into hardware: electronics of the CPU recognize binary representations of the specific instructions. That means each CPU has its own machine language that it understands. But we can write programs without thinking about on what machine our program will run. This is because we can write programs in high-level languages that are abstractions of machine level instructions.

58 A High-Level Program # This programs displays Hello, World! print( Hello world! )

59 A Low-Level Program

60 60 Obtaining Machine Language Instructions Programs are typically written in higher-level languages and then translated into machine language (executable code). A compiler is a program that translates code written in one language into another language. An interpreter translates the instructions one line at a time into something that can be executed by the computer s hardware.

61 Summary A computing system is a combination of program and machine (computer). In this lecture, we focused on how a machine can be designed using levels of abstraction: gates à circuits for elementary operations à basic processing units à computer

### Computer Organization and Levels of Abstraction

Computer Organization and Levels of Abstraction Announcements Today: PS 7 Lab 8: Sound Lab tonight bring machines and headphones! PA 7 Tomorrow: Lab 9 Friday: PS8 Today (Short) Floating point review Boolean

### LECTURE 4. Logic Design

LECTURE 4 Logic Design LOGIC DESIGN The language of the machine is binary that is, sequences of 1 s and 0 s. But why? At the hardware level, computers are streams of signals. These signals only have two

### Software and Hardware

Software and Hardware Numbers At the most fundamental level, a computer manipulates electricity according to specific rules To make those rules produce something useful, we need to associate the electrical

### Lecture 10: Floating Point, Digital Design

Lecture 10: Floating Point, Digital Design Today s topics: FP arithmetic Intro to Boolean functions 1 Examples Final representation: (-1) S x (1 + Fraction) x 2 (Exponent Bias) Represent -0.75 ten in single

### Propositional Calculus. Math Foundations of Computer Science

Propositional Calculus Math Foundations of Computer Science Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they can use it to

### Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates. Invitation to Computer Science, C++ Version, Third Edition

Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Third Edition Objectives In this chapter, you will learn about: The binary numbering

### Midterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil

Midterm Exam Review CS 2420 :: Fall 2016 Molly O'Neil Midterm Exam Thursday, October 20 In class, pencil & paper exam Closed book, closed notes, no cell phones or calculators, clean desk 20% of your final

### Lecture 10: Floating Point, Digital Design

Lecture 10: Floating Point, Digital Design Today s topics: FP arithmetic Intro to Boolean functions 1 Examples Final representation: (-1) S x (1 + Fraction) x 2 (Exponent Bias) Represent -0.75 ten in single

### Von Neumann Architecture

Von Neumann Architecture Assist lecturer Donya A. Khalid Lecture 2 2/29/27 Computer Organization Introduction In 945, just after the World War, Jon Von Neumann proposed to build a more flexible computer.

### Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions

### Propositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus

### Experimental Methods I

Experimental Methods I Computing: Data types and binary representation M.P. Vaughan Learning objectives Understanding data types for digital computers binary representation of different data types: Integers

### QUESTION BANK FOR TEST

CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice

### ECE 2030B 1:00pm Computer Engineering Spring problems, 5 pages Exam Two 10 March 2010

Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate

### Introduction to Computer Science. Homework 1

Introduction to Computer Science Homework. In each circuit below, the rectangles represent the same type of gate. Based on the input and output information given, identify whether the gate involved is

### COMP combinational logic 1 Jan. 18, 2016

In lectures 1 and 2, we looked at representations of numbers. For the case of integers, we saw that we could perform addition of two numbers using a binary representation and using the same algorithm that

### Introduction to Boole algebra. Binary algebra

Introduction to Boole algebra Binary algebra Boole algebra George Boole s book released in 1847 We have only two digits: true and false We have NOT, AND, OR, XOR etc operations We have axioms and theorems

### 4 Operations On Data 4.1. Foundations of Computer Science Cengage Learning

4 Operations On Data 4.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: List the three categories of operations performed on data.

### CS101 Lecture 25: The Machinery of Computation: Computer Architecture. John Magee 29 July 2013 Some material copyright Jones and Bartlett

CS101 Lecture 25: The Machinery of Computation: Computer Architecture John Magee 29 July 2013 Some material copyright Jones and Bartlett 1 Overview/Questions What did we do last time? Can we relate this

### ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012

Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate

### Computer Organization and Programming

Sep 2006 Prof. Antônio Augusto Fröhlich (http://www.lisha.ufsc.br) 8 Computer Organization and Programming Prof. Dr. Antônio Augusto Fröhlich guto@lisha.ufsc.br http://www.lisha.ufsc.br/~guto Sep 2006

Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order

### Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Logic Design First Stage Lecture No.5 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Boolean Operations Laws of Boolean Algebra Rules of Boolean Algebra

### Chapter 3. Boolean Algebra and Digital Logic

Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how

### Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic

Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic Question 1: Due October 19 th, 2009 A convenient shorthand for specifying

### 2. BOOLEAN ALGEBRA 2.1 INTRODUCTION

2. BOOLEAN ALGEBRA 2.1 INTRODUCTION In the previous chapter, we introduced binary numbers and binary arithmetic. As you saw in binary arithmetic and in the handling of floating-point numbers, there is

### 6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( )

6. Combinational Circuits George Boole (85 864) Claude Shannon (96 2) Signals and Wires Digital signals Binary (or logical ) values: or, on or off, high or low voltage Wires. Propagate digital signals

### Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012

Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012 1 Digital vs Analog Digital signals are binary; analog

### 4 Operations On Data 4.1. Foundations of Computer Science Cengage Learning

4 Operations On Data 4.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: List the three categories of operations performed on data.

### CS 31: Intro to Systems Digital Logic. Kevin Webb Swarthmore College February 3, 2015

CS 31: Intro to Systems Digital Logic Kevin Webb Swarthmore College February 3, 2015 Reading Quiz Today Hardware basics Machine memory models Digital signals Logic gates Circuits: Borrow some paper if

### CS 31: Intro to Systems Digital Logic. Kevin Webb Swarthmore College February 2, 2016

CS 31: Intro to Systems Digital Logic Kevin Webb Swarthmore College February 2, 2016 Reading Quiz Today Hardware basics Machine memory models Digital signals Logic gates Circuits: Borrow some paper if

### Binary Values. CSE 410 Lecture 02

Binary Values CSE 410 Lecture 02 Lecture Outline Binary Decimal, Binary, and Hexadecimal Integers Why Place Value Representation Boolean Algebra 2 First: Why Binary? Electronic implementation Easy to store

### LAB #1 BASIC DIGITAL CIRCUIT

LAB #1 BASIC DIGITAL CIRCUIT OBJECTIVES 1. To study the operation of basic logic gates. 2. To build a logic circuit from Boolean expressions. 3. To introduce some basic concepts and laboratory techniques

### Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Logic Design First Stage Lecture No.6 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Outlines Boolean Operations Laws of Boolean Algebra Rules of

### CS 261 Fall Mike Lam, Professor. Combinational Circuits

CS 261 Fall 2017 Mike Lam, Professor Combinational Circuits The final frontier Java programs running on Java VM C programs compiled on Linux Assembly / machine code on CPU + memory??? Switches and electric

### Logic, Words, and Integers

Computer Science 52 Logic, Words, and Integers 1 Words and Data The basic unit of information in a computer is the bit; it is simply a quantity that takes one of two values, 0 or 1. A sequence of k bits

### CS/COE 0447 Example Problems for Exam 2 Spring 2011

CS/COE 0447 Example Problems for Exam 2 Spring 2011 1) Show the steps to multiply the 4-bit numbers 3 and 5 with the fast shift-add multipler. Use the table below. List the multiplicand (M) and product

### Bits, Words, and Integers

Computer Science 52 Bits, Words, and Integers Spring Semester, 2017 In this document, we look at how bits are organized into meaningful data. In particular, we will see the details of how integers are

### Topics. Computer Organization CS Exam 2 Review. Infix Notation. Reverse Polish Notation (RPN)

Computer Organization CS 231-01 Exam 2 Review Dr. William H. Robinson October 11, 2004 http://eecs.vanderbilt.edu/courses/cs231/ Topics Education is a progressive discovery of our own ignorance. Will Durant

### Arab Open University. Computer Organization and Architecture - T103

Arab Open University Computer Organization and Architecture - T103 Reference Book: Linda Null, Julia Lobur, The essentials of Computer Organization and Architecture, Jones & Bartlett, Third Edition, 2012.

### ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two Solutions 26 February 2014

Problem 1 (4 parts, 21 points) Encoders and Pass Gates Part A (8 points) Suppose the circuit below has the following input priority: I 1 > I 3 > I 0 > I 2. Complete the truth table by filling in the input

### Combinational Circuits

Combinational Circuits Q. What is a combinational circuit? A. Digital: signals are or. A. No feedback: no loops. analog circuits: signals vary continuously sequential circuits: loops allowed (stay tuned)

### 1. Mark the correct statement(s)

1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another

### 6. Combinational Circuits. Building Blocks. Digital Circuits. Wires. Q. What is a digital system? A. Digital: signals are 0 or 1.

Digital Circuits 6 Combinational Circuits Q What is a digital system? A Digital: signals are or analog: signals vary continuously Q Why digital systems? A Accurate, reliable, fast, cheap Basic abstractions

### Dec Hex Bin ORG ; ZERO. Introduction To Computing

Dec Hex Bin 0 0 00000000 ORG ; ZERO Introduction To Computing OBJECTIVES this chapter enables the student to: Convert any number from base 2, base 10, or base 16 to any of the other two bases. Add and

### Chapter 4. Operations on Data

Chapter 4 Operations on Data 1 OBJECTIVES After reading this chapter, the reader should be able to: List the three categories of operations performed on data. Perform unary and binary logic operations

### COMPUTER ARCHITECTURE AND ORGANIZATION Register Transfer and Micro-operations 1. Introduction A digital system is an interconnection of digital

Register Transfer and Micro-operations 1. Introduction A digital system is an interconnection of digital hardware modules that accomplish a specific information-processing task. Digital systems vary in

### Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 3 Additional Gates and Circuits

Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hyperlinks are active in View

### Injntu.com Injntu.com Injntu.com R16

1. a) What are the three methods of obtaining the 2 s complement of a given binary (3M) number? b) What do you mean by K-map? Name it advantages and disadvantages. (3M) c) Distinguish between a half-adder

### CS 24: INTRODUCTION TO. Spring 2015 Lecture 2 COMPUTING SYSTEMS

CS 24: INTRODUCTION TO Spring 2015 Lecture 2 COMPUTING SYSTEMS LAST TIME! Began exploring the concepts behind a simple programmable computer! Construct the computer using Boolean values (a.k.a. bits )

CS6303 COMPUTER ARCHITECTURE LESSION NOTES UNIT II ARITHMETIC OPERATIONS ALU In computing an arithmetic logic unit (ALU) is a digital circuit that performs arithmetic and logical operations. The ALU is

### Digital Logic Design Exercises. Assignment 1

Assignment 1 For Exercises 1-5, match the following numbers with their definition A Number Natural number C Integer number D Negative number E Rational number 1 A unit of an abstract mathematical system

### Boolean Logic CS.352.F12

Boolean Logic CS.352.F12 Boolean Algebra Boolean Algebra Mathematical system used to manipulate logic equations. Boolean: deals with binary values (True/False, yes/no, on/off, 1/0) Algebra: set of operations

### Lecture 10: Combinational Circuits

Computer Architecture Lecture : Combinational Circuits Previous two lectures.! TOY machine. Net two lectures.! Digital circuits. George Boole (85 864) Claude Shannon (96 2) Culminating lecture.! Putting

### Computer Organisation CS303

Computer Organisation CS303 Module Period Assignments 1 Day 1 to Day 6 1. Write a program to evaluate the arithmetic statement: X=(A-B + C * (D * E-F))/G + H*K a. Using a general register computer with

### 6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( )

6. Combinational Circuits George Boole (85 864) Claude Shannon (96 2) Digital signals Binary (or logical ) values: or, on or off, high or low voltage Wires. Propagate logical values from place to place.

### END-TERM EXAMINATION

(Please Write your Exam Roll No. immediately) END-TERM EXAMINATION DECEMBER 2006 Exam. Roll No... Exam Series code: 100919DEC06200963 Paper Code: MCA-103 Subject: Digital Electronics Time: 3 Hours Maximum

### CS February 17

Discrete Mathematics CS 26 February 7 Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x n,..x n ) B, F (x,..x n ) = G (x,..x n ) Example: F(x,y,z) = x(y+z), G(x,y,z)

### Parallel logic circuits

Computer Mathematics Week 9 Parallel logic circuits College of Information cience and Engineering Ritsumeikan University last week the mathematics of logic circuits the foundation of all digital design

### ECE 341 Midterm Exam

ECE 341 Midterm Exam Time allowed: 75 minutes Total Points: 75 Points Scored: Name: Problem No. 1 (8 points) For each of the following statements, indicate whether the statement is TRUE or FALSE: (a) A

### The type of all data used in a C (or C++) program must be specified

The type of all data used in a C (or C++) program must be specified A data type is a description of the data being represented That is, a set of possible values and a set of operations on those values

### CS8803: Advanced Digital Design for Embedded Hardware

CS883: Advanced Digital Design for Embedded Hardware Lecture 2: Boolean Algebra, Gate Network, and Combinational Blocks Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883

### The von Neumann Architecture. IT 3123 Hardware and Software Concepts. The Instruction Cycle. Registers. LMC Executes a Store.

IT 3123 Hardware and Software Concepts February 11 and Memory II Copyright 2005 by Bob Brown The von Neumann Architecture 00 01 02 03 PC IR Control Unit Command Memory ALU 96 97 98 99 Notice: This session

### Introduction to Computers and Programming. Numeric Values

Introduction to Computers and Programming Prof. I. K. Lundqvist Lecture 5 Reading: B pp. 47-71 Sept 1 003 Numeric Values Storing the value of 5 10 using ASCII: 00110010 00110101 Binary notation: 00000000

### Review. EECS Components and Design Techniques for Digital Systems. Lec 05 Boolean Logic 9/4-04. Seq. Circuit Behavior. Outline.

Review EECS 150 - Components and Design Techniques for Digital Systems Lec 05 Boolean Logic 94-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley Design flow

### UC Berkeley College of Engineering, EECS Department CS61C: Combinational Logic Blocks

2 Wawrzynek, Garcia 2004 c UCB UC Berkeley College of Engineering, EECS Department CS61C: Combinational Logic Blocks 1 Introduction Original document by J. Wawrzynek (2003-11-15) Revised by Chris Sears

### UC Berkeley College of Engineering, EECS Department CS61C: Combinational Logic Blocks

UC Berkeley College of Engineering, EECS Department CS61C: Combinational Logic Blocks Original document by J. Wawrzynek (2003-11-15) Revised by Chris Sears and Dan Garcia (2004-04-26) 1 Introduction Last

### Data Representation Type of Data Representation Integers Bits Unsigned 2 s Comp Excess 7 Excess 8

Data Representation At its most basic level, all digital information must reduce to 0s and 1s, which can be discussed as binary, octal, or hex data. There s no practical limit on how it can be interpreted

### ECE 550D Fundamentals of Computer Systems and Engineering. Fall 2017

ECE 550D Fundamentals of Computer Systems and Engineering Fall 2017 Combinational Logic Prof. John Board Duke University Slides are derived from work by Profs. Tyler Bletsch and Andrew Hilton (Duke) Last

### MACHINE LEVEL REPRESENTATION OF DATA

MACHINE LEVEL REPRESENTATION OF DATA CHAPTER 2 1 Objectives Understand how integers and fractional numbers are represented in binary Explore the relationship between decimal number system and number systems

### Lecture Topics. Announcements. Today: Integer Arithmetic (P&H ) Next: continued. Consulting hours. Introduction to Sim. Milestone #1 (due 1/26)

Lecture Topics Today: Integer Arithmetic (P&H 3.1-3.4) Next: continued 1 Announcements Consulting hours Introduction to Sim Milestone #1 (due 1/26) 2 1 Overview: Integer Operations Internal representation

### 211: Computer Architecture Summer 2016

211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Direct - Mapping - Fully Associated - 2-way Associated - Cache Friendly Code Rutgers University Liu

### Gate Level Minimization Map Method

Gate Level Minimization Map Method Complexity of hardware implementation is directly related to the complexity of the algebraic expression Truth table representation of a function is unique Algebraically

### KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT

KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT COE 202: Digital Logic Design Term 162 (Spring 2017) Instructor: Dr. Abdulaziz Barnawi Class time: U.T.R.: 11:00-11:50AM Class

Get Free notes at Module-I One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)

### Inf2C - Computer Systems Lecture 2 Data Representation

Inf2C - Computer Systems Lecture 2 Data Representation Boris Grot School of Informatics University of Edinburgh Last lecture Moore s law Types of computer systems Computer components Computer system stack

### Objectives: 1- Bolean Algebra. Eng. Ayman Metwali

Objectives: Chapter 3 : 1- Boolean Algebra Boolean Expressions Boolean Identities Simplification of Boolean Expressions Complements Representing Boolean Functions 2- Logic gates 3- Digital Components 4-

### ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two 26 February 2014

Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate

### Propositional Calculus. Math Foundations of Computer Science

Propositional Calculus Math Foundations of Computer Science Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they can use it to

### Computer Systems. Binary Representation. Binary Representation. Logical Computation: Boolean Algebra

Binary Representation Computer Systems Information is represented as a sequence of binary digits: Bits What the actual bits represent depends on the context: Seminar 3 Numerical value (integer, floating

### DIGITAL SYSTEM DESIGN

DIGITAL SYSTEM DESIGN UNIT I: Introduction to Number Systems and Boolean Algebra Digital and Analog Basic Concepts, Some history of Digital Systems-Introduction to number systems, Binary numbers, Number

### 01 Introduction to Digital Logic. ENGR 3410 Computer Architecture Mark L. Chang Fall 2008

Introduction to Digital Logic ENGR 34 Computer Architecture Mark L. Chang Fall 28 Acknowledgements Patterson & Hennessy: Book & Lecture Notes Patterson s 997 course notes (U.C. Berkeley CS 52, 997) Tom

### Lecture (05) Boolean Algebra and Logic Gates

Lecture (05) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Minterms and Maxterms consider two binary variables x and y combined with an AND operation. Since eachv ariable may appear in either

### UNIT - V MEMORY P.VIDYA SAGAR ( ASSOCIATE PROFESSOR) Department of Electronics and Communication Engineering, VBIT

UNIT - V MEMORY P.VIDYA SAGAR ( ASSOCIATE PROFESSOR) contents Memory: Introduction, Random-Access memory, Memory decoding, ROM, Programmable Logic Array, Programmable Array Logic, Sequential programmable

### OCR H446 A-Level Computer Science

Name: Class Teacher: Date: OCR H446 A-Level Computer Science REVISION BOOKLET 1.4 DATA TYPES, DATA STRUCTURES AND ALGORITHMS Content in H446 A-Level Computer Science: 1.1 The characteristics of contemporary

### IT 201 Digital System Design Module II Notes

IT 201 Digital System Design Module II Notes BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.

### Logic Design: Part 2

Orange Coast College Business Division Computer Science Department CS 6- Computer Architecture Logic Design: Part 2 Where are we? Number systems Decimal Binary (and related Octal and Hexadecimal) Binary

### 6: Combinational Circuits

Computer Architecture 6: Combinational Circuits Previous two lectures. von Neumann machine. This lectures. Boolean circuits. Later in the course. Putting it all together and building a TOY machine. George

### Register Transfer and Micro-operations

Register Transfer Language Register Transfer Bus Memory Transfer Micro-operations Some Application of Logic Micro Operations Register Transfer and Micro-operations Learning Objectives After reading this

### CS 261 Fall Mike Lam, Professor. Logic Gates

CS 261 Fall 2016 Mike Lam, Professor Logic Gates The final frontier Java programs running on Java VM C programs compiled on Linux Assembly / machine code on CPU + memory??? Switches and electric signals

### BUILDING BLOCKS OF A BASIC MICROPROCESSOR. Part 1 PowerPoint Format of Lecture 3 of Book

BUILDING BLOCKS OF A BASIC MICROPROCESSOR Part PowerPoint Format of Lecture 3 of Book Decoder Tri-state device Full adder, full subtractor Arithmetic Logic Unit (ALU) Memories Example showing how to write

### Number Systems and Computer Arithmetic

Number Systems and Computer Arithmetic Counting to four billion two fingers at a time What do all those bits mean now? bits (011011011100010...01) instruction R-format I-format... integer data number text

### Register Transfer Language and Microoperations (Part 2)

Register Transfer Language and Microoperations (Part 2) Adapted by Dr. Adel Ammar Computer Organization 1 MICROOPERATIONS Computer system microoperations are of four types: Register transfer microoperations

### 4. Write a sum-of-products representation of the following circuit. Y = (A + B + C) (A + B + C)

COP 273, Winter 26 Exercises 2 - combinational logic Questions. How many boolean functions can be defined on n input variables? 2. Consider the function: Y = (A B) (A C) B (a) Draw a combinational logic

### Introduction to Boolean logic and Logical Gates

Introduction to Boolean logic and Logical Gates Institute of Statistics Fall 2014 We saw the importance of the binary number system for data representation in a computer system. We ll see that the construction

### Midterm Exam 2B Answer key

Midterm Exam 2B Answer key 15110 Principles of Computing Fall 2015 April 6, 2015 Name: Andrew ID: Lab section: Instructions Answer each question neatly in the space provided. There are 6 questions totaling

### Chap-2 Boolean Algebra

Chap-2 Boolean Algebra Contents: My name Outline: My position, contact Basic information theorem and postulate of Boolean Algebra. or project description Boolean Algebra. Canonical and Standard form. Digital

### Combinational Circuits Digital Logic (Materials taken primarily from:

Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a