Logic Gates, Boolean Algebra and Karnaugh Maps. Challenge! By the end of todays session can you complete the following?

Slides:



Advertisements
Similar presentations
Programming Logic Gate Functions in PLCs
Advertisements

Digital Circuits.
ECE 238L Computer Logic Design Spring 2010
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
ECE 331 – Digital System Design
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
Chapter 3 Boolean Algebra and Logic Gate (Part 2).
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
Chapter 3 Combinational Logic Design
Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.
Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
Boolean Algebra and Logic Simplification
Sahar Mosleh PageCalifornia State University San Marcos 1 Multiplexer, Decoder and Circuit Designing.
Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.
DeMorgan Theorem, Computer Simulation Exercises
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.
ES 244: Digital Logic Design Chapter 3 Chapter 3: Karnaugh Maps Uchechukwu Ofoegbu Temple University.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
4. Computer Maths and Logic 4.2 Boolean Logic Simplifying Boolean Expressions.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
Chapter 2 Boolean Algebra and Minimization Techniques.
Karnaugh Maps (K maps). What are Karnaugh 1 maps?  Karnaugh maps provide an alternative way of simplifying logic circuits.  Instead of using Boolean.
Logic Gates Digital Electronics.
1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
Designing Combinational Logic Circuits
Karnaugh Maps (K-Maps)
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.
1 3- De-Morgan’s Theorems 1.The complement of a product of variables is equal to the sum of the complements of the variables. 2. The complement of a sum.
Karnaugh Maps (K maps).
NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.
Logic Gates and Boolean Algebra Introduction to Logic II.
Programmable Logic Controller
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Combinational Circuits Part 1
Homework Reading Machine Projects Labs
Eng. Mai Z. Alyazji October, 2016
De Morgan’s Theorem,.
Questions Describe the following gates
MTE3 on , Tuesday 9:00-10:15, 10:30-11:45 AM 414W - PAB
Logic Gates, Boolean Algebra and Karnaugh Maps
CHAPTER 1 : INTRODUCTION
Combinational Circuit Design
Boolean Expressions Lecture No. 10.
Circuits & Boolean Expressions
Karnaugh Maps (K-Maps)
Recapping: Writing with algebra
BASIC & COMBINATIONAL LOGIC CIRCUIT
Combinational Logic Design Process
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Example Question: Consider the expressions: (a) F = XY + XY'
ECB2212-Digital Electronics K-Map
GCSE Computer Science – Logic Gates & Boolean Expressions
Logic Gates By Dr.Mazin Alzewary
Binary Logic.
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Karnaugh Maps (K maps).
Combinational Logic Circuit
Principles & Applications
Eng. Ahmed M Bader El-Din October, 2018
Laws & Rules of Boolean Algebra
Circuits & Boolean Expressions
Computer Architecture
Presentation transcript:

Logic Gates, Boolean Algebra and Karnaugh Maps

Challenge! By the end of todays session can you complete the following?

Using logic gate diagrams and truth tables Boolean algebra 1.Complete the truth table for the following logic diagram: ABCD A B C D

Using logic gate diagrams and truth tables Boolean algebra 2.Complete the truth table for the following logic diagram: ABCD A B C D

Using logic gate diagrams and truth tables Boolean algebra 3.Complete the truth table for the following logic diagram: A B C D E ABCDE

Using logic gate diagrams and truth tables Boolean algebra 4.Complete the truth table for the following logic diagram: ABCDEF A B C D E F

Using logic gate diagrams and truth tables Boolean algebra 5.Complete the truth table for the following logic diagram: ABCDEF A B C D E F

Using logic gate diagrams and truth tables Boolean algebra 6.Complete the truth table for the following logic diagram: ABCDEF A B C D E F

Define problems using Boolean logic Boolean algebra 1.Match the symbol to the operator. AND OR NOT XOR ∧ ¬ ∨ ⊻ ⊕

Define problems using Boolean logic Boolean algebra Use the correct symbols to define the following Boolean expressions: A ^ ¬ D V C V B BV CV B ¬ V ¬A D C B V ^ ^ ^B¬ B^ C V¬ D ¬ V V C VD V AC ^D ^ V A V ¬C ^ D ^ C B

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 1.What expression does this Karnaugh map illustrate? ABAB A 01 B

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 2. What expression does this Karnaugh map illustrate? ¬B ABAB A 01 B

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 3. What expression does this Karnaugh map illustrate? A¬^B ABAB A 01 B

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 4. What expression does this Karnaugh map illustrate? A^B ABAB A 01 B

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 5. What expression does this Karnaugh map illustrate?¬A^B ABAB A 01 B

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 1. Write the expression: A ∧ B ∨ C into the Karnaugh map, and draw rectangles/squares around the groups. AB C AB C

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 2. Write the expression: ¬A ∧ B ∨ ¬C into the Karnaugh map, and draw rectangles/squares around the groups. AB C AB C

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 3. Write the expression: ¬A ∧ ¬B ∨ C into the Karnaugh map, and draw rectangles/squares around the groups. AB C AB C

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 4. Write the expression: ¬A ∧ ¬B ∨ ¬A ∧ B ∨ C into the Karnaugh map, and draw rectangles/squares around the groups. What is the simplified version of this expression? AB C AB C

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 5. Write the expression: A ∧ ¬B ∨ ¬A ∧ ¬B ∨ ¬C into the Karnaugh map, and draw rectangles/squares around the groups. What is the simplified version of this expression? AB C AB C

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 6. Write the expression: A ∧ B ∧ C ∨ ¬A ∧ ¬B ∨ C into the Karnaugh map, and draw rectangles/squares around the groups. What is the simplified version of this expression? AB C AB C

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 1.Write the expression: A ∧ D ∨ B ∧ D ∨ A ∧ ¬B ∧ C ∧ D into the Karnaugh map, and draw rectangles/squares around the groups and show the simplified expression. 2.(A V B)^D CD AB

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 2. Write the expression: ¬A ∧ B ∨ ¬A ∧ ¬B ∧ D ∨ ¬A ∧ D into the Karnaugh map, and draw rectangles/squares around the groups and show the simplified expression. ¬A ^ B V ¬A ^ D CD AB

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 3. Write the expression: A ∧ ¬B ∨ ¬C ∧ ¬D ∨ A ∧ B into the Karnaugh map, and draw rectangles/squares around the groups and show the simplified expression. ¬C ^ ¬D V A CD AB

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 4. Write the expression: ¬B ∧ ¬D ∨ A ∧ ¬B ∧ C ∧ ¬D into the Karnaugh map, and draw rectangles/squares around the groups and show the simplified expression. ¬(B ^ D) CD AB

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 5. What is the expression shown in the Karnaugh map? ¬C V A^B CD AB

Manipulate Boolean expressions, including the use of Karnaugh maps to simplify Boolean expressions Boolean algebra 6. What is the expression shown in the Karnaugh map? ¬A ^ B ^ C ^ D v A ^ B ^ ¬ C ^ D CD AB

Challenge! Can you do it yet? AB C Simplify the following: (A ∧ B ∧ C) ∨( A ∧ ¬B ∧ C) ∨( A ∧ B ∧ ¬C) (A^B) V (A^C) A^(B V C)