It is an explanation for solving the problems of Boolean Algebra in Computer Organization. Using De Morgan’s theorem, show that (a) (A + B)’(A’ + B’)’ = 0 (b) A + A’B + A’B’ = 1

                                                             Computer Organization  
                                                             Digital Logic Circuits(VI)
                                                                  Boolean Algebra
                                                               Logic Microoperation
                                                                 Sum of Products Form
                                                                Product of Sums Form
          

          It is an explanation for solving the problems of Boolean Algebra in Computer Organization.
          
             Using De Morgan’s theorem, show that
                        (a)   (A + B)’(A’ + B’)’ = 0  
                        (b)   A + A’B + A’B’ = 1
                                                                  
                                  
          See the attached file.

Attached file(s):

computer organization question 6.doc  View File