This action might not be possible to undo. Are you sure you want to continue?

Welcome to Scribd! Start your free trial and access books, documents and more.Find out more

1.(a) Verify algebraically X ( X + Y ) = X. (b) Represent the Boolean expression X.Y¶+Z with the help of NOR gates only. (c) Write the Product of Sums form of the function G(U,V,W), truth table representation of G is as follows : U V W G 0 0 0 1 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 0 1 1 1 0 (d) Reduce the following Boolean expression using K-Map: F(M,N,O,P)= ¦(0,1,3,4,5,6,7,9,10,11,13,15) 2. (a) State and algebraically verify Absorption Laws. (b) Write the equivalent Boolean Expression for the following Logic Circuit

P Q

(c) Write the SOP form of a Boolean function G, which is represented in a truth table as follows: P Q R G 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 1 (d) Reduce the following Boolean Expression using K-Map: F(U,V,W,Z)= (0,1,2,4,5,6,8,10) 3 a. . Reduce the following Boolean Expression using K-Map: F(A,B,C,D)= (0,1,2,4,5,6,8,10) b) State and verify Demorgan¶s Laws.

MAMS/CLASS XII/COMP.SC. Page 1

**BOOLEAN ALGEBRA ASSIGNMENT- Class XII
**

c) State and prove Absorption Laws d) Write the POS form of a Boolean function F, which is represented in a truth table as follows: U 0 0 0 0 1 1 1 1 V 0 0 1 1 0 0 1 1 W 0 1 0 1 0 1 0 1 F 1 0 1 0 1 0 1 1

(c) Reduce the following Boolean Expression using K-Map: F(U,V,W,Z)=4(0,1,2,4,5,6,8,10) 4.a). Verify the following using truth table: U.(U`+V)=(U+V) b). Write the POS form of a Boolean Function F, which is represented in a truth table as follows: A B C F 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 c). Reduce the following Boolean Expression using K-Map: F(U,V,W,Z)=7(0,1,2,4,5,6,8,12) d). Reduce the following Boolean Expression using K-Map: F(A,B,C,D)=7(3,4,5,6,7,13,15) e) Verify the following algebraically; (A`+B`).(A+B) = A`.B+A.B` f) What is the Principal of Duality in Boolean Algebra? g) Convert (X`Y)(X`Z`) into canonical SOP form. h) State and verify absorption law using truth table. i) prove X`Y+Y¶Z = X¶YZ+X¶YZ`+XY¶Z+X¶Y¶Z algebraically. j) Obtain Simplify form for a Boolean expression : F(x,y,z,w) = 7(1,3,4,5,7,9,11,12,13,15) using K-map.

MAMS/CLASS XII/COMP.SC. Page 2

- Classes and Objects
- 00C__QuickReview2011
- Quick Revision in Binary Files in C++
- Quick Revision in Text Files in C++
- Viva General
- Net 1
- Xii Viva Ques-1
- SQL Assignments
- Inheritance
- ReviewConstDestr
- Revision c++
- Control Statements
- Arrays Notes
- Boolean Algebra
- Data Representation
- Data Representation
- sample papers Computer Science Class XII
- Timer in C++
- Sample C++ Project
- List of Presentation Topics for Class XI
- Structures
- Computer Science Sample Paper 12th 1
- Functions Q Ans
- SQL Notes

Boolean Algebra questions

Boolean Algebra questions

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd