CBSE Guess > Papers > Important Questions > Class XII > 2013 > Computer Science > Computer Science - by Mr. Sandip Kumar Srivastava

CBSE CLASS XII

Computer Science (C++ and Data Structure)

BOOLEAN ALGEBRA

1. Show algebraically:-  (A.(B¢C)) ¢ +B¢C+AC = 1
2. Write the equivalent Boolean expression for the logic circuit given below
   
3. Write the canonical P-O-S expression for the following S-O-P expression
   F(a,b,c) = ∑(1,2,5,6)
4. Reduce the following expression using K-map and draw the circuit only using NOR gate F(a,b,c,d) = п(0,1,2,4,5,6,8,9,10,14)

61.

1. State and algebraically verify Absorption Laws.
2. Write the POS form of a Boolean Function F, which is represented by the following truth table:

A	B	C	F
0	0	0	0
0	0	1	1
0	1	0	1
0	1	1	1
1	0	0	1
1	0	1	0
1	1	0	0
1	1	1	1

3. Obtain the simplified form of the Boolean Expression using K’ Map:
   F( x , y , z, w) = ∑ (0,2,4,5,8,9,12,13,15)

4. Represent OR operation using NAND gates only.
5. Write the equivalent Canonical Product of Sum for the following expression.
   F(A,B,C) = ∑(1,2,3,4)

62.

1. State and verify Associative Law.
2. Write the equivalent expression for the following Logic Circuit:
   
3. Convert the following Boolean expression into its equivalent Canonical Product of Sum Form(POS)
   A.B’.C+A’.B.C+A’.B.C’
4. Reduce the following Boolean Expression using K-Map:
   F(P,Q,R,S)=∑(0,3,5,6,7,11,12,15)

63.

1. State and verify Distributive law.
2. Convert the following Boolean expression into its equivalent Canonical product of sum form (POS):
   F (a, b, c) = ∑ (1, 3, 5, 6) 
3. Write the equivalent Logic Circuit for the following Boolean Expression
   AB(C’D + B’C) + BC
4. Reduce the following Boolean Expression using K-Map
   F(A,B,C,D) = ∑ ( 1,3,4,5,6,7,9,11,12,13,14,15)

64.

1. State and verify De Morgan’s Laws algebraically.
2. Write the equivalent Boolean Expression for the following Logic Circuit.
   
3. Reduce the following Boolean Expression using K-Map:
   F(A,B,C,D)= (0,1,2,4,5,6,8,10)
4. Write the POS form of a Boolean function F, which is represented in a truth table as
   follows:

65.

1. State and verify Demorgan's Laws algebraically.
2. Convert the following Boolean expression into its equivalent Canonical Sum of Product Form (SOP).
   (X’+Y+Z’).(X’+Y+Z).(X’+Y’+Z).(X’+Y’+Z’)
3. Write the equivalent expression for the following Logical Circuit:

4. 

5. Reduce the following Boolean expression using K-Map:
   F(P,Q,R,S)=∏ (0,3,5,6,7,11,12,15)

Submitted By : Mr. Sandip Kumar Srivastava
Email : [email protected]