Scribd
Upload
27 views5 pages

Chapter 6

Chapter 6 covers Boolean Algebra, a mathematical system essential for digital circuits and computer logic, focusing on binary values. It discusses basic logic gates (AND, OR, NOT), universal gates (NAND, NOR), and various Boolean laws for simplifying expressions. Additionally, it introduces logic circuit design and Karnaugh Maps for visual simplification of Boolean functions.

Uploaded by

ashim05birbhum
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
27 views5 pages

Chapter 6

Chapter 6 covers Boolean Algebra, a mathematical system essential for digital circuits and computer logic, focusing on binary values. It discusses basic logic gates (AND, OR, NOT), universal gates (NAND, NOR), and various Boolean laws for simplifying expressions. Additionally, it introduces logic circuit design and Karnaugh Maps for visual simplification of Boolean functions.

Uploaded by

ashim05birbhum
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
You are on page 1/ 5

Chapter 6: Boolean Algebra - Class 12

Computer Science
6.1 Introduction to Boolean Algebra
Boolean Algebra is a mathematical system used in digital circuits and computer logic. It is
based on binary values 0 (False) and 1 (True).

6.1.1 Importance of Boolean Algebra

 Used in digital logic design (AND, OR, NOT gates).


 Simplifies logic circuits, reducing cost and complexity.
 Forms the foundation of computer operations.

6.2 Basic Logic Gates


Logic gates are basic building blocks of digital circuits.

6.2.1 Types of Logic Gates

Gate Symbol Logic Expression Truth Table


AND (•) A•B 1 only if both A and B are 1
OR (+) A+B 1 if at least one of A or B is 1
NOT (¬) ¬A Inverts input (1 → 0, 0 → 1)

6.2.2 Truth Tables

AND Gate (A • B)

A B Output (A • B)
0 0 0
0 1 0
1 0 0
1 1 1

OR Gate (A + B)

A B Output (A + B)
0 0 0
0 1 1
1 0 1
A B Output (A + B)
1 1 1

NOT Gate (¬A)

A Output (¬A)
0 1
1 0

6.3 Universal Gates


Universal gates can be used to build any other logic gate.

6.3.1 NAND (NOT AND) Gate

Expression A NAND B = ¬(A • B)


Truth Table
A B
--- ---
0 0
0 1
1 0
1 1

6.3.2 NOR (NOT OR) Gate

Expression A NOR B = ¬(A + B)


Truth Table
A B
--- ---
0 0
0 1
1 0
1 1

Note: NAND and NOR are Universal Gates because they can be used to create any other
gate.

6.4 Boolean Algebra Rules


Boolean expressions follow specific laws:
6.4.1 Basic Laws

Law Expression
Idempotent Law A + A = A, A • A = A
Identity Law A + 0 = A, A • 1 = A
Null Law A + 1 = 1, A • 0 = 0
Complement Law A + ¬A = 1, A • ¬A = 0

6.4.2 Commutative Law

Operation Expression
For OR A + B = B + A
For AND A • B = B • A

6.4.3 Associative Law

Operation Expression
For OR (A + B) + C = A + (B + C)
For AND (A • B) • C = A • (B • C)

6.4.4 Distributive Law

Expression
A • (B + C) = (A • B) + (A • C)
A + (B • C) = (A + B) • (A + C)

6.4.5 De Morgan’s Theorems

Theorem Expression
First ¬(A • B) = ¬A + ¬B
Second ¬(A + B) = ¬A • ¬B

6.5 Boolean Expression Simplification


Boolean expressions can be simplified using laws and theorems to minimize circuit
complexity.

Example 1: Using Boolean Laws

Expression: A • (A + B)
Simplification:

1. A • (A + B)
2. = (A • A) + (A • B) [Using Distributive Law]
3. = A + (A • B) [Using Idempotent Law: A • A = A]
4. = A [Using Absorption Law: A + A • B = A]

Example 2: Using De Morgan’s Theorems

Expression: ¬(A + B)
Simplification:

1. ¬(A + B)
2. = ¬A • ¬B [Using De Morgan’s Second Theorem]

6.6 Logic Circuit Design


Logic circuits are designed using Boolean expressions and logic gates.

Example Circuit

Design a circuit for Y = A • (B + C)

1. Use an OR gate for B + C.


2. Use an AND gate for A • (B + C).

Circuit Diagram Representation


css
Copy
A ───┬─────────
│
├─(AND)── Y
│
B ─(OR)──┘
C ──┘

This circuit takes inputs A, B, C and produces output Y = A • (B + C).

6.7 Karnaugh Map (K-Map) Simplification


K-Map is a visual method to simplify Boolean expressions.

2-Variable K-Map

AB 0 1
0 01
1 11
 Group adjacent 1s to simplify the expression.
 Example: F(A, B) = A + B

Summary of Chapter 6
 Boolean Algebra is used in digital circuits.
 Basic Gates: AND, OR, NOT.
 Universal Gates: NAND, NOR.
 Boolean Laws help in simplification.
 De Morgan’s Theorems help in complementing expressions.
 Logic Circuits are designed using Boolean expressions.
 K-Map helps in easy simplification of Boolean functions.

You might also like