Digital Circuits and Systems

Size: px
Start display at page:

Download "Digital Circuits and Systems"

Transcription

1 Spring 2015 Week 1 odule 4 Digital Circuits and Sstems interms, aterms SoP and PoS forms Shankar Balachandran* Associate Professor, CSE Department Indian Institute of Technolog adras *Currentl a Visiting Professor at IIT Bomba

2 Some Definitions A literal is a complemented or uncomplemented boolean variable. Eamples: a and ā are distinct literals. ā+cd is not. A product term is a single literal or a logical product (AND) of two or more literals. Eamples: a, ā, ac, ācd, aaāb are product terms; ā+cd is not a product term. A sum term is a single literal or a logical sum (OR) of two or more literals. Eamples: a, ā, a+c, ā+c+d are sum terms; ā+cd is not a sum term. Digital Logic Fundamentals 2

3 Some Definitions A normal term is a product or sum term in which no variable appears more than once. Eamples: a, ā, a+c, ācd are normal terms; ā+a, āa are not normal terms. A minterm of n variables is a normal product term with n literals. There are 2 n such product terms. Eamples of 3-variable minterms: ābc, abc Eample: āb is not a 3-variable minterm. A materm of n variables is a normal sum term with n literals. There are 2 n such sum terms. Eamples of 3-variable materms: ā+b+c, a+b+c Digital Logic Fundamentals 3

4 Some Definitions A sum of products (SOP) epressions is a set of product (AND) terms connected with logical sum (OR) operators. Eamples: a, ā, ab+c, āc+bde, a+b are SOP epressions. A product of sum (POS) epressions is a set of sum (OR) terms connected with logical product (OR) operators. Eamples: a, ā, a+b+c, (ā+c)(b+d) are POS epressions. Digital Logic Fundamentals 4

5 Some Definitions The canonical sum of products (CSOP) form of an epression refers to rewriting the epression as a sum of minterms. Eamples for 3-variables: ābc + abc is a CSOP epression; āb + c is not. The canonical product of sums (CPOS) form of an epression refers to rewriting the epression as a product of materms. Eamples for 3-variables: (ā+b+c)(a+b+c) is a CPOS epression; (ā+b)c is not. There is a close correspondence between the truth table and minterms and materms. Digital Logic Fundamentals 5

6 Deorgan s Theorem (revisited) X X... X X X... X 1 2 n 1 2 n X X... X X X... X 1 2 n 1 2 n Complement of Sum of Products is equivalent to Product of Complements. Complement of Product of Sums is equivalent to Sum of Complements. Digital Logic Fundamentals 6

7 interms A minterm can be defined as a product term that is 1 in eactl one row of the truth table. n variable minterms are often represented b n- bit binar integers. How to associate minterms with integers? State an ordering on the variables Form a binar number Set bit i of the binar number to 1 if the i th the minterm in an uncomplemented form variable appears in Set bit i to 0 if the variable appears in the complemented form. Digital Logic Fundamentals 7

8 interm Eamples Assume a 3-variable epression, F,, min term 000 min term 011 min term111 m m m m 0 m m 3 7 F,, m 0 m 3 m0 0, 3, 7,m m 3,m 7 7 Digital Logic Fundamentals 8

9 aterms A materm can be defined as a sum term that is 0 in eactl one row of the truth table. n variable materms are also represented b n- bit binar integers. How to associate materms with integers? State an ordering on the variables Form a binar number Set bit i of the binar number to 0 if the i th the materm in an uncomplemented form variable appears in Set bit i to 1 if the variable appears in the materm in the complemented form. Digital Logic Fundamentals 9

10 Digital Logic Fundamentals 10 aterm Eamples Assume a 3-variable epression,,, F ma term ma term ma term ,,,,,, F

11 Summar of interms and aterms Digital Logic Fundamentals 11

12 A Sample Three Variable Function f,, m, m, m, m ,4,5,6 f,,,,, ,2,3,7 Digital Logic Fundamentals 12

13 2 f 3 1 (a) A minimal sum-of-products realiation 1 3 f 2 (b) A minimal product-of-sums realiation

14 End of Week 1: odule 4 Thank You Digital Logic Fundamentals 14

Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra

Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra The Universit Of Alabama in Huntsville Computer Science Chapter 2: Boolean Algebra and Logic Gates The Universit Of Alabama in Huntsville Computer Science Boolean Algebra The algebraic sstem usuall used

More information

Boolean Algebra Part 1

Boolean Algebra Part 1 Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems

More information

CSE140: Midterm 1 Solution and Rubric

CSE140: Midterm 1 Solution and Rubric CSE140: Midterm 1 Solution and Rubric April 23, 2014 1 Short Answers 1.1 True or (6pts) 1. A maxterm must include all input variables (1pt) True 2. A canonical product of sums is a product of minterms

More information

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012 Karnaugh Maps & Combinational Logic Design ECE 52A Winter 22 Reading Assignment Brown and Vranesic 4 Optimized Implementation of Logic Functions 4. Karnaugh Map 4.2 Strategy for Minimization 4.2. Terminology

More information

CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps

CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps CSEE 3827: Fundamentals of Computer Systems Standard Forms and Simplification with Karnaugh Maps Agenda (M&K 2.3-2.5) Standard Forms Product-of-Sums (PoS) Sum-of-Products (SoP) converting between Min-terms

More information

BOOLEAN ALGEBRA & LOGIC GATES

BOOLEAN ALGEBRA & LOGIC GATES BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic

More information

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1 United States Naval Academy Electrical and Computer Engineering Department EC262 Exam 29 September 2. Do a page check now. You should have pages (cover & questions). 2. Read all problems in their entirety.

More information

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Multi-Level Gate Circuits NAND and NOR Gates Design of Two-Level Circuits Using NAND and NOR Gates

More information

CSE140: Components and Design Techniques for Digital Systems

CSE140: Components and Design Techniques for Digital Systems CSE4: Components and Design Techniques for Digital Systems Tajana Simunic Rosing What we covered thus far: Number representations Logic gates Boolean algebra Introduction to CMOS HW#2 due, HW#3 assigned

More information

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation Karnaugh Maps Applications of Boolean logic to circuit design The basic Boolean operations are AND, OR and NOT These operations can be combined to form complex expressions, which can also be directly translated

More information

Logic Reference Guide

Logic Reference Guide Logic eference Guide Advanced Micro evices INTOUCTION Throughout this data book and design guide we have assumed that you have a good working knowledge of logic. Unfortunately, there always comes a time

More information

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

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one

More information

Simplifying Logic Circuits with Karnaugh Maps

Simplifying Logic Circuits with Karnaugh Maps Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified

More information

Polynomials. Jackie Nicholas Jacquie Hargreaves Janet Hunter

Polynomials. Jackie Nicholas Jacquie Hargreaves Janet Hunter Mathematics Learning Centre Polnomials Jackie Nicholas Jacquie Hargreaves Janet Hunter c 26 Universit of Sdne Mathematics Learning Centre, Universit of Sdne 1 1 Polnomials Man of the functions we will

More information

CH3 Boolean Algebra (cont d)

CH3 Boolean Algebra (cont d) CH3 Boolean Algebra (cont d) Lecturer: 吳 安 宇 Date:2005/10/7 ACCESS IC LAB v Today, you ll know: Introduction 1. Guidelines for multiplying out/factoring expressions 2. Exclusive-OR and Equivalence operations

More information

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

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals of Computer Organization and Design. Introduction

More information

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra 2 Ver..4 George Boole was an English mathematician of XIX century can operate on logic (or Boolean) variables that can assume just 2 values: /, true/false, on/off, closed/open Usually value is associated

More information

CHAPTER 7: FACTORING POLYNOMIALS

CHAPTER 7: FACTORING POLYNOMIALS CHAPTER 7: FACTORING POLYNOMIALS FACTOR (noun) An of two or more quantities which form a product when multiplied together. 1 can be rewritten as 3*, where 3 and are FACTORS of 1. FACTOR (verb) - To factor

More information

Logic in Computer Science: Logic Gates

Logic in Computer Science: Logic Gates Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers

More information

Two-level logic using NAND gates

Two-level logic using NAND gates CSE140: Components and Design Techniques for Digital Systems Two and Multilevel logic implementation Tajana Simunic Rosing 1 Two-level logic using NND gates Replace minterm ND gates with NND gates Place

More information

Gates, Circuits, and Boolean Algebra

Gates, Circuits, and Boolean Algebra Gates, Circuits, and Boolean Algebra Computers and Electricity A gate is a device that performs a basic operation on electrical signals Gates are combined into circuits to perform more complicated tasks

More information

Introduction. The Quine-McCluskey Method Handout 5 January 21, 2016. CSEE E6861y Prof. Steven Nowick

Introduction. The Quine-McCluskey Method Handout 5 January 21, 2016. CSEE E6861y Prof. Steven Nowick CSEE E6861y Prof. Steven Nowick The Quine-McCluskey Method Handout 5 January 21, 2016 Introduction The Quine-McCluskey method is an exact algorithm which finds a minimum-cost sum-of-products implementation

More information

Switching Algebra and Logic Gates

Switching Algebra and Logic Gates Chapter 2 Switching Algebra and Logic Gates The word algebra in the title of this chapter should alert you that more mathematics is coming. No doubt, some of you are itching to get on with digital design

More information

A single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc

A single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc Other architectures Example. Accumulator-based machines A single register, called the accumulator, stores the operand before the operation, and stores the result after the operation. Load x # into acc

More information

Core Maths C2. Revision Notes

Core Maths C2. Revision Notes Core Maths C Revision Notes November 0 Core Maths C Algebra... Polnomials: +,,,.... Factorising... Long division... Remainder theorem... Factor theorem... 4 Choosing a suitable factor... 5 Cubic equations...

More information

Solving Systems of Equations

Solving Systems of Equations Solving Sstems of Equations When we have or more equations and or more unknowns, we use a sstem of equations to find the solution. Definition: A solution of a sstem of equations is an ordered pair that

More information

Binary Adders: Half Adders and Full Adders

Binary Adders: Half Adders and Full Adders 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

More information

Boolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010

Boolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010 Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic simplification Proving validity of an

More information

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

FORDHAM UNIVERSITY CISC 3593. Dept. of Computer and Info. Science Spring, 2011. The Binary Adder FORDHAM UNIVERITY CIC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. cience pring, 2011 1 Introduction The Binar Adder The binar adder circuit is an important building

More information

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation Prof. David Marshall School of Computer Science & Informatics Factorisation Factorisation is a way of

More information

www.mohandesyar.com SOLUTIONS MANUAL DIGITAL DESIGN FOURTH EDITION M. MORRIS MANO California State University, Los Angeles MICHAEL D.

www.mohandesyar.com SOLUTIONS MANUAL DIGITAL DESIGN FOURTH EDITION M. MORRIS MANO California State University, Los Angeles MICHAEL D. 27 Pearson Education, Inc., Upper Saddle River, NJ. ll rights reserved. This publication is protected by opyright and written permission should be obtained or likewise. For information regarding permission(s),

More information

DESIGN OF GATE NETWORKS

DESIGN OF GATE NETWORKS DESIGN OF GATE NETWORKS DESIGN OF TWO-LEVEL NETWORKS: and-or and or-and NETWORKS MINIMAL TWO-LEVEL NETWORKS KARNAUGH MAPS MINIMIZATION PROCEDURE AND TOOLS LIMITATIONS OF TWO-LEVEL NETWORKS DESIGN OF TWO-LEVEL

More information

Basic Logic Gates Richard E. Haskell

