SlideShare ist ein Scribd-Unternehmen logo
1 von 21
IT2001PA
Engineering Essentials (2/2)


Chapter 8 - Applications of Boolean
Algebra
 Lecturer Name
lecturer_email@ite.edu.sg
                               Nov 20, 2012
Contact Number
Chapter 8 - Applications of Boolean Algebra


Lesson Objectives
Upon completion of this topic, you should be able to:
   Apply Boolean algebra to solve combination logic of up
    to 2 variables.




    IT2001PA Engineering Essentials (2/2)           2
Chapter 8 - Applications of Boolean Algebra


Specific Objectives
  Students should be able to :
   Determine the output logic expression from a given
    logic circuit.
      Use Boolean algebra to simplify logic expressions.




      IT2001PA Engineering Essentials (2/2)
Chapter 8 - Applications of Boolean Algebra


Example 1
   Write the Boolean equation for the circuit




   Use DeMorgan’s Theorem and then Boolean Algebra
    rules to simplify the equation. Draw the simplified
    circuit.




    IT2001PA Engineering Essentials (2/2)          4
Chapter 8 - Applications of Boolean Algebra


Example 1 (Solution)




   Boolean equation at X, X = (AB)●B
    Apply De Morgan’s               X = (A + B) ● B
    theorem:          (Use parentheses, () to maintain proper grouping)

    Apply Distributive                   X = AB + BB
    Law:
    Apply Boolean Algebra                     = AB + 0
    rule:                                     = AB
    IT2001PA Engineering Essentials (2/2)                       5
Chapter 8 - Applications of Boolean Algebra


Example 1 (Solution)
    The simplified equation will be
                           X=AB
    To draw the simplified circuit, first write down the
     inputs (A and B), and the output (X),
    then insert the corresponding gates




    IT2001PA Engineering Essentials (2/2)                   6
Chapter 8 - Applications of Boolean Algebra


Example 2
   Write the Boolean equation for the circuit.




   Use DeMorgan’s Theorem and then Boolean Algebra
    rules to simplify the equation. Draw the simplified
    circuit.


    IT2001PA Engineering Essentials (2/2)          7
Chapter 8 - Applications of Boolean Algebra


Example 2 (Solution)




   X = B●(A+C)+C, Simplifying equation:
    Boolean Equation at X:                     X = B●(A + C) + C
    Apply Distributive Law:                    X = BA + BC + C
    Since C is common for term 2 and term 3:   X = BA + C●(B + 1)
    Apply (B + 1) = 1:                         X = BA + C● 1
    Apply C●1 = C:                             X = BA + C
    Apply BA = AB:                              X = AB + C
    IT2001PA Engineering Essentials (2/2)                           8
Chapter 8 - Applications of Boolean Algebra


Example 2 (Solution)
   The simplified equation will be:
                 X = AB + C
   To draw the simplified circuit, first write down the inputs
    (A, B and C),and the output (X),
   then insert the corresponding gates.
   Finally, join the gates.




    IT2001PA Engineering Essentials (2/2)                9
Chapter 8 - Applications of Boolean Algebra


Example 3
   Write the Boolean equation for the circuit.




   Use DeMorgan’s Theorem and then Boolean Algebra
    rules to simplify the equation. Draw the simplified
    circuit.


    IT2001PA Engineering Essentials (2/2)          10
Chapter 8 - Applications of Boolean Algebra


Example 3 (Solution)




 X = (A+B)●BC+A
 Simplifying equation:
  Boolean Equation at X:                      X = (A+B) ● BC + A
    Apply Distributive Law:                   X = ABC + BBC + A
    Apply BBC = BC:                           X = ABC + BC+ A
    Since BC is common for term 1 and term 2: X = BC (A +1) + A
    Apply (A + 1) = 1:                        X = BC + A

    IT2001PA Engineering Essentials (2/2)                    11
Chapter 8 - Applications of Boolean Algebra


Example 3 (Solution)
   The simplified equation will be:
                  X = BC + A
   To draw the simplified circuit, first write down the inputs
    (A, B and C),and the output (X),
   then insert the corresponding gates.
   Finally, join the gates.




    IT2001PA Engineering Essentials (2/2)                12
Chapter 8 - Applications of Boolean Algebra


Example 4
   Write the Boolean equation for the circuit.




   Use DeMorgan’s Theorem and then Boolean Algebra
    rules to simplify the equation. Draw the simplified
    circuit.

    IT2001PA Engineering Essentials (2/2)          13
Chapter 8 - Applications of Boolean Algebra


Example 4 (Solution)




   X = (A+B)●B+(B)+(BC)




    IT2001PA Engineering Essentials (2/2)     14
Chapter 8 - Applications of Boolean Algebra


Example 4 (Solution)
   Simplifying equation:
Boolean Equation at X:                        X = (A + B)●B + B + BC
Apply Distributive Law:                       X = AB + BB + B + BC
Apply (BB = 0):                               X = AB + 0 + B + BC
Apply (AB + 0) = AB:                          X = AB + B + BC
Since B is common for term 1 and term 2:X = B●(A + 1) + BC
Apply (A + 1) = 1:                            X = B ● 1 + BC
Apply (B●1) = B:                              X = B + BC
Apply (B +BC) = B+C:                          X=B+C

    IT2001PA Engineering Essentials (2/2)                       15
Chapter 8 - Applications of Boolean Algebra


Example 4 (Solution)
   The simplified equation will be:
                   X=B+A
   To draw the simplified circuit, first write down the inputs (A,
    B and C),and the output (X),
   then insert the corresponding gates.
   Finally, join the gates.




    IT2001PA Engineering Essentials (2/2)                    16
Chapter 8 - Applications of Boolean Algebra


Example 5
   Write the Boolean equation for the circuit.




   Use DeMorgan’s Theorem and then Boolean Algebra
    rules to simplify the equation. Draw the simplified
    circuit.

    IT2001PA Engineering Essentials (2/2)          17
Chapter 8 - Applications of Boolean Algebra


Example 5 (Solution)


   X = AB●(C+D)●AB


Simplifying Equation:


Boolean Equation at X:                        X= AB●(C+D)●AB
Apply Demorgan’s Thereom:                     X= AB + (C+D) + AB
Apply C+D = C+D:                              X= AB + C+D + AB
Apply AB + AB = AB:                           X= AB + C+D
Apply AB = A + B:                             X= A + B + C+D

    IT2001PA Engineering Essentials (2/2)                          18
Chapter 8 - Applications of Boolean Algebra


Example 5 (Solution)
   The simplified equation will be:
                X=A+B+C+D
   To draw the simplified circuit, first write down the inputs (A,
    B,C and D), and the output (X),
   then insert the corresponding gates.
   Finally, join the gates.




    IT2001PA Engineering Essentials (2/2)                    19
Chapter 8 - Applications of Boolean Algebra


Summary
   Steps taken to simplify a combination logic circuit:
       Write down the expression of a given Combination Logic
        Circuit.
       Simplify the expression using Boolean Algebra Theorem.
       Draw the Logic Circuit using the simplified Logic
        Expression.




    IT2001PA Engineering Essentials (2/2)                   20
Chapter 8 - Applications of Boolean Algebra


Next Lesson




    IT2001PA Engineering Essentials (2/2)     21

Weitere ähnliche Inhalte

Was ist angesagt?

Elliptic Curve Cryptography
Elliptic Curve CryptographyElliptic Curve Cryptography
Elliptic Curve Cryptography
Kelly Bresnahan
 
Boolean Algebra by SUKHDEEP SINGH
Boolean Algebra by SUKHDEEP SINGHBoolean Algebra by SUKHDEEP SINGH
Boolean Algebra by SUKHDEEP SINGH
Sukhdeep Bisht
 

Was ist angesagt? (20)

Elliptic Curve Cryptography
Elliptic Curve CryptographyElliptic Curve Cryptography
Elliptic Curve Cryptography
 
NET_Solved ans
NET_Solved ansNET_Solved ans
NET_Solved ans
 
Presentation of my master thesis - Image Processing
Presentation of my master thesis - Image ProcessingPresentation of my master thesis - Image Processing
Presentation of my master thesis - Image Processing
 
TEM Winterworkshop 2011: electron diffraction
TEM Winterworkshop 2011: electron diffractionTEM Winterworkshop 2011: electron diffraction
TEM Winterworkshop 2011: electron diffraction
 
Branch and bound
Branch and boundBranch and bound
Branch and bound
 
Graphs
GraphsGraphs
Graphs
 
Digital logic circuit
Digital logic circuitDigital logic circuit
Digital logic circuit
 
Power Optimization using Reversible Gates for Booth’s Multiplier
Power Optimization using Reversible Gates for Booth’s MultiplierPower Optimization using Reversible Gates for Booth’s Multiplier
Power Optimization using Reversible Gates for Booth’s Multiplier
 
Boolean Algebra by SUKHDEEP SINGH
Boolean Algebra by SUKHDEEP SINGHBoolean Algebra by SUKHDEEP SINGH
Boolean Algebra by SUKHDEEP SINGH
 
Computation Assignment Help
Computation Assignment Help Computation Assignment Help
Computation Assignment Help
 
1524 elliptic curve cryptography
1524 elliptic curve cryptography1524 elliptic curve cryptography
1524 elliptic curve cryptography
 
Pixel Relationships Examples
Pixel Relationships ExamplesPixel Relationships Examples
Pixel Relationships Examples
 
IRJET- An Efficient Reverse Converter for the Three Non-Coprime Moduli Set {4...
IRJET- An Efficient Reverse Converter for the Three Non-Coprime Moduli Set {4...IRJET- An Efficient Reverse Converter for the Three Non-Coprime Moduli Set {4...
IRJET- An Efficient Reverse Converter for the Three Non-Coprime Moduli Set {4...
 
The Digital Image Processing Q@A
The Digital Image Processing Q@AThe Digital Image Processing Q@A
The Digital Image Processing Q@A
 
An ElGamal Encryption Scheme of Adjacency Matrix and Finite Machines
An ElGamal Encryption Scheme of Adjacency Matrix and Finite MachinesAn ElGamal Encryption Scheme of Adjacency Matrix and Finite Machines
An ElGamal Encryption Scheme of Adjacency Matrix and Finite Machines
 
2D Geometry QA 11
2D Geometry QA 112D Geometry QA 11
2D Geometry QA 11
 
Cryptography
CryptographyCryptography
Cryptography
 
Fd25951958
Fd25951958Fd25951958
Fd25951958
 
Digital Electronics University Question Bank
Digital Electronics University Question BankDigital Electronics University Question Bank
Digital Electronics University Question Bank
 
Digtial Image Processing Q@A
Digtial Image Processing Q@ADigtial Image Processing Q@A
Digtial Image Processing Q@A
 

Andere mochten auch

Web topic 5 text formatting
Web topic 5  text formattingWeb topic 5  text formatting
Web topic 5 text formatting
CK Yang
 
Web topic 10 2 web design basics
Web topic 10 2  web design basicsWeb topic 10 2  web design basics
Web topic 10 2 web design basics
CK Yang
 
Web topic 33 publish websites
Web topic 33  publish websitesWeb topic 33  publish websites
Web topic 33 publish websites
CK Yang
 
Ee1 chapter3 resistors_inseries
Ee1 chapter3 resistors_inseriesEe1 chapter3 resistors_inseries
Ee1 chapter3 resistors_inseries
CK Yang
 
Web topic 24 usage of web browser
Web topic 24  usage of web browserWeb topic 24  usage of web browser
Web topic 24 usage of web browser
CK Yang
 
Web topic 9 navigation and link
Web topic 9  navigation and linkWeb topic 9  navigation and link
Web topic 9 navigation and link
CK Yang
 
Web topic 30 ensure web contents meet
Web topic 30   ensure web contents meetWeb topic 30   ensure web contents meet
Web topic 30 ensure web contents meet
CK Yang
 
Web topic 32 validate web contents
Web topic 32  validate web contentsWeb topic 32  validate web contents
Web topic 32 validate web contents
CK Yang
 
Ee2 chapter4 parity_checking
Ee2 chapter4 parity_checkingEe2 chapter4 parity_checking
Ee2 chapter4 parity_checking
CK Yang
 
Ee2 chapter14 ic_counters
Ee2 chapter14 ic_countersEe2 chapter14 ic_counters
Ee2 chapter14 ic_counters
CK Yang
 
Ee2 chapter2 arithmetic_operation
Ee2 chapter2 arithmetic_operationEe2 chapter2 arithmetic_operation
Ee2 chapter2 arithmetic_operation
CK Yang
 
Ee1 chapter6 power_energy&efficiency
Ee1 chapter6 power_energy&efficiencyEe1 chapter6 power_energy&efficiency
Ee1 chapter6 power_energy&efficiency
CK Yang
 
Ee study notes
Ee study notesEe study notes
Ee study notes
CK Yang
 
Ee2 chapter12 flip_flop
Ee2 chapter12 flip_flopEe2 chapter12 flip_flop
Ee2 chapter12 flip_flop
CK Yang
 
Web topic 8 listings in html
Web topic 8  listings in htmlWeb topic 8  listings in html
Web topic 8 listings in html
CK Yang
 
Ee1 chapter11 ac_circuits
Ee1 chapter11 ac_circuitsEe1 chapter11 ac_circuits
Ee1 chapter11 ac_circuits
CK Yang
 
Pharm Exam Study Guide 1 & 2 Presentation1
Pharm Exam Study Guide 1 & 2 Presentation1Pharm Exam Study Guide 1 & 2 Presentation1
Pharm Exam Study Guide 1 & 2 Presentation1
Carrie Wyatt
 

Andere mochten auch (20)

Web topic 5 text formatting
Web topic 5  text formattingWeb topic 5  text formatting
Web topic 5 text formatting
 
Web topic 10 2 web design basics
Web topic 10 2  web design basicsWeb topic 10 2  web design basics
Web topic 10 2 web design basics
 
Ten things that are happening around us and ten ways India's students batch o...
Ten things that are happening around us and ten ways India's students batch o...Ten things that are happening around us and ten ways India's students batch o...
Ten things that are happening around us and ten ways India's students batch o...
 
Web topic 33 publish websites
Web topic 33  publish websitesWeb topic 33  publish websites
Web topic 33 publish websites
 
Ee1 chapter3 resistors_inseries
Ee1 chapter3 resistors_inseriesEe1 chapter3 resistors_inseries
Ee1 chapter3 resistors_inseries
 
Web topic 24 usage of web browser
Web topic 24  usage of web browserWeb topic 24  usage of web browser
Web topic 24 usage of web browser
 
Dart Unit 08 Sanitization
Dart Unit 08 SanitizationDart Unit 08 Sanitization
Dart Unit 08 Sanitization
 
Web topic 9 navigation and link
Web topic 9  navigation and linkWeb topic 9  navigation and link
Web topic 9 navigation and link
 
Web topic 30 ensure web contents meet
Web topic 30   ensure web contents meetWeb topic 30   ensure web contents meet
Web topic 30 ensure web contents meet
 
Web topic 32 validate web contents
Web topic 32  validate web contentsWeb topic 32  validate web contents
Web topic 32 validate web contents
 
Ee2 chapter4 parity_checking
Ee2 chapter4 parity_checkingEe2 chapter4 parity_checking
Ee2 chapter4 parity_checking
 
Ee2 chapter14 ic_counters
Ee2 chapter14 ic_countersEe2 chapter14 ic_counters
Ee2 chapter14 ic_counters
 
Ee2 chapter2 arithmetic_operation
Ee2 chapter2 arithmetic_operationEe2 chapter2 arithmetic_operation
Ee2 chapter2 arithmetic_operation
 
Ee1 chapter6 power_energy&efficiency
Ee1 chapter6 power_energy&efficiencyEe1 chapter6 power_energy&efficiency
Ee1 chapter6 power_energy&efficiency
 
Ee study notes
Ee study notesEe study notes
Ee study notes
 
Ee2 chapter12 flip_flop
Ee2 chapter12 flip_flopEe2 chapter12 flip_flop
Ee2 chapter12 flip_flop
 
Web topic 8 listings in html
Web topic 8  listings in htmlWeb topic 8  listings in html
Web topic 8 listings in html
 
Ee1 chapter11 ac_circuits
Ee1 chapter11 ac_circuitsEe1 chapter11 ac_circuits
Ee1 chapter11 ac_circuits
 
Pharmacology III Review
Pharmacology III ReviewPharmacology III Review
Pharmacology III Review
 
Pharm Exam Study Guide 1 & 2 Presentation1
Pharm Exam Study Guide 1 & 2 Presentation1Pharm Exam Study Guide 1 & 2 Presentation1
Pharm Exam Study Guide 1 & 2 Presentation1
 

Ähnlich wie Ee2 chapter8 applicationsof_booleanalgebra

Basic gates and boolean algebra
Basic gates and boolean algebraBasic gates and boolean algebra
Basic gates and boolean algebra
Sudheesh S Madhav
 
Ee2 chapter9 logic_diagram
Ee2 chapter9 logic_diagramEe2 chapter9 logic_diagram
Ee2 chapter9 logic_diagram
CK Yang
 

Ähnlich wie Ee2 chapter8 applicationsof_booleanalgebra (20)

3. Boolean Algebra.pptx
3. Boolean Algebra.pptx3. Boolean Algebra.pptx
3. Boolean Algebra.pptx
 
Dee2034 chapter 2 boolean algebra part c
Dee2034 chapter 2 boolean algebra part cDee2034 chapter 2 boolean algebra part c
Dee2034 chapter 2 boolean algebra part c
 
PDT DC015 Chapter 2 Computer System 2017/2018 (f)
PDT DC015 Chapter 2 Computer System 2017/2018 (f)PDT DC015 Chapter 2 Computer System 2017/2018 (f)
PDT DC015 Chapter 2 Computer System 2017/2018 (f)
 
PST SC015 Chapter 2 Computer System (III) 2017/2018
PST SC015 Chapter 2 Computer System (III) 2017/2018PST SC015 Chapter 2 Computer System (III) 2017/2018
PST SC015 Chapter 2 Computer System (III) 2017/2018
 
sop_pos(DE).pptx
sop_pos(DE).pptxsop_pos(DE).pptx
sop_pos(DE).pptx
 
Basic gates and boolean algebra
Basic gates and boolean algebraBasic gates and boolean algebra
Basic gates and boolean algebra
 
Unit 02
Unit 02Unit 02
Unit 02
 
Digital 4-bit Comprator
Digital 4-bit CompratorDigital 4-bit Comprator
Digital 4-bit Comprator
 
NOTA TOPIK 2_SSK20152 (3).pptx
NOTA TOPIK 2_SSK20152 (3).pptxNOTA TOPIK 2_SSK20152 (3).pptx
NOTA TOPIK 2_SSK20152 (3).pptx
 
digital logic design Chapter 2 boolean_algebra_&_logic_gates
digital logic design Chapter 2 boolean_algebra_&_logic_gatesdigital logic design Chapter 2 boolean_algebra_&_logic_gates
digital logic design Chapter 2 boolean_algebra_&_logic_gates
 
Chapter 4: Combinational Logic
Chapter 4: Combinational LogicChapter 4: Combinational Logic
Chapter 4: Combinational Logic
 
Dee2034 chapter 2 boolean algebra part b
Dee2034 chapter 2 boolean algebra part bDee2034 chapter 2 boolean algebra part b
Dee2034 chapter 2 boolean algebra part b
 
Chapter 2 boolean part c
Chapter 2 boolean part cChapter 2 boolean part c
Chapter 2 boolean part c
 
EE8351 DLC
EE8351 DLCEE8351 DLC
EE8351 DLC
 
Ec2203 digital electronics questions anna university by www.annaunivedu.org
Ec2203 digital electronics questions anna university by www.annaunivedu.orgEc2203 digital electronics questions anna university by www.annaunivedu.org
Ec2203 digital electronics questions anna university by www.annaunivedu.org
 
Lec9 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Com...
Lec9 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Com...Lec9 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Com...
Lec9 Intro to Computer Engineering by Hsien-Hsin Sean Lee Georgia Tech -- Com...
 
Lesson Week 1-2.pptx
Lesson Week 1-2.pptxLesson Week 1-2.pptx
Lesson Week 1-2.pptx
 
Lecture 8.pptx
Lecture 8.pptxLecture 8.pptx
Lecture 8.pptx
 
Ee2 chapter9 logic_diagram
Ee2 chapter9 logic_diagramEe2 chapter9 logic_diagram
Ee2 chapter9 logic_diagram
 
4 logic circuit optimisation
4 logic circuit optimisation4 logic circuit optimisation
4 logic circuit optimisation
 

Mehr von CK Yang

Web topic 27 class test
Web topic 27  class testWeb topic 27  class test
Web topic 27 class test
CK Yang
 
Web topic 31 setup remote site
Web topic 31  setup remote siteWeb topic 31  setup remote site
Web topic 31 setup remote site
CK Yang
 
Web topic 29 w3 c page validation
Web topic 29  w3 c page validationWeb topic 29  w3 c page validation
Web topic 29 w3 c page validation
CK Yang
 
Web topic 29 w3 c page validation
Web topic 29  w3 c page validationWeb topic 29  w3 c page validation
Web topic 29 w3 c page validation
CK Yang
 
Web topic 28. w3 c standards and guidelines
Web topic 28. w3 c standards and guidelinesWeb topic 28. w3 c standards and guidelines
Web topic 28. w3 c standards and guidelines
CK Yang
 
Web topic 26 browser compatibilty and security
Web topic 26  browser compatibilty and securityWeb topic 26  browser compatibilty and security
Web topic 26 browser compatibilty and security
CK Yang
 
Web topic 25 mobile optimized website
Web topic 25  mobile optimized websiteWeb topic 25  mobile optimized website
Web topic 25 mobile optimized website
CK Yang
 
Web topic 23 web accessibility
Web topic 23  web accessibilityWeb topic 23  web accessibility
Web topic 23 web accessibility
CK Yang
 
Web topic 22 validation on web forms
Web topic 22  validation on web formsWeb topic 22  validation on web forms
Web topic 22 validation on web forms
CK Yang
 
Web topic 21 pass info via javascript
Web topic 21  pass info via javascriptWeb topic 21  pass info via javascript
Web topic 21 pass info via javascript
CK Yang
 
Web topic 20 2 html forms
Web topic 20 2  html formsWeb topic 20 2  html forms
Web topic 20 2 html forms
CK Yang
 
Web topic 20 1 html forms
Web topic 20 1  html formsWeb topic 20 1  html forms
Web topic 20 1 html forms
CK Yang
 
Web topic 18 conflict resolution in css
Web topic 18  conflict resolution in cssWeb topic 18  conflict resolution in css
Web topic 18 conflict resolution in css
CK Yang
 
Web topic 17 font family in css
Web topic 17  font family in cssWeb topic 17  font family in css
Web topic 17 font family in css
CK Yang
 
Web topic 16 css workflow
Web topic 16  css workflowWeb topic 16  css workflow
Web topic 16 css workflow
CK Yang
 
Web topic 15 2 basic css layout
Web topic 15 2  basic css layoutWeb topic 15 2  basic css layout
Web topic 15 2 basic css layout
CK Yang
 
Web topic 15 1 basic css layout
Web topic 15 1  basic css layoutWeb topic 15 1  basic css layout
Web topic 15 1 basic css layout
CK Yang
 
Web topic 14 cascading style sheets
Web topic 14  cascading style sheetsWeb topic 14  cascading style sheets
Web topic 14 cascading style sheets
CK Yang
 
Web topic 13 html validation tools
Web topic 13  html validation toolsWeb topic 13  html validation tools
Web topic 13 html validation tools
CK Yang
 
Web topic 12 tables in html
Web topic 12  tables in htmlWeb topic 12  tables in html
Web topic 12 tables in html
CK Yang
 

Mehr von CK Yang (20)

Web topic 27 class test
Web topic 27  class testWeb topic 27  class test
Web topic 27 class test
 
Web topic 31 setup remote site
Web topic 31  setup remote siteWeb topic 31  setup remote site
Web topic 31 setup remote site
 
Web topic 29 w3 c page validation
Web topic 29  w3 c page validationWeb topic 29  w3 c page validation
Web topic 29 w3 c page validation
 
Web topic 29 w3 c page validation
Web topic 29  w3 c page validationWeb topic 29  w3 c page validation
Web topic 29 w3 c page validation
 
Web topic 28. w3 c standards and guidelines
Web topic 28. w3 c standards and guidelinesWeb topic 28. w3 c standards and guidelines
Web topic 28. w3 c standards and guidelines
 
Web topic 26 browser compatibilty and security
Web topic 26  browser compatibilty and securityWeb topic 26  browser compatibilty and security
Web topic 26 browser compatibilty and security
 
Web topic 25 mobile optimized website
Web topic 25  mobile optimized websiteWeb topic 25  mobile optimized website
Web topic 25 mobile optimized website
 
Web topic 23 web accessibility
Web topic 23  web accessibilityWeb topic 23  web accessibility
Web topic 23 web accessibility
 
Web topic 22 validation on web forms
Web topic 22  validation on web formsWeb topic 22  validation on web forms
Web topic 22 validation on web forms
 
Web topic 21 pass info via javascript
Web topic 21  pass info via javascriptWeb topic 21  pass info via javascript
Web topic 21 pass info via javascript
 
Web topic 20 2 html forms
Web topic 20 2  html formsWeb topic 20 2  html forms
Web topic 20 2 html forms
 
Web topic 20 1 html forms
Web topic 20 1  html formsWeb topic 20 1  html forms
Web topic 20 1 html forms
 
Web topic 18 conflict resolution in css
Web topic 18  conflict resolution in cssWeb topic 18  conflict resolution in css
Web topic 18 conflict resolution in css
 
Web topic 17 font family in css
Web topic 17  font family in cssWeb topic 17  font family in css
Web topic 17 font family in css
 
Web topic 16 css workflow
Web topic 16  css workflowWeb topic 16  css workflow
Web topic 16 css workflow
 
Web topic 15 2 basic css layout
Web topic 15 2  basic css layoutWeb topic 15 2  basic css layout
Web topic 15 2 basic css layout
 
Web topic 15 1 basic css layout
Web topic 15 1  basic css layoutWeb topic 15 1  basic css layout
Web topic 15 1 basic css layout
 
Web topic 14 cascading style sheets
Web topic 14  cascading style sheetsWeb topic 14  cascading style sheets
Web topic 14 cascading style sheets
 
Web topic 13 html validation tools
Web topic 13  html validation toolsWeb topic 13  html validation tools
Web topic 13 html validation tools
 
Web topic 12 tables in html
Web topic 12  tables in htmlWeb topic 12  tables in html
Web topic 12 tables in html
 

Ee2 chapter8 applicationsof_booleanalgebra

  • 1. IT2001PA Engineering Essentials (2/2) Chapter 8 - Applications of Boolean Algebra Lecturer Name lecturer_email@ite.edu.sg Nov 20, 2012 Contact Number
  • 2. Chapter 8 - Applications of Boolean Algebra Lesson Objectives Upon completion of this topic, you should be able to:  Apply Boolean algebra to solve combination logic of up to 2 variables. IT2001PA Engineering Essentials (2/2) 2
  • 3. Chapter 8 - Applications of Boolean Algebra Specific Objectives Students should be able to :  Determine the output logic expression from a given logic circuit.  Use Boolean algebra to simplify logic expressions. IT2001PA Engineering Essentials (2/2)
  • 4. Chapter 8 - Applications of Boolean Algebra Example 1  Write the Boolean equation for the circuit  Use DeMorgan’s Theorem and then Boolean Algebra rules to simplify the equation. Draw the simplified circuit. IT2001PA Engineering Essentials (2/2) 4
  • 5. Chapter 8 - Applications of Boolean Algebra Example 1 (Solution)  Boolean equation at X, X = (AB)●B Apply De Morgan’s X = (A + B) ● B theorem: (Use parentheses, () to maintain proper grouping) Apply Distributive X = AB + BB Law: Apply Boolean Algebra = AB + 0 rule: = AB IT2001PA Engineering Essentials (2/2) 5
  • 6. Chapter 8 - Applications of Boolean Algebra Example 1 (Solution)  The simplified equation will be X=AB  To draw the simplified circuit, first write down the inputs (A and B), and the output (X),  then insert the corresponding gates IT2001PA Engineering Essentials (2/2) 6
  • 7. Chapter 8 - Applications of Boolean Algebra Example 2  Write the Boolean equation for the circuit.  Use DeMorgan’s Theorem and then Boolean Algebra rules to simplify the equation. Draw the simplified circuit. IT2001PA Engineering Essentials (2/2) 7
  • 8. Chapter 8 - Applications of Boolean Algebra Example 2 (Solution)  X = B●(A+C)+C, Simplifying equation: Boolean Equation at X: X = B●(A + C) + C Apply Distributive Law: X = BA + BC + C Since C is common for term 2 and term 3: X = BA + C●(B + 1) Apply (B + 1) = 1: X = BA + C● 1 Apply C●1 = C: X = BA + C Apply BA = AB: X = AB + C IT2001PA Engineering Essentials (2/2) 8
  • 9. Chapter 8 - Applications of Boolean Algebra Example 2 (Solution)  The simplified equation will be: X = AB + C  To draw the simplified circuit, first write down the inputs (A, B and C),and the output (X),  then insert the corresponding gates.  Finally, join the gates. IT2001PA Engineering Essentials (2/2) 9
  • 10. Chapter 8 - Applications of Boolean Algebra Example 3  Write the Boolean equation for the circuit.  Use DeMorgan’s Theorem and then Boolean Algebra rules to simplify the equation. Draw the simplified circuit. IT2001PA Engineering Essentials (2/2) 10
  • 11. Chapter 8 - Applications of Boolean Algebra Example 3 (Solution)  X = (A+B)●BC+A  Simplifying equation: Boolean Equation at X: X = (A+B) ● BC + A Apply Distributive Law: X = ABC + BBC + A Apply BBC = BC: X = ABC + BC+ A Since BC is common for term 1 and term 2: X = BC (A +1) + A Apply (A + 1) = 1: X = BC + A IT2001PA Engineering Essentials (2/2) 11
  • 12. Chapter 8 - Applications of Boolean Algebra Example 3 (Solution)  The simplified equation will be: X = BC + A  To draw the simplified circuit, first write down the inputs (A, B and C),and the output (X),  then insert the corresponding gates.  Finally, join the gates. IT2001PA Engineering Essentials (2/2) 12
  • 13. Chapter 8 - Applications of Boolean Algebra Example 4  Write the Boolean equation for the circuit.  Use DeMorgan’s Theorem and then Boolean Algebra rules to simplify the equation. Draw the simplified circuit. IT2001PA Engineering Essentials (2/2) 13
  • 14. Chapter 8 - Applications of Boolean Algebra Example 4 (Solution)  X = (A+B)●B+(B)+(BC) IT2001PA Engineering Essentials (2/2) 14
  • 15. Chapter 8 - Applications of Boolean Algebra Example 4 (Solution)  Simplifying equation: Boolean Equation at X: X = (A + B)●B + B + BC Apply Distributive Law: X = AB + BB + B + BC Apply (BB = 0): X = AB + 0 + B + BC Apply (AB + 0) = AB: X = AB + B + BC Since B is common for term 1 and term 2:X = B●(A + 1) + BC Apply (A + 1) = 1: X = B ● 1 + BC Apply (B●1) = B: X = B + BC Apply (B +BC) = B+C: X=B+C IT2001PA Engineering Essentials (2/2) 15
  • 16. Chapter 8 - Applications of Boolean Algebra Example 4 (Solution)  The simplified equation will be: X=B+A  To draw the simplified circuit, first write down the inputs (A, B and C),and the output (X),  then insert the corresponding gates.  Finally, join the gates. IT2001PA Engineering Essentials (2/2) 16
  • 17. Chapter 8 - Applications of Boolean Algebra Example 5  Write the Boolean equation for the circuit.  Use DeMorgan’s Theorem and then Boolean Algebra rules to simplify the equation. Draw the simplified circuit. IT2001PA Engineering Essentials (2/2) 17
  • 18. Chapter 8 - Applications of Boolean Algebra Example 5 (Solution) X = AB●(C+D)●AB Simplifying Equation: Boolean Equation at X: X= AB●(C+D)●AB Apply Demorgan’s Thereom: X= AB + (C+D) + AB Apply C+D = C+D: X= AB + C+D + AB Apply AB + AB = AB: X= AB + C+D Apply AB = A + B: X= A + B + C+D IT2001PA Engineering Essentials (2/2) 18
  • 19. Chapter 8 - Applications of Boolean Algebra Example 5 (Solution)  The simplified equation will be: X=A+B+C+D  To draw the simplified circuit, first write down the inputs (A, B,C and D), and the output (X),  then insert the corresponding gates.  Finally, join the gates. IT2001PA Engineering Essentials (2/2) 19
  • 20. Chapter 8 - Applications of Boolean Algebra Summary  Steps taken to simplify a combination logic circuit:  Write down the expression of a given Combination Logic Circuit.  Simplify the expression using Boolean Algebra Theorem.  Draw the Logic Circuit using the simplified Logic Expression. IT2001PA Engineering Essentials (2/2) 20
  • 21. Chapter 8 - Applications of Boolean Algebra Next Lesson IT2001PA Engineering Essentials (2/2) 21