01.(c) Write the dual of the Boolean expression (U+ W) (V'U + W) 1998 02.(c) Write the dual of the Boolean expression (x+y).(x'+y') 1999 03.(c) Obtain simplified form for a Boolean expression using Karnaugh Map. 2000 F (x,y,z,w) = 4, 5, 7, 9,11, 12, 13, 15). Σ(1,3, 04.(c) If F(a, b, c, d) = 2, 4, 5, 7, 8, 10, 12, 13, 15), obtain the simplified form Σ(0, 2001 05.(c) Obtain the simplified form of a Boolean expression using Karnaugh map. 2002 F(x,y,z) = (2, 3, 6, 7) Σ 06.(c) Obtain a simplified form for the following Boolean Expression Karnaugh’s Map : 2004 F(a, b, c, d) = (0, 1, 2, 4, 5, 7, 8, 9, 10, 11, 14) Σ 07.(c) Write the SOP form of a Boolean Function F, which is represented by the following truth table: 2005 A B C F 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 1 08.(c) the equivalent Boolean Expression for the following Logic Circuit. 2007 09.(c) Write the POS form of a Boolean Function H, which represented in a truth table as follows: 2009 A B C H
01.(c) Write the dual of the Boolean expression (U+ W) (V'U + W) 1998 02.(c) Write the dual of the Boolean expression (x+y).(x'+y') 1999 03.(c) Obtain simplified form for a Boolean expression using Karnaugh Map. 2000 F (x,y,z,w) = Σ(1,3, 4, 5, 7, 9,11, 12, 13, 15). 04.(c) If F(a, b, c, d) = Σ(0, 2, 4, 5, 7, 8, 10, 12, 13, 15), obtain the simplified form 2001 05.(c) Obtain the simplified form of a Boolean expression using Karnaugh map. 2002 F(x,y,z) = Σ (2, 3, 6, 7) 06.(c) Obtain a simplified form for the following Boolean Expression Karnaugh’s Map : 2004 F(a, b, c, d) = Σ (0, 1, 2, 4, 5, 7, 8, 9, 10, 11, 14) 07.(c) Write the SOP form of a Boolean Function F, which is represented by the following truth table: 2005 A B C F 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 1 08.(c) the equivalent Boolean Expression for the following Logic Circuit. 2007 09.(c) Write the POS form of a Boolean Function H, which represented in a truth table as follows: 2009 A B C H