Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
5 views

Cs Python 12

Uploaded by

nehakumari261345
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Cs Python 12

Uploaded by

nehakumari261345
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

# Law of Boolean Algebra

(i) Prove following laws using truth table


Distributive Law
➡ A.(B + C) = A.B + A.C
◼Involution Law
➡ (A')' = A

(ii) Prove Following laws algebraically

◼ De Morgan's Law
➡ i. (A + B)' = A'B' | ii. (A.B)' = A' + B'
◼Distributive Law
➡ A + (B.C) = (A + B) . (A + C)
◼Absorption Law
➡ (i) A + (A.B) = A, (ii) A.(A + B) = A

(III) Fill in the blanks:-

1. A __________ statement returns either True or False value.


2. The logical values can be stored in ______________.
3. A __________ represents a Boolean function with all the input and output in tabular
form.
4. The only Boolean function which operates on a single input variable is ____________.
5. The _____________ is a Boolean operation which performs multiplication.
6. The ___________ is a Boolean operation which performs addition.
7. The Boolean expression evaluated from ________ to ___________.
8. The _________ operator has high (top) priority in Boolean statement evaluation.
9. The __________ is a graphical representation of truth table.
10. The __________ gate produces the reverse result of AND gate.

5.
6 (a) (b) and (c).

7. Using Boolean identities, prove the given Boolean expression:


(i) X′Y + YZ′ + YZ + XY′Z′=Y+XZ′
(ii) x’y’z +yz+ xz=z
(iii)

9. Write the expression F i.e. output of the following circuit diagram

10. Draw the following circuit diagram


(i)NOR gate using NAND gates
(ii) NAND gate using NOR gates exclusively.

You might also like