EEL 3701 Fall Multiply out the following logic expressions to obtain the Sum of Products.

Similar documents
LOGIC GATES (PRACTICE PROBLEMS)

Signals and Systems Digital Logic System

Combinational Logic. Jee-Hwan Ryu. School of Mechanical Engineering Korea University of Technology and Education

CSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April

CHAPTER * 2-2.* Pearson Education Limited Problem Solutions, Global Edition Chapter 2. Verification of DeMorgan s Theorem

Systems I: Computer Organization and Architecture

Contents. Chapter 3 Combinational Circuits Page 1 of 36

Chapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]

Combinational Logic. By : Ali Mustafa

CHAPTER1: Digital Logic Circuits Combination Circuits

Combinational Logic. Course Instructor Mohammed Abdul kader

II. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):

COE 202: Digital Logic Design Combinational Circuits Part 2. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

COMBINATIONAL LOGIC FUNCTIONS

Boolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation

Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University

Chapter 7 Combinational Logic Networks

Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions

Unit 2 Session - 6 Combinational Logic Circuits

UNIT III Design of Combinational Logic Circuits. Department of Computer Science SRM UNIVERSITY

Menu. Binary Adder EEL3701 EEL3701. Add, Subtract, Compare, ALU

Learning Objectives. Boolean Algebra. In this chapter you will learn about:

CHAPTER 3 LOGIC GATES & BOOLEAN ALGEBRA

ELCT201: DIGITAL LOGIC DESIGN

Part 5: Digital Circuits


Total Time = 90 Minutes, Total Marks = 100. Total /10 /25 /20 /10 /15 /20

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques s complement 2 s complement 1 s complement

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Adders - Subtractors

EE 110 Practice Problems for Exam 1: Solutions, Fall 2008

Chapter 2 Part 7 Combinational Logic Circuits

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Sample Marking Scheme

UNIT 5 KARNAUGH MAPS Spring 2011

Name. ECE-200 Intelligent Systems

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

EE 209 Spiral 1 Exam Solutions Name:

Logic. Basic Logic Functions. Switches in series (AND) Truth Tables. Switches in Parallel (OR) Alternative view for OR

Why digital? Overview. Number Systems. Binary to Decimal conversion

Theory of Logic Circuits. Laboratory manual. Exercise 1

Additional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

Logic. Combinational. inputs. outputs. the result. system can

12/31/2010. Overview. 05-Boolean Algebra Part 3 Text: Unit 3, 7. DeMorgan s Law. Example. Example. DeMorgan s Law

Addition and Subtraction

New Students Day Activity

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

Show that the dual of the exclusive-or is equal to its compliment. 7

UNIT 4 MINTERM AND MAXTERM EXPANSIONS

Circuits & Boolean algebra.

Lecture 2 Review on Digital Logic (Part 1)

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

CMSC 313 Lecture 17. Focus Groups. Announcement: in-class lab Thu 10/30 Homework 3 Questions Circuits for Addition Midterm Exam returned

Chapter 2 (Lect 2) Canonical and Standard Forms. Standard Form. Other Logic Operators Logic Gates. Sum of Minterms Product of Maxterms

L2: Combinational Logic Design (Construction and Boolean Algebra)

Combinatorial Logic Design Principles

Midterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes

Boolean Algebra & Logic Gates. By : Ali Mustafa

Chapter 3 Combinational Logic Design

Section 3: Combinational Logic Design. Department of Electrical Engineering, University of Waterloo. Combinational Logic

ENGIN 112 Intro to Electrical and Computer Engineering

Review: Additional Boolean operations

Written exam for IE1204/5 Digital Design with solutions Thursday 29/

ELEN Electronique numérique

Carry Look Ahead Adders

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE

L2: Combinational Logic Design (Construction and Boolean Algebra)

Boole Algebra and Logic Series

Textbook: Digital Design, 3 rd. Edition M. Morris Mano

Combinational Logic. Mantıksal Tasarım BBM231. section instructor: Ufuk Çelikcan

COE 202: Digital Logic Design Combinational Circuits Part 4. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

Please read carefully. Good luck & Go Gators!!!

Chapter 5 Arithmetic Circuits

control in out in out Figure 1. Binary switch: (a) opened or off; (b) closed or on.

Combina-onal Logic Chapter 4. Topics. Combina-on Circuit 10/13/10. EECE 256 Dr. Sidney Fels Steven Oldridge

CMSC 313 Lecture 19 Combinational Logic Components Programmable Logic Arrays Karnaugh Maps

Review for Test 1 : Ch1 5

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN

Introduction to Digital Logic

Department of Electrical and Computer Engineering University of Wisconsin - Madison. ECE/CS 352 Digital System Fundamentals.

Chapter 2: Switching Algebra and Logic Circuits

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates

CS61c: Representations of Combinational Logic Circuits

Digital Fundamentals

Digital Electronics. Delay Max. FF Rate Power/Gate High Low (ns) (MHz) (mw) (V) (V) Standard TTL (7400)

CSE370 HW3 Solutions (Winter 2010)

211: Computer Architecture Summer 2016

Fundamentals of Boolean Algebra

Chapter 2. Digital Logic Basics


CSCI 220: Computer Architecture I Instructor: Pranava K. Jha. Multiplexers

Unit 2 Boolean Algebra

Switching Circuits & Logic Design

CHAPTER 12 Boolean Algebra

Binary addition (1-bit) P Q Y = P + Q Comments Carry = Carry = Carry = Carry = 1 P Q

Digital- or Logic Circuits. Outline Logic Circuits. Logic Voltage Levels. Binary Representation

ELEC Digital Logic Circuits Fall 2014 Logic Minimization (Chapter 3)

Logic Synthesis. Late Policies. Wire Gauge. Schematics & Wiring

Transcription:

Page 1/5 Version: 7/30/17 1. Multiply out the following logic expressions to obtain the Sum of Products.. (/W /X Y) (W /Z) (/W X /Z) (W X) (W Y /Z). (/W /Y Z) (/W Y) (X /Y /Z) (/W X Y) (Y Z) 2. Using oolean identities, find the MSOP for your SOP obtained in #1. 3. Repeat #2 using K-Maps to obtain the MSOP and MPOS. heck your MSOP answers that you obtained in #2 with your K-Map derived MSOP results. 4. Use oolean identities to simplify the following logic equation. Then use a K-Map to check the MSOP result. lso use a K-Map to find the MPOS result. = /X*/Y*/Z /W*/Y*Z /[(/W /Z /X*Y)(X Z W*/Y)] 5. reate a logic expression as required in each of the following paragraphs.. You should laugh at a joke if it is funny, it is in good taste, and it is not offensive to others, or if it is told in class by your professor (regardless of whether it is funny and in good taste) and it is not offensive to others.. flow rate sensing device used on a liquid transport pipeline functions as follows: The device provides a 5 bit output where all five bits are zero if the flow rate is less than 10 gallons/minute. The least significant bit is 1 if the flow is greater than 10 gal/min. The LS and next most significant bit are 1 if the flow is greater than 20 gal/min. The LS and next two most significant bits are 1 if the flow is greater than 30 gal/min and so on. The five bits are represented by variables,,, D and E where is least significant and E is most significant. Write an equation for if we want to be 1 when the flow rate is less than 30 gal/min. Write an equation for G if we want G to be at least 20 gal/min but less than 50 gal/min.

Page 2/5 Version: 7/30/17 6. Given the following Logic Truth Table, find the MSOP and MPOS for Y and Z. Y Z 000 0 0 001 1 X 010 X X 011 1 0 100 0 X 101 1 X 110 X 1 111 1 1 7. reate a single bit cascade-able full adder and a single bit full subtractor. ascade several single bit adders to form a 4 bit adder and cascade several single bit subtractors to form a 4 bit subtractor. 8. bank vault has three locks with a different key for each lock. Each key is owned by a different person. In order to open the vault door, at least two people must insert their keys into the locks. The signal lines,, and are 1 if there is a key inserted into locks 1, 2 or 3, respectively. Write an equation for the variable U (unclock) which is 1 if the door should open. 9. Design a circuit which will add an 8 bit signed number to a 6 bit signed number. 10. Repeat the above design but assume that the 6 bit number is now unsigned. 11. combinatorial circuit has four inputs (MS),, and D (LS) which represent a D number. The circuit then has two groups of four outputs P (MS), Q, R, S and W, X, Y, and Z (LS) where each group represents a D digit. The goal is to design a circuit that will multiply the single D digit times five producing a two digit D output. i.e. D = 0111 then PQRS = 0011 and WXYZ = 0101. ssuming that no invalid D digits will occur as inputs, create a truth table and logic equations for the device. Hint: Use don t cares in the outputs to simplify the output equations when exceptable.

Page 3/5 Version: 7/30/17 12. or the following logic expressions, use a K-Map to find the MPOS and MSOP.. Y*Z /W*Y /W*X W*/X*/Z. (W /X) (/W /X Z) (/X Y /Z) (/Y Z). /W*X*Y*Z /X*Y /W*X*/Y*/Z /Y*/Z /W*X*Z /W*/X*/Y*/Z 13. Simplify the (2) circuits below and convert each circuit to a circuit that contains only NND gates. 14. Repeat #13 above but this time convert each circuit to a circuit that contains only NOR gates. 15. Given the following logic equations, create a circuit that contains only ND, OR and Inverter gates. ssume all signals are low true and do not simplify the equations.. = (W X Y /Z) (/W /X Y /Z) (/W Y) (W /Z) (X Y Z). = /W*/Y*/Z /X*Z /W*Y*Z W*X*/Z. = (W /X) (/W /X Y) /Z 16. Repeat #15, but now assume all inputs are high true and the output is low true. 17. or. and. in #15, implement the equation using NND gates. 18. or. and. in #15, implement the equation using NOR gates.

Page 4/5 Version: 7/30/17 or the two circuits below, answer the questions that follow. igure 1 igure 2 19. In ig. 1, assume,, and are all high true. What is the logic equation for? 20. In ig. 1, what is the logic equation for with.l,.h,.l and.l? 21. In ig. 2, assume all signals are low true, what is the logic equation for? 22. In ig. 2, what is the logic equation for with.l,.l and.l? 23. Design by direct implementation the circuit diagrams (by hand) for the following logic equations using only 2-input NND gates. Do not simplify the logic equation. Y = D*/(/(/*/*) */) ctive-high:,d ctive-low:,,y 24. Implement the logic equation in #23 using only 2-input NOR gates. 25. In igure 3, solve the logic equation for Z assuming,d, E are high true and,,,g and Z are low true. 26. In igure 4, solve the logic equation for Z assuming,,, D, E, and G are low true and Z is high true. 27. ind MSOP and MPOS for the following two K-Maps:.. D 0 1 1 1 0 1 1 0 1 1 1 0 1 0 1 1 D 1 0 1 X 1 1 X 0 X 0 1 X 1 0 0 1

Page 5/5 Version: 7/30/17 D E igure 3 Z G D Z E G igure 4 28. Given the following logic block, realize a circuit for the design out of NDs, ORs & Inverters. Y = ()(/) Y 29. Design a 2:4 decoder with high true inputs, a low true global enable and low true outputs. reate a logic truth table, find the logic equations and implement wih NDs, ORs and Inverters. Then use the 2:4 decoder (as many as you like) to create a 3:8 decoder with low true inputs and high true outputs.