Page 37 - Digital Electronics Handout_Neat
P. 37

Exercise

            1 Show that:  F  (A  B  C )(A  B  C )  A  C

            2 Simplify the Boolean function:  F  ABCD  ABCD  ABCD  ABCD  ABCD  ABCD

            3 Show that: F   ( A  B  AB)(A  C  AC)   A  BC

            Material for further exploration:

            Nave,      R.       De       Morgan’s       Theorem       Retrieved      from:
            http://www.hyperphysics- phyastr.gsu.edu/base/Electronic/DeMorgan.html3

            Morris, Mano, (1997) Computer Systems Architecture

            William Stallings (2006) Computer organization and architecture p 701-702

            Exercise for self-assessment

            1 Define the following laws of Boolean algebra giving examples in each case:
               •  Commutative
               •  Distributive
               •  Identity

            1  De Morgan’s theorem is significant in design of digital logic circuits. Use De Morgan’s theorem to
                simplify the Boolean expressions below:

                ( AB  C)( A  B)(B  AC )

            3 Which postulates in Boolean algebra have the same effects as in conventional algebra?



           Lecture 4 Video Lecture




        Watch the complete explanation of this chapter here:









           Lecture 4 Online Quiz





        Test your understanding by completing the quiz:


                                                                37
   32   33   34   35   36   37   38   39   40   41   42