0% found this document useful (0 votes)
9 views3 pages

DLCOAExp 3

The document outlines an experiment conducted by a student at Don Bosco Institute of Technology, focusing on the realization of a logical equation using gates. It includes a truth table for the equation A.B.C + A'.B'.C' and explains various Boolean laws such as Identity, Idempotent, Commutative, Associative, Distributive, Complement, and De Morgan’s Law. The document serves as a lab report for a semester course in digital logic design.

Uploaded by

auxiliaryds
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views3 pages

DLCOAExp 3

The document outlines an experiment conducted by a student at Don Bosco Institute of Technology, focusing on the realization of a logical equation using gates. It includes a truth table for the equation A.B.C + A'.B'.C' and explains various Boolean laws such as Identity, Idempotent, Commutative, Associative, Distributive, Complement, and De Morgan’s Law. The document serves as a lab report for a semester course in digital logic design.

Uploaded by

auxiliaryds
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

The Bombay Salesian Society’s

Don Bosco Institute of Technology


Kurla (West), Mumbai – 400 070

SE – Sem 3 (NEP-2020) AY: 2025-26 - DLCOA Lab

Name of the Student: Deviprasad Shetty Date : 28/07/25

Division: D Batch: A Roll No:

Experiment No: 3

Title: Realization of Logical Equation using gates

Theory: Truth Table of A.B.C + A'.B'.C'


A B C A.B.C A' B' C' A'.B'.C' Y
0 0 0 0 1 1 1 1 1
0 0 1 0 1 1 0 0 0
0 1 0 0 1 0 1 0 0
0 1 1 0 1 0 0 0 0
1 0 0 0 0 1 1 0 0
1 0 1 0 0 1 0 0 0
1 1 0 0 0 0 1 0 0
1 1 1 1 0 0 0 0 1

Q. Boolean Laws

Boolean laws are a set of rules used to simplify and manipulate Boolean expressions.
Names of Laws are as follows: Identity law, Idempotent law, Commutative law,
Associative law, Distributive law, Complement law and De Morgan’s Law. The variables
used in Boolean Algebra only have one of two possible values, a logic “0” and a logic “1”
but an expression can have an infinite number of variables all labelled individually to
represent inputs to the expression, For example, variables A, B, C etc, giving us a logical
expression of A + B = C, but each variable can ONLY be a 0 or a 1.
The Bombay Salesian Society’s
Don Bosco Institute of Technology
Kurla (West), Mumbai – 400 070

SE – Sem 3 (NEP-2020) AY: 2025-26 - DLCOA Lab

1. Identity Law
A+0=A,A.1=A
2. Idempotent law
A+A=A,A.A=A
3. Commutative law
A+B=B+A,A*B=B*A
4. Associative law
(A + B) + C = A + (B + C) , (A * B) * C = A * (B * C)
5. Distributive law
A * (B + C) = A * B + A * C
6. Complement law
A * A' = 0 , A + A' = 1
7. De Morgan’s Law
(A . B)' = A' + B' , (A + B)' = A' . B'

Output:
The Bombay Salesian Society’s
Don Bosco Institute of Technology
Kurla (West), Mumbai – 400 070

SE – Sem 3 (NEP-2020) AY: 2025-26 - DLCOA Lab

You might also like