Show that A(+)B(+)C = ABC +AB’ C’ + A’BC’ + A’B’C , where (+) stands for the exclusive-OR microoperation, that is, A exclusive-OR B exclusive-OR C = ABC +AB’ C’ + A’BC’ + A’B’C and verify your answer with truth table.

                                    
                                                              Computer Organization  
                                                             Digital Logic Circuits(III)
                                                                  Boolean Algebra
                                             Three-Variable Exclusive-OR(Odd) Function  
          

          It is an explanation for solving the problems of Boolean Algebra in Computer Organization.
          
          Show that  A(+)B(+)C = ABC +AB’ C’ + A’BC’ + A’B’C , where (+) stands for  the exclusive-OR microoperation,  
            
          that is,   A  exclusive-OR  B exclusive-OR  C  = ABC +AB’ C’ + A’BC’ + A’B’C  
            
          and verify your answer with truth table.
                                                                  
                                  
        See the attached file.

Attached file(s):

computer organization question 3.doc  View File