Scribd
Upload
204 views12 pages

Chapter 3 Boolean Logic

The document outlines the fundamentals of Boolean Logic as part of the Class XI Computer Science syllabus. It explains the binary system, Boolean expressions, laws, and truth tables, along with the significance of logic gates and universal gates like NAND and NOR. The content is structured to provide a foundational understanding of how computers process information using Boolean algebra.

Uploaded by

sherwoodcelebrations
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
204 views12 pages

Chapter 3 Boolean Logic

The document outlines the fundamentals of Boolean Logic as part of the Class XI Computer Science syllabus. It explains the binary system, Boolean expressions, laws, and truth tables, along with the significance of logic gates and universal gates like NAND and NOR. The content is structured to provide a foundational understanding of how computers process information using Boolean algebra.

Uploaded by

sherwoodcelebrations
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/ 12

New

syllabus
2021-22

Chapter 3
Boolean
Logic

Computer Science
Class XI ( As per CBSE Board)
Boolean Logic

What does a Computer


Understands
Computers do not understand natural 1 Bit = Binary Digit(0 or 1)
languages nor programming languages. 8 Bits = 1 Byte
They only understand the language of 1024 Bytes = 1 KB (Kilo Byte)
1024 KB = 1 MB (Mega Byte)
bits. A bit is the most basic unit in
1024 MB = 1 GB(Giga Byte)
computer machine language. All 1024 GB = 1 TB(Terra Byte)
instructions that the computer executes 1024 TB = 1 PB(Peta Byte)
and the data that it processes is made up 1024 PB = 1 EB(Exa Byte)
of a group of bits. Bits are represented in 1024 EB = 1 ZB(Zetta Byte)
1024 ZB = 1 YB (Yotta Byte)
many forms either through electrical
1024 YB = 1 (Bronto Byte)
voltage, current pulses, or by the state of 1024 Brontobyte = 1 (Geop Byte)
an electronic flip-flop circuit in form of 0
or 1.
Boolean Logic

Boolean Logic
Because of computer understands machine
language(0/1) which is binary value so every operation
is done with the help of these binary value by the
computer.
George Boole, Boolean logic is a form of algebra in
which all values are reduced to either 1 or 1.
To understand boolean logic properly we have to
understand Boolean logic rule,Truth table and logic
gates
Boolean Logic
Boolean Logic rules Boolean Expression Boolean Algebra Law or Rule

Boolean Algebra is A+1=1 Annulment

the mathematics we A+0=A Identity

use to analyse digital A.1=A Identity

A.0=0 Annulment
gates and circuits. We
A+A=A Idempotent
can use these “Laws
A.A=A Idempotent
of Boolean” to both NOT A = A Double Negation
reduce and simplify a A+A=1 Complement
complex Boolean A.A=0 Complement

expression in an A+B = B+A Commutative

attempt to reduce A.B = B.A Commutative

the number of logic A+B = A.B de Morgan’s Theorem

gates required. A.B = A+B de Morgan’s Theorem


Boolean Logic

Boolean Expression
A Boolean expression is a logical statement that is either
TRUE or FALSE .
A Boolean expression can consist of Boolean data, such as the following:
* BOOLEAN values (YES and NO, and their synonyms, ON and OFF, and TRUE
and FALSE)
* BOOLEAN variables or formulas
* Functions that yield BOOLEAN results

• BOOLEAN values calculated by comparison operators. E.g.


1. $F(x, y, z) = x' y' z' + x y' z + x y z' + x y z
2. $F' (x, y, z) = x' y z + x' y' z + x' y z' + x y' z‘
3. $F(x, y, z) = (x + y + z) . (x+y+z') . (x+y'+z) . (x'+y+z)
Boolean Logic

De Morgan’s Law
The complement of the union of two sets is equal to the
intersection of their complements and the complement
of the intersection of two sets is equal to the union of
their complements. These are called De Morgan’s laws.

For any two finite sets A and B


(i) (A U B)' = A' ∩ B' (which is a De Morgan's law of union).
OR
(A+B)’=A’.B’
(ii) (A ∩ B)' = A' U B' (which is a De Morgan's law of intersection).
OR
(A . B)’=A’+B’
Boolean Logic

Proof of De Morgan’s law: (A U B)' = A' ∩ B‘


Let P = (A U B)' and Q = A' ∩ B'

Let x be an arbitrary element of P then x ∈ P ⇒ x ∈ (A U B)'


⇒ x ∉ (A U B)
⇒ x ∉ A and x ∉ B
⇒ x ∈ A' and x ∈ B'
⇒ x ∈ A' ∩ B'
⇒x∈Q
Therefore, P ⊂ Q …………….. (i)
Again, let y be an arbitrary element of Q then y ∈ Q ⇒ y ∈ A' ∩ B'
⇒ y ∈ A' and y ∈ B'
⇒ y ∉ A and y ∉ B
⇒ y ∉ (A U B)
⇒ y ∈ (A U B)'
⇒y∈P
Therefore, Q ⊂ P …………….. (ii)
Now combine (i) and (ii) we get; P = Q i.e. (A U B)' = A' ∩ B'
Boolean Logic

Proof of De Morgan’s law: (A ∩ B)' = A' U B'


Let M = (A ∩ B)' and N = A' U B'
Let x be an arbitrary element of M then x ∈ M ⇒ x ∈ (A ∩ B)'
⇒ x ∉ (A ∩ B)
⇒ x ∉ A or x ∉ B
⇒ x ∈ A' or x ∈ B'
⇒ x ∈ A' U B'
⇒x∈N
Therefore, M ⊂ N …………….. (i)
Again, let y be an arbitrary element of N then y ∈ N ⇒ y ∈ A' U B'
⇒ y ∈ A' or y ∈ B'
⇒ y ∉ A or y ∉ B
⇒ y ∉ (A ∩ B)
⇒ y ∈ (A ∩ B)'
⇒y∈M
Therefore, N ⊂ M …………….. (ii)
Now combine (i) and (ii) we get; M = N i.e. (A ∩ B)' = A' U B'
Boolean Logic

Truth table
A truth table is a mathematical table used in logic.
e.g.
Boolean Logic
Logic Gates
Logic gate is an idealized or physical device implementing a Boolean
function.These are used to construct logic circuit.
Boolean Logic

Logic circuit
Construct a truth tables for following circuits of logic gates

Construct the logic circuit of following


1. C + BC:
2. AB+BC(B+C)
Boolean Logic

Universal gates are the logic gates which are capable of


implementing any Boolean function without requiring
any other type of gate.

Types of Universal Gates-


In digital electronics, there are only two universal gates
which are-
1. NAND Gate
2. NOR Gate

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy