Unformatted text preview: B B A D C B A f C B A BD AB D C B A f + = + + = ) , , , ( ) , , , ( β α Q5. Find the minimum POS expression of the following Boolean function. F (a, b, c, d)= Σ m(1, 4, 5, 6, 7, 9, 11, 13) + Σ dc(3, 10, 14, 15) Q6. A Boolean function expression in maxterm representation is given by F(A, B, C, D) = Π M (0, 2, 3, 7, 8, 9, 10, 13) Use Kmap to find the product of sum (POS) representation of F(A, B, C, D) if minimum maxterm is required. Q7. Using the QuineMcCluskey method to simplify the Boolean expression and the result should be POS form. (hint: you may carry the grouping according to the number of 0, instead of 1.) f ( w,x,y,z ) = ∏ M (3,4,5,8,9,11,13,14,15)...
View
Full
Document
This note was uploaded on 01/11/2011 for the course EE 2000 taught by Professor Vancwting during the Fall '07 term at City University of Hong Kong.
 Fall '07
 VanCWTing

Click to edit the document details