Basic Logic Gates Richard E. Haskell BASIC LOGIC GATES 1 E Basic Logic Gates Richard E. Haskell All digital systems are made from a few basic digital circuits that we call logic gates. These circuits perform the basic logic functions that

More information

A Prime Investigation with 7, 11, and 13

A Prime Investigation with 7, 11, and 13 . Objective To investigate the divisibility of 7, 11, and 13, and discover the divisibility characteristics of certain six-digit numbers A c t i v i t y 3 Materials TI-73 calculator A Prime Investigation

More information

Unit 3 Boolean Algebra (Continued)

Unit 3 Boolean Algebra (Continued) Unit 3 Boolean Algebra (Continued) 1. Exclusive-OR Operation 2. Consensus Theorem Department of Communication Engineering, NCTU 1 3.1 Multiplying Out and Factoring Expressions Department of Communication

More information

CHAPTER 3 Boolean Algebra and Digital Logic

CHAPTER 3 Boolean Algebra and Digital Logic CHAPTER 3 Boolean Algebra and Digital Logic 3.1 Introduction 121 3.2 Boolean Algebra 122 3.2.1 Boolean Expressions 123 3.2.2 Boolean Identities 124 3.2.3 Simplification of Boolean Expressions 126 3.2.4

More information

Scilab Textbook Companion for Digital Electronics: An Introduction To Theory And Practice by W. H. Gothmann 1

Scilab Textbook Companion for Digital Electronics: An Introduction To Theory And Practice by W. H. Gothmann 1 Scilab Textbook Companion for Digital Electronics: An Introduction To Theory And Practice by W. H. Gothmann 1 Created by Aritra Ray B.Tech Electronics Engineering NIT-DURGAPUR College Teacher Prof. Sabyasachi

More information

(b) (b) f 1 = x 1 x 2 ( x 3 v x 4 )

(b) (b) f 1 = x 1 x 2 ( x 3 v x 4 ) On Bi-Decompositions of Logic Functions Tsutomu Sasao Department of Computer Science and Electronics Kyushu Institute of Technology Iizuka 820, Japan Jon T. Butler Department of Electrical and Computer

More information

Understanding Logic Design

Understanding Logic Design Understanding Logic Design ppendix of your Textbook does not have the needed background information. This document supplements it. When you write add DD R0, R1, R2, you imagine something like this: R1

More information

ELEC 2210 - EXPERIMENT 1 Basic Digital Logic Circuits

ELEC 2210 - EXPERIMENT 1 Basic Digital Logic Circuits Objectives ELEC - EXPERIMENT Basic Digital Logic Circuits The experiments in this laboratory exercise will provide an introduction to digital electronic circuits. You will learn how to use the IDL-00 Bit

More information

Exponential and Logarithmic Functions

Exponential and Logarithmic Functions Chapter 6 Eponential and Logarithmic Functions Section summaries Section 6.1 Composite Functions Some functions are constructed in several steps, where each of the individual steps is a function. For eample,

More information

2.0 Chapter Overview. 2.1 Boolean Algebra

2.0 Chapter Overview. 2.1 Boolean Algebra Thi d t t d ith F M k 4 0 2 Boolean Algebra Chapter Two Logic circuits are the basis for modern digital computer systems. To appreciate how computer systems operate you will need to understand digital

More information

Elementary Logic Gates

Elementary Logic Gates Elementary Logic Gates Name Symbol Inverter (NOT Gate) ND Gate OR Gate Truth Table Logic Equation = = = = = + C. E. Stroud Combinational Logic Design (/6) Other Elementary Logic Gates NND Gate NOR Gate

More information

x y The matrix form, the vector form, and the augmented matrix form, respectively, for the system of equations are

x y The matrix form, the vector form, and the augmented matrix form, respectively, for the system of equations are Solving Sstems of Linear Equations in Matri Form with rref Learning Goals Determine the solution of a sstem of equations from the augmented matri Determine the reduced row echelon form of the augmented

More information

Karnaugh Maps (K-map) Alternate representation of a truth table

Karnaugh Maps (K-map) Alternate representation of a truth table Karnaugh Maps (K-map) lternate representation of a truth table Red decimal = minterm value Note that is the MS for this minterm numbering djacent squares have distance = 1 Valuable tool for logic minimization

More information

FACTORING ax 2 bx c WITH a 1

FACTORING ax 2 bx c WITH a 1 296 (6 20) Chapter 6 Factoring 6.4 FACTORING a 2 b c WITH a 1 In this section The ac Method Trial and Error Factoring Completely In Section 6.3 we factored trinomials with a leading coefficient of 1. In

More information

Incremental Reduction of Binary Decision Diagrams

Incremental Reduction of Binary Decision Diagrams Abstract Incremental Reduction of Binar Decision Diagrams R. Jacobi, N. Calazans, C. Trullemans. Université de Louvain Laboratoire de Microélectronique - Place du Levant, 3 B1348 Louvain-la-Neuve Belgium

More information

Higher. Polynomials and Quadratics 64

Higher. Polynomials and Quadratics 64 hsn.uk.net Higher Mathematics UNIT OUTCOME 1 Polnomials and Quadratics Contents Polnomials and Quadratics 64 1 Quadratics 64 The Discriminant 66 3 Completing the Square 67 4 Sketching Parabolas 70 5 Determining

More information

SIMPLIFYING SQUARE ROOTS EXAMPLES

SIMPLIFYING SQUARE ROOTS EXAMPLES SIMPLIFYING SQUARE ROOTS EXAMPLES 1. Definition of a simplified form for a square root The square root of a positive integer is in simplest form if the radicand has no perfect square factor other than

More information

Combinational circuits

Combinational circuits Combinational circuits Combinational circuits are stateless The outputs are functions only of the inputs Inputs Combinational circuit Outputs 3 Thursday, September 2, 3 Enabler Circuit (High-level view)

More information

C H A P T E R. Logic Circuits

C H A P T E R. Logic Circuits C H A P T E R Logic Circuits Many important functions are naturally computed with straight-line programs, programs without loops or branches. Such computations are conveniently described with circuits,

More information

ENGI 241 Experiment 5 Basic Logic Gates

ENGI 241 Experiment 5 Basic Logic Gates ENGI 24 Experiment 5 Basic Logic Gates OBJECTIVE This experiment will examine the operation of the AND, NAND, OR, and NOR logic gates and compare the expected outputs to the truth tables for these devices.

More information

Lines and Planes 1. x(t) = at + b y(t) = ct + d

Lines and Planes 1. x(t) = at + b y(t) = ct + d 1 Lines in the Plane Lines and Planes 1 Ever line of points L in R 2 can be epressed as the solution set for an equation of the form A + B = C. The equation is not unique for if we multipl both sides b

More information

a. You can t do the simple trick of finding two integers that multiply to give 6 and add to give 5 because the a (a = 4) is not equal to one.

a. You can t do the simple trick of finding two integers that multiply to give 6 and add to give 5 because the a (a = 4) is not equal to one. FACTORING TRINOMIALS USING THE AC METHOD. Factoring trinomial epressions in one unknown is an important skill necessary to eventually solve quadratic equations. Trinomial epressions are of the form a 2

More information

Mathematics Placement Packet Colorado College Department of Mathematics and Computer Science

Mathematics Placement Packet Colorado College Department of Mathematics and Computer Science Mathematics Placement Packet Colorado College Department of Mathematics and Computer Science Colorado College has two all college requirements (QR and SI) which can be satisfied in full, or part, b taking

More information

How many of these intersection points lie in the interior of the shaded region? If 1. then what is the value of

How many of these intersection points lie in the interior of the shaded region? If 1. then what is the value of NOVEMBER A stack of 00 nickels has a height of 6 inches What is the value, in dollars, of an 8-foot-high stack of nickels? Epress our answer to the nearest hundredth A cube is sliced b a plane that goes

More information

A.3. Polynomials and Factoring. Polynomials. What you should learn. Definition of a Polynomial in x. Why you should learn it

A.3. Polynomials and Factoring. Polynomials. What you should learn. Definition of a Polynomial in x. Why you should learn it Appendi A.3 Polynomials and Factoring A23 A.3 Polynomials and Factoring What you should learn Write polynomials in standard form. Add,subtract,and multiply polynomials. Use special products to multiply

More information

Digital circuits make up all computers and computer systems. The operation of digital circuits is based on

Digital circuits make up all computers and computer systems. The operation of digital circuits is based on Digital Logic Circuits Digital circuits make up all computers and computer systems. The operation of digital circuits is based on Boolean algebra, the mathematics of binary numbers. Boolean algebra is

More information

Read-only memory Implementing logic with ROM Programmable logic devices Implementing logic with PLDs Static hazards

Read-only memory Implementing logic with ROM Programmable logic devices Implementing logic with PLDs Static hazards Points ddressed in this Lecture Lecture 8: ROM Programmable Logic Devices Professor Peter Cheung Department of EEE, Imperial College London Read-only memory Implementing logic with ROM Programmable logic

More information

{ } Sec 3.1 Systems of Linear Equations in Two Variables

{ } Sec 3.1 Systems of Linear Equations in Two Variables Sec.1 Sstems of Linear Equations in Two Variables Learning Objectives: 1. Deciding whether an ordered pair is a solution.. Solve a sstem of linear equations using the graphing, substitution, and elimination

More information

Definitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder).

Definitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder). Math 50, Chapter 8 (Page 1 of 20) 8.1 Common Factors Definitions 1. A factor of integer is an integer that will divide the given integer evenly (with no remainder). Find all the factors of a. 44 b. 32

More information

exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576

exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576 exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576 Outline exclusive OR gate (XOR) Definition Properties Examples of Applications Odd Function Parity Generation and Checking

More information

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction Introduction Gates & Boolean lgebra Boolean algebra: named after mathematician George Boole (85 864). 2-valued algebra. digital circuit can have one of 2 values. Signal between and volt =, between 4 and

More information

Chapter 7 Memory and Programmable Logic

Chapter 7 Memory and Programmable Logic NCNU_2013_DD_7_1 Chapter 7 Memory and Programmable Logic 71I 7.1 Introduction ti 7.2 Random Access Memory 7.3 Memory Decoding 7.5 Read Only Memory 7.6 Programmable Logic Array 77P 7.7 Programmable Array

More information

SAMPLE. Polynomial functions

SAMPLE. Polynomial functions Objectives C H A P T E R 4 Polnomial functions To be able to use the technique of equating coefficients. To introduce the functions of the form f () = a( + h) n + k and to sketch graphs of this form through

More information

Combinational Logic Design Process

Combinational Logic Design Process Combinational Logic Design Process Create truth table from specification Generate K-maps & obtain logic equations Draw logic diagram (sharing common gates) Simulate circuit for design verification Debug

More information

Combinational Logic Design

Combinational Logic Design Chapter 4 Combinational Logic Design The foundations for the design of digital logic circuits were established in the preceding chapters. The elements of Boolean algebra (two-element switching algebra

More information

Chapter 3. if 2 a i then location: = i. Page 40

Chapter 3. if 2 a i then location: = i. Page 40 Chapter 3 1. Describe an algorithm that takes a list of n integers a 1,a 2,,a n and finds the number of integers each greater than five in the list. Ans: procedure greaterthanfive(a 1,,a n : integers)

More information

Mathematics More Visual Using Algebra Tiles

Mathematics More Visual Using Algebra Tiles www.cpm.org Chris Mikles CPM Educational Program A California Non-profit Corporation 33 Noonan Drive Sacramento, CA 958 (888) 808-76 fa: (08) 777-8605 email: mikles@cpm.org An Eemplary Mathematics Program

More information

Answers to Basic Algebra Review

Answers to Basic Algebra Review Answers to Basic Algebra Review 1. -1.1 Follow the sign rules when adding and subtracting: If the numbers have the same sign, add them together and keep the sign. If the numbers have different signs, subtract

More information

Properties of Real Numbers

Properties of Real Numbers 16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should

More information

Design Example: Counters. Design Example: Counters. 3-Bit Binary Counter. 3-Bit Binary Counter. Other useful counters:

Design Example: Counters. Design Example: Counters. 3-Bit Binary Counter. 3-Bit Binary Counter. Other useful counters: Design Eample: ers er: a sequential circuit that repeats a specified sequence of output upon clock pulses. A,B,C,, Z. G, O, T, E, R, P, S,!.,,,,,,,7. 7,,,,,,,.,,,,,,,,,,,. Binary counter: follows the binary

More information

EE360: Digital Design I Course Syllabus

EE360: Digital Design I Course Syllabus : Course Syllabus Dr. Mohammad H. Awedh Fall 2008 Course Description This course introduces students to the basic concepts of digital systems, including analysis and design. Both combinational and sequential

More information

Vocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.

Vocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture. CHAPTER Vocabulary The table contains important vocabulary terms from Chapter. As you work through the chapter, fill in the page number, definition, and a clarifying example. biconditional statement conclusion

More information

CPM Educational Program

CPM Educational Program CPM Educational Program A California, Non-Profit Corporation Chris Mikles, National Director (888) 808-4276 e-mail: mikles @cpm.org CPM Courses and Their Core Threads Each course is built around a few

More information

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell Digital Electronics Part I Combinational and Sequential Logic Dr. I. J. Wassell Introduction Aims To familiarise students with Combinational logic circuits Sequential logic circuits How digital logic gates

More information

FACTORING ax 2 bx c. Factoring Trinomials with Leading Coefficient 1

FACTORING ax 2 bx c. Factoring Trinomials with Leading Coefficient 1 5.7 Factoring ax 2 bx c (5-49) 305 5.7 FACTORING ax 2 bx c In this section In Section 5.5 you learned to factor certain special polynomials. In this section you will learn to factor general quadratic polynomials.

More information

Sum-of-Products and Product-of-Sums expressions

Sum-of-Products and Product-of-Sums expressions Sum-of-Products and Product-of-Sums expressions This worksheet and all related files are licensed under the reative ommons ttribution License, version.. To view a copy of this license, visit http://creativecommons.org/licenses/by/./,

More information

Using the ac Method to Factor

Using the ac Method to Factor 4.6 Using the ac Method to Factor 4.6 OBJECTIVES 1. Use the ac test to determine factorability 2. Use the results of the ac test 3. Completely factor a trinomial In Sections 4.2 and 4.3 we used the trial-and-error

More information

A Course Material on DIGITAL PRINCIPLES AND SYSTEM DESIGN

A Course Material on DIGITAL PRINCIPLES AND SYSTEM DESIGN A Course Material on By MS.G.MANJULA ASSISTANT PROFESSOR DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING SASURIE COLLEGE OF ENGINEERING VIJAYAMANGALAM 638 56 QUALITY CERTIFICATE This is to certify

More information

Veterans Upward Bound Algebra I Concepts - Honors

Veterans Upward Bound Algebra I Concepts - Honors Veterans Upward Bound Algebra I Concepts - Honors Brenda Meery Kaitlyn Spong Say Thanks to the Authors Click http://www.ck12.org/saythanks (No sign in required) www.ck12.org Chapter 6. Factoring CHAPTER

More information

Applications of Fermat s Little Theorem and Congruences

Applications of Fermat s Little Theorem and Congruences Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4

More information

Exponents. Learning Objectives 4-1

Exponents. Learning Objectives 4-1 Eponents -1 to - Learning Objectives -1 The product rule for eponents The quotient rule for eponents The power rule for eponents Power rules for products and quotient We can simplify by combining the like

More information

Factoring Quadratic Expressions

Factoring Quadratic Expressions Factoring the trinomial ax 2 + bx + c when a = 1 A trinomial in the form x 2 + bx + c can be factored to equal (x + m)(x + n) when the product of m x n equals c and the sum of m + n equals b. (Note: the

More information

Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots

Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots Registers As you probably know (if you don t then you should consider changing your course), data processing is usually

More information

2.4. Factoring Quadratic Expressions. Goal. Explore 2.4. Launch 2.4

2.4. Factoring Quadratic Expressions. Goal. Explore 2.4. Launch 2.4 2.4 Factoring Quadratic Epressions Goal Use the area model and Distributive Property to rewrite an epression that is in epanded form into an equivalent epression in factored form The area of a rectangle

More information

SECTION 2.2. Distance and Midpoint Formulas; Circles

SECTION 2.2. Distance and Midpoint Formulas; Circles SECTION. Objectives. Find the distance between two points.. Find the midpoint of a line segment.. Write the standard form of a circle s equation.. Give the center and radius of a circle whose equation

More information

Simplifying Exponential Expressions

Simplifying Exponential Expressions Simplifying Eponential Epressions Eponential Notation Base Eponent Base raised to an eponent Eample: What is the base and eponent of the following epression? 7 is the base 7 is the eponent Goal To write

More information

So let us begin our quest to find the holy grail of real analysis.

So let us begin our quest to find the holy grail of real analysis. 1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

More information

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

More information

z 0 and y even had the form

z 0 and y even had the form Gaussian Integers The concepts of divisibility, primality and factoring are actually more general than the discussion so far. For the moment, we have been working in the integers, which we denote by Z

More information

Lesson 9: Radicals and Conjugates

Lesson 9: Radicals and Conjugates Student Outcomes Students understand that the sum of two square roots (or two cube roots) is not equal to the square root (or cube root) of their sum. Students convert expressions to simplest radical form.

More information

x 4-1 = (x²)² - (1)² = (x² + 1) (x² - 1) = (x² + 1) (x - 1) (x + 1)

x 4-1 = (x²)² - (1)² = (x² + 1) (x² - 1) = (x² + 1) (x - 1) (x + 1) Factoring Polynomials EXAMPLES STEP 1 : Greatest Common Factor GCF Factor out the greatest common factor. 6x³ + 12x²y = 6x² (x + 2y) 5x - 5 = 5 (x - 1) 7x² + 2y² = 1 (7x² + 2y²) 2x (x - 3) - (x - 3) =

More information

SAT Math Hard Practice Quiz. 5. How many integers between 10 and 500 begin and end in 3?

SAT Math Hard Practice Quiz. 5. How many integers between 10 and 500 begin and end in 3? SAT Math Hard Practice Quiz Numbers and Operations 5. How many integers between 10 and 500 begin and end in 3? 1. A bag contains tomatoes that are either green or red. The ratio of green tomatoes to red

More information

SECTION A-3 Polynomials: Factoring

SECTION A-3 Polynomials: Factoring A-3 Polynomials: Factoring A-23 thick, write an algebraic epression in terms of that represents the volume of the plastic used to construct the container. Simplify the epression. [Recall: The volume 4

More information

THE POWER RULES. Raising an Exponential Expression to a Power

THE POWER RULES. Raising an Exponential Expression to a Power 8 (5-) Chapter 5 Eponents and Polnomials 5. THE POWER RULES In this section Raising an Eponential Epression to a Power Raising a Product to a Power Raising a Quotient to a Power Variable Eponents Summar

More information

Adding and Subtracting Positive and Negative Numbers

Adding and Subtracting Positive and Negative Numbers Adding and Subtracting Positive and Negative Numbers Absolute Value For any real number, the distance from zero on the number line is the absolute value of the number. The absolute value of any real number

More information

Algebra II. Administered May 2013 RELEASED

Algebra II. Administered May 2013 RELEASED STAAR State of Teas Assessments of Academic Readiness Algebra II Administered Ma 0 RELEASED Copright 0, Teas Education Agenc. All rights reserved. Reproduction of all or portions of this work is prohibited

More information