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

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

Chapter 2: Princess Sumaya Univ. Computer Engineering Dept.

This form sometimes used in logic circuit, example:

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

Signals and Systems Digital Logic System

UNIT 5 KARNAUGH MAPS Spring 2011

Chapter 2 Part 7 Combinational Logic Circuits

Digital Fundamentals

Simplifying Logic Circuits with Karnaugh Maps

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps

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

Boolean Algebra & Logic Gates. By : Ali Mustafa

CHAPTER 2 BOOLEAN ALGEBRA

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Functions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:

Standard Expression Forms

LOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.

Chapter-2 BOOLEAN ALGEBRA

ECE/Comp Sci 352 Digital System Fundamentals Quiz # 1 Solutions

CHAPTER III BOOLEAN ALGEBRA

Combinational Logic Circuits Part II -Theoretical Foundations

Lecture 2 Review on Digital Logic (Part 1)

Logic Design. Chapter 2: Introduction to Logic Circuits

EEE130 Digital Electronics I Lecture #4

BOOLEAN ALGEBRA TRUTH TABLE

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

ELC224C. Karnaugh Maps

Unit 2 Session - 6 Combinational Logic Circuits

Lecture 5. Karnaugh-Map

CHAPTER III BOOLEAN ALGEBRA

Lecture 4: More Boolean Algebra

Chapter 2 Combinational Logic Circuits

1. Expand each of the following functions into a canonical sum-of-products expression.

CHAPTER1: Digital Logic Circuits Combination Circuits

MC9211 Computer Organization

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

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

Mark Redekopp, All rights reserved. Lecture 5 Slides. Canonical Sums and Products (Minterms and Maxterms) 2-3 Variable Theorems DeMorgan s Theorem

ECE 238L Boolean Algebra - Part I

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

Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

ENGR 303 Introduction to Logic Design Lecture 3. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College

Boolean Algebra and Logic Simplification

Karnaugh Maps Objectives

Logic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization

Sample Marking Scheme

Number System conversions

Lecture 7: Karnaugh Map, Don t Cares

Digital Logic Design. Combinational Logic

Contents. Chapter 3 Combinational Circuits Page 1 of 36

Review for Test 1 : Ch1 5

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

DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA

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

ENG2410 Digital Design Combinational Logic Circuits

for Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Part 5: Digital Circuits

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

DIGITAL ELECTRONICS & it0203 Semester 3

Combinational Logic Design Principles

Unit 2 Boolean Algebra

Chapter 2 : Boolean Algebra and Logic Gates

Binary logic consists of binary variables and logical operations. The variables are

CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman

Electronics. Overview. Introducction to Synthetic Biology

Binary Logic and Gates. Our objective is to learn how to design digital circuits.

Solutions to Assignment No 5 Digital Techniques Fall 2007

Circuits & Boolean algebra.

Combinational Logic Fundamentals

EXPERIMENT #4: SIMPLIFICATION OF BOOLEAN FUNCTIONS

UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits

Chapter 7 Combinational Logic Networks

CMSC 313 Lecture 16 Postulates & Theorems of Boolean Algebra Semiconductors CMOS Logic Gates

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

211: Computer Architecture Summer 2016

Digital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra

3. PRINCIPLES OF COMBINATIONAL LOGIC

Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE

Chapter 2 Combinational Logic Circuits

CS61c: Representations of Combinational Logic Circuits

Chapter 2: Switching Algebra and Logic Circuits

SAMPLE ANSWERS MARKER COPY

Binary Logic and Gates

Logic Design I (17.341) Fall Lecture Outline

Possible logic functions of two variables

Digital Logic Design. Malik Najmus Siraj

The Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

Minimization techniques

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

CS/EE 181a 2010/11 Lecture 4

Gate-Level Minimization

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

EE 209 Spiral 1 Exam Solutions Name:

WEEK 2.1 BOOLEAN ALGEBRA

Review. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms

Fundamentals of Boolean Algebra

Combinatorial Logic Design Principles

Transcription:

EE Practice Problems for Exam : Solutions, Fall 28. ircle T (true) or F (false) for each of these oolean equations. (a). T FO + = (b). T FO + = ( + )( + ) (c). TO F = (d). TO F () = () (e). TO F + + = 2. Evaluate the following: 2(a). onvert to hex:. 2 =? Integer Part: 2 = H 2 = 9H Fractional Part: 2 = H Verification of Fractional Part: 2 = 2 + 2 3 + 2 4 = /2 + /8 + /6 = 8/6 + 2/6 + /6 = /6 = 6 = 6 Verification is for your own interest; you are not expected to show this on an exam problem.. 2 =9.H 2(b). onvert to decimal:. 2 =? Integer: 2 = 2 + 2 2 + 2 4 + 2 5 = + 4 + 6 + 32 = 53 Fraction:. 2 = 2 2 = /4 =.25. 2 = 53.25

EE Practice Problems for Exam : Solutions, Fall 28 2 2(c). onvert to binary: 98.25 =? Using sum-of-powers method, we obtain for the integer and fractional parts: Integer: 2 6 = 64 < 98 98 64 = 34 2 5 = 32 < 34 34 32 = 2 2 = 2 2 2 = Integer: 98 = 2 6 + 2 5 + 2 = 2 Fractional Part: 2 2 = /4 =.25.25.25 = Fraction:.25 = 2 2 =. 2 Note: It is sufficient to write that.25 = 2 2 =. 2 for the fractional part. 98.25 =. 2 2(d). onvert to decimal: 2.4 6 =? Either convert directly from hex: 2.4 6 = 2 6 + 6 + 4 6 = 32 + + 4/6 = 32 + + /4 = 42.25 or convert to binary first and then to decimal: 2.4 6 =. 2 = 2 5 + 2 3 + 2 + 2 2 = 32 + 8 + 2 + /4 = 42.25 2.4 6 = 42.25

EE Practice Problems for Exam : Solutions, Fall 28 3 3. Write the oolean expression equivalent to the following logic circuit. Do not simplify! $% D $% = ( + ) + D 4(a). Draw the logic circuit realization of the following oolean expression as stated. Do not simplify! ou may draw inverters explicitly or use inversion bubbles, as you choose. = f(,, ) = ( + )( + ) "# 4(b). Write the complete truth table for the oolean expression of 4(a).

EE Practice Problems for Exam : Solutions, Fall 28 4 4(c). onvert the oolean equation of 4(a) to its DeMorgan equivalent. There are two (very similar) ways to apply DeMorgan s theorem to 4(a). ( + )( + ) = ( + )( + ) = ( + ) + ( + ) = ( + ) + ( + ) = ( + ) + = ( + ) + OR ( + )( + ) = ( + )( + ) = ( + ) + ( + ) = ( ) + = ( ) + stopping here gives circuit 4.d.(alt) = ( + ) + = ( + ) + = ( + ) + OR = ( ) + for SOP 4(d). Draw the logic circuit for the DeMorgan equivalent oolean equation you found in 4(c). ou may use inverters or inversion bubbles, as you choose. "# OR (alt)

EE Practice Problems for Exam : Solutions, Fall 28 5 5. Simplify the following oolean expression as far as possible, using the postulates and theorems of oolean algebra. DO NOT use a Karnaugh map except possibly to check your work. ou do not have to justify each step by stating the theorem or postulate used, but you must show each step in your simplification. f(w, x, y) = wxy + wx + wy + wxy wxy + wx + wy + wxy = wxy + wx + wy + wyx associative (b) = wxy + wx + wy + wyx identity (b), = = wxy + wx + wy( + x) distributive (b), ( + ) = + = wxy + wx + wy Nullity Thm (a), + = = wxy + wx + wy identity (b) = w(xy + x) + wy distributive (b) = w(x + y) + wy Reduction Thm (a), + = + = w(x + y + y) distributive (b) = w(x + ) complement (a), + = = w Nullity Thm (a) = w identity (b) wxy + wx + wy + wxy = w Simplified! f(w, x, y, z) = w Note: ou may approach this problem in a different order, for example, by factoring out w initially. This is fine, as long as you include all steps and obtain the same final answer. 6. Simplify the following expression using the postulates and theorems of oolean algebra. Eliminate all group complements. Justify each step by stating or referrring to the oolean theorem or postulate you use. Don t skip any steps! Do NOT use a Karnaugh map to simplify the expressions. ( )( + )( + ) Hint: Remember DeMorgan s theorem! ( )( + )( + ) = ( ) ombining Thm (b), ( + )( + ) = = ( + + ) DeMorgan s Theorem, = + = + + distributive (b) = + + complement (b), = = + identity (a), + = = ( + ) distributive (b) ( )( + )( + ) = ( + ) Simplified!

EE Practice Problems for Exam : Solutions, Fall 28 6 7. Given = f(w, x, y, z) = M(,, 3, 5, 3), 7(a). Write the complete truth table for = f(w, x, y, z). w x y z 7(b). Write = f(w, x, y, z) in POS canonical form. (Do not use Σ or Π notation in your final answer.) = (w + x + y + z)(w + x + y + z)(w + x + y + z)(w + x + y + z)(w + x + y + z) 7(c). Write = f(w, x, y, z) in shorthand SOP form. (Use Σ or Π notation in your final answer.) = m(2, 4, 6, 7, 8, 9,,, 2, 4, 5) 7(d). Write = f(w, x, y, z) in SOP canonical form. (Do not use Σ or Π notation in your final answer.) =w x yz + w x y z + w x y z + w x y z + w x y z + w x y z + w x y z + w x y z + w x y z + w x y z + w x y z

EE Practice Problems for Exam : Solutions, Fall 28 7 8. For = f(w, x, y, z) = M(,, 3, 5, 3) as given in Problem 7, 8(a). Fully label and complete the Karnaugh map below with as given above. Then derive a minimized POS expression for = f(w, x, y, z). wx yz POS Groupings: red horizontal pair=w + x + y; magenta vertical pair=x + y + z blue horizontal pair=w + x + z POS: = (w + x + y)(w + x + z)(x + y + z) 8(b). Fully label and complete the Karnaugh map below with as given above. Then derive a minimized SOP expression for. wx yz SOP Groupings: dark blue horizontal quad=wx; red vertical quad=yz light blue square quad=xy; green wraparound square quad=xz SOP: = wx + yz + xy + xz