Skip to main content

Laws of Boolean Algebra

 .

Boolean algebra consists of two binary operations + and., unary operation, two distinct element 0 and 1, and variables that holds 0 and 1. Following are different laws of Boolean algebra.

Lets a,b,c be Boolean variables then

1. Identity Laws 

a) a + 0 = a                                b) a.1 = a

2. Complement Laws

a) a + a' = 1                                b) a.a' = 0

3. Idempotent Laws

a) a + a = a                                b) a.a = a

4. Boundedness Laws 

a) a + 1 = 1                                b) a.0 = 0

5. Absorption Laws 

a) a + (a.b) = a                            b) a.(a + b) = a

6. Commutative Laws 

a) a + b = b + a                            b) a.b = b.a

7. Associative Laws 

a) (a + b) + c = a + (b + c)            b) (a.b).c    = a.(b.c)

8. Distributive Laws

a) a + (b.c) = (a + b). (a + c)         b) a.(b + c) = (a.b) + (a.c)

9. Involution Law

    (a')' = a

10. De-Morgan's Laws

a) (a + b)' = a'.b'                            b) (a.b)' = a' + b'



Home

Comments

Popular posts from this blog

Important Questions of Data Structure and Algorithm (DSA)

 . 1. What is Data structure? Explain different operations to be performed on data structure. 2. Define stack as ADT. Convert P+Q-(R*S/T+U) - V*W into infix expression to postfix. 3. Define Queue. Explain its type with example. 4.  Difference between stack and Queue. 5. Difference between Linear Queue and circular Queue. 6. Write an algorithm to enqueue and dequeue data element in a circular queue.                              7. Define Linked List. Explain its type. How does double linked List is different from circular linked   List. 8. What is recursion and recursive function? write a recursive function to compute Fibonacci number. 9. What is an AVL tree ? Create an  AVL tree from the following data:      18, 12, 14, 8, 85, 25, 31, 24, 27 10. Define B-tree? How to insertion and deletions of elements can be done in a B-tree. 11. Create an B-tree from the following Data:  ...

Important questions of C programming (BCA)

 . What is the characteristics of a good program? Explain types of language processor. Explain any two system design tools. Explain Program Development Life Cycle. Define programing techniques. Different between top-down and button - up approach with suitable example. Difference between cohesion and coupling. Define identifiers, constants, variables and keywords. Explain datatypes. Explain different types of  datatypes available in C. Define operator. Explain its types with suitable example. Explain decision making statement. Explain its type with example. Difference between while, do while loop, for loop. Write a program to find the fibonacci  sequence. What is jumping statement. Explain its types with suitable example.    Write a program to display following:               *               **               ***         ...

BCA Math II old question model solution

 . BCA Math II question model 2018: BCA Math II question model 2019: BCA Math II question model 2020: