boolean
boolean
•OR Gate: OR Gate is an electronic circuit which produce low output (0), when all the inputs are low (0) and produce high
A B Z=A.B
(1) output for every possible combination of 0 and 1. The output is same as basic binary addition. The gate may have two or
more than two inputs and produce single result.
Graphically OR gate is represented as
Algebraically output of OR Gate is represented as: Z = A+B 0 0 0
A
Truth table of OR Gate is
0 1 0
Z=A.B
B 1 0 0
1 1 1
A B Z=A+B
0 0 0
A 0 1 1
Z=A+B 1 0 1
B
1 1 1
• NOT Gate: NOT Gate is another fundamental gate whose
result is complement of its input. It is also called inverter. It
produces low-0 logic for high-1 input and vice-versa. This
Gate has single input and single output. Graphically NOT
gate is represented as:
Algebraically output of NOT Gate is represented as: Z = A’ for
input A
Truth table of NOT gate is: A A'
0 1
A Z = A’ 1 0
A B A+B Z= (A+B)'
0 0 0 1
A
Z=A+B 0 1 1 0
•
B 1 of0 digital
Exclusive NOR (X-NOR): It is the type 1 electronic
0 circuit will
generates high-1 output when both the inputs are either low-0 or
1 when
high-1. It will give low-0 output only 1 one 1 of the
0 given input is
high-1. These gate also may have two or more the two input.
Graphically X-NOR gate is represented as
Algebraically output of X-NOR gate is represented as: Z= A.B + A’.B’
Truth Table of X-NOR gate:
0 1 1 0 0 0 1
1 0 0 1 1 1 1
1 1 0 0 0 0 0
A
Z=(A B)
B
Laws of Boolean Algebra
1. Identity Law :
A.1=A
A variable AND'ed with 1 is always equal to the variable
A+O=A
A variable OR'ed with O is always equal to the variable
2. Annulment Law :
A. O=O
A variable AND'ed with O is always equal to O
A+1=1
A variable OR'ed with 1 is always equal to 1
3.Indempotent Law:
A+A=A
A variable OR'ed with itself is always equal to the variable
A.A=A
A variable AND'ed with itself is always equal to the variable
4. Complement Law :
A.A = O
A variable AND'ed with its complement is always equal to
O
A+A=1
A variable OR'ed with its complement is always equal to 1
5. Commutative Law :
A.B=B.A
The order in which two variables are AND'ed makes no
difference
A+B=B+A
The order in which two variables are OR'ed makes no
difference
7. Distributive Law :
Permits the Multiplying or factors of the variable
A(B + C) = A.B + A.C
OR Distributive Law
A+ (B.C) = (A + B).(A + C)
AND Distributive Law
8. De Morgan's Rule or Theorem :
Works Depending on the concept of Duality
Helps in solving the algebraic problems in digital
electronics
(A.B)' = A' + Β'.
The negation of a conjunction is the disjunction of the
negations, which means that the complement of the
product of two variables is equal to the sum of the
compliments of individual variables.
(A + B)' = Α'Β'.
The negation of disjunction is the conjunction of the
negations, which means that compliment of the sum of
two variables is equal to the product of the complement
of each variable.
Summary
A computer system is an integrated set of hardware and
software components that work together to process data
and perform computations. The main components
include:
• Hardware: The physical components of a computer,
including the Central Processing Unit (CPU), Memory
(RAM and storage), Input/output devices (like keyboards,
screens, and printers), and various Peripheral devices.
• Software: Programs and applications that allow the
computer to perform tasks. This includes Operating
Systems (OS) like Windows or Linux, which manage
hardware resources, and Application Software that
allows users to perform specific tasks like word
processing, data analysis, or web browsing.
Boolean Algebra
Boolean algebra is a mathematical structure that deals with
binary variables and logical operations, which are
foundational in computer science, digital electronics, and
computing.
Boolean algebra uses binary values (0 and 1),representing
False and True, respectively.
Logical Operations: