Scribd
Upload
27 views3 pages

De Morgans Theorem

The document discusses De Morgan's theorems in digital logic, including their objectives, definitions, materials needed, procedures to test the theorems using logic gates, and conclusions from experiments validating the theorems.

Uploaded by

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

De Morgans Theorem

The document discusses De Morgan's theorems in digital logic, including their objectives, definitions, materials needed, procedures to test the theorems using logic gates, and conclusions from experiments validating the theorems.

Uploaded by

mdrabbigazi2000
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Objectives:

The objectives of studying De Morgan's Theorems in digital logic include simplifying Boolean
expressions, enhancing problem-solving skills, enabling error detection and correction, applying logic
transformations effectively, preparing for advanced topics, fostering critical thinking and analysis, and
supporting real-world applications in digital systems and computer science.

De Morgan's First Theorem:


(A AND B)' = A' OR B'
In words, the negation of the AND operation between two variables is equivalent to the OR operation of
the negations of those variables.

De Morgan's Second Theorem:


(A OR B)' = A' AND B'
In words, the negation of the OR operation between two variables is equivalent to the AND operation of
the negations of those variables.

Materials Needed:
 AND Gate
 OR Gate
 NOT Gate
 Wires and Breadboard
 Boolean Algebra Expressions
 Power Supply (if not battery-powered gates)
 Input Switches (optional)

Procedure:
1. Set Up Your Workspace: Gather all the materials you need and set up a clean workspace. Ensure
you have a power supply ready if your logic gates require it.

2. Define the Boolean Expressions: Decide on the specific Boolean algebra expressions you want to
work with, such as (A AND B)' = A' OR B' or (A OR B)' = A' AND B'.

3. Connect the Logic Gates: Depending on the expression you're testing, connect the logic gates
accordingly. For example, if you're demonstrating the first theorem (A AND B)' = A' OR B',
connect an AND gate, an OR gate, and a NOT gate as follows:
 Connect input A to one input of the AND gate.
 Connect input B to the other input of the AND gate.
 Connect the output of the AND gate to the input of the NOT gate.
 Connect the output of the NOT gate to one input of the OR gate.
 Connect input A directly to the other input of the OR gate.

Page 1 of 3
4. Input Control (Optional): If you have input switches, you can use them to control the values of A
and B in your expressions. Alternatively, you can manually set the inputs as needed.

5. Power on and Observe: Power on your logic gates (if required). Set the inputs to test different
combinations of A and B. Observe the output of the circuit and record the results in a table.

6. Verify De Morgan's Theorem: For each input combination, compare the output of your circuit to
the expected output based on De Morgan's Theorems. Ensure that (A AND B)' matches A' OR B'
and vice versa for the second theorem.

7. Repeat and Conclude: Repeat the experiment with various input combinations to ensure
consistency. Conclude the experiment by summarizing your findings and confirming that De
Morgan's Theorems hold true in your circuit.

8. Clean Up: Safely power down or disconnect any electrical components. Put away your materials
and record your results

Figure-1: Circuit diagram of De-Morgens theorem using basic gates.

Page 2 of 3
Figure-2: Experiment of De-Morgens theorem using basic gates.

Conclusion:
Our experiment successfully illustrated the principles of De Morgan's Theorems through the
implementation of basic logic gates. De Morgan's First Theorem, (A AND B)' = A' OR B', and De
Morgan's Second Theorem, (A OR B)' = A' AND B', were rigorously tested and consistently validated. By
designing and analyzing circuits with AND, OR, and NOT gates, we demonstrated that the negation of
logical expressions involving these gates indeed adheres to the theorems' predictions. This experiment
underscores the significance of De Morgan's Theorems in simplifying Boolean algebra expressions and
provides practical evidence of their applicability in digital logic design. These theorems are indispensable
tools in various computational domains, where the manipulation of logical statements is fundamental.

Page 3 of 3

You might also like