Scribd
Upload
113 views

Boolean Algebra: Objective

This document describes an experiment on Boolean algebra. It involves verifying rules and simplifying Boolean logic functions using Demorgan's theorem. The experiment aims to design and implement logic circuits. It provides background on Boolean algebra and lists various laws. The procedures involve constructing circuits to prove Demorgan's theorem and designing a circuit for a problem involving four chairs and another involving waste valve control based on three sensor readings.

Uploaded by

envaded
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
113 views

Boolean Algebra: Objective

This document describes an experiment on Boolean algebra. It involves verifying rules and simplifying Boolean logic functions using Demorgan's theorem. The experiment aims to design and implement logic circuits. It provides background on Boolean algebra and lists various laws. The procedures involve constructing circuits to prove Demorgan's theorem and designing a circuit for a problem involving four chairs and another involving waste valve control based on three sensor readings.

Uploaded by

envaded
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

Experiment#4

Boolean Algebra

Experiment #5

Boolean Algebra
OBJECTIVE
To verify the rules and regulations of Boolean Algebra. 2. To simplify and modify Boolean logic functions by means of Demorgans theorem. 3. To design and implement a logic circuit.
1.

BACKGROUND
Boolean algebra is a deductive mathematical system closed over the values zero and one (false and true). A binary operator defined over this set of values accepts a pair of boolean inputs and produces a single boolean value.

We will also use the following set of postulates:


P1: Boolean algebra is closed under the AND, OR, and NOT operations. P2: The identity element with respect to is one and + is zero. There is no identity element with respect to logical NOT. P3: The and + operators are commutative. P4: and + are distributive with respect to one another. That is, A (B + C) = (A B) + (A C) and A + (B C) = (A + B) (A + C). P5: For every value A there exists a value A such that AA = 0 and A+A = 1. This value is the logical complement (or NOT) of A. P6: and + are both associative. That is, (AB)C = A(BC) and (A+B)+C = A+(B+C). You can prove all other theorems in boolean algebra using these postulates.

Laws of Boolean Algebra Commutative Laws Associative Laws Distributive Law

Experiment#4

Boolean Algebra

THEORY:
1. A+0 = A 2. A+1 = 1 3. A .0 = 0 4. A .1 = A 5. A+A = A 6. A+A = 1 7. A.A = A 8. A.A = 0 9. (A) = A 10. A+AB = A 11. A+AB = A+B 12. (A+B)(A+C) = A+BC 13. A. B = (A+B) 14. A+B = (A.B)

PRELAB:
1. 2.

Refer to your text book, understand the concepts of Boolean Algebra. Draw truth table, logic diagram and pin diagram for each part in THEORY.

Experiment#4

Boolean Algebra

EQUIPMENTS REQUIRED
KL-31001 trainer kit, 7400 Quadruple 2 input NAND gates, 7402 Quadruple 2 input NOR gates, 7408 Quadruple 2 input AND gates, 7432 Quadruple 2 input OR gates, 7404 Hex inverters.

PROCEDURES:
Part I: a) Connect these circuits and verify their operations.

Experiment#4

Boolean Algebra

Part II: Demorgans Theorem a) Proof of equation (1): Construct the two circuits corresponding to the functions A. Band (A+B) respectively. Show that for all combinations of A and B, the two circuits give identical results. Connect these circuits and verify their operations.

b) Proof of equation (2) Construct two circuits corresponding to the functions A+Band (A.B) A.B, respectively. Show that, for all combinations of A and B, the two circuits give identical results. Connect these circuits and verify their operations.

Experiment#4

Boolean Algebra

Part III: Design of a Digital Circuit Consider the following problem: Four chairs A, B, C, and D are placed in a row. Each chair may be occupied (l) or empty (0). A Boolean function F is l if and only if there are two or more adjacent chairs that are empty. 1. Give the truth table defining the Boolean function F 2. Express F as a minterm expansion (standard sum of product) 3. Express F as a maxterm expansion (standard product of sum) 4. Using theorems of Boolean algebra, simplify the minterm expansion of F to a form with as few occurrences of each as possible. 5. implement the simplified Boolean function with logic gates. Show the pin diagram.

Exercise:
Your task, is to design the circuitry of the logic system to open the waste valve if and only if there is good flame proven by the sensors. The waste valve is opened if at least two out of the three sensors show good flame. 1. Give the truth table defining the Boolean function F 2. Express F as a minterm expansion (standard sum of product) 3. Express F as a maxterm expansion (standard product of sum) 4. Using theorems of Boolean algebra, simplify the minterm expansion of F to a form with as few occurrences of each as possible. 5. implement the simplified Boolean function with logic gates. Show the pin diagram.

You might also like