Showing posts with label Exercises. Show all posts
Showing posts with label Exercises. Show all posts

Wednesday, February 6, 2013

Simplification 2.2


·         Enter minterms of the Boolean function into the map, then group terms




Here the term a’c is in the a=0 row  and in the 01 and 11columns (with a common 1 in the C position, note that the variable b is absent in this term and we have to present both values 0 and 1 for the variable b). The term bc’ is in the column 10 ( the variable a is absent and, therefore, is presented by 2 values 0 and 1in the rows a=0 and a=1) , the minterm abc is in the row a=1 and the column 11.




·         Top cells are  adjacent to bottom cells. Left-edge cells are adjacent to right edge  cells.
·         Note variable ordering.


Exercise 1. (1.13)

  • Prove with the aid of the laws of boolean algebra that f1(a,b,c)=f2(a,b,c), where f1(a,b,c)=a’bc+ab’c+ab’c’+a’bc’++abc’+abc and f2(a,bc)=a+b ;
  • The following 2 problems refer to the table :


 (1)  Write F1(x,y,z) as a sum of minterms.
 (2)  Write F2(x,y,z) as a product of maxterms.       
(3) Convert the sum-of-products (SOP) from standard to canonical form:
      f1(a,b,c)=ab+c ;
      f2(a,b,c)=a+b’c+a’bc ;
(4) Convert the product-of sums (POS) from standard to canonical form:
      f3(a,b,c)=a(b+c’);