Scribd
Upload
19 views22 pages

Boolean Algebra

Uploaded by

instructor Amer
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views22 pages

Boolean Algebra

Uploaded by

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

BOOLEAN ALGEBRA

COMPUTER SCIENCE Y12


STUDENT NAME: OMAR TAHA
BY REDA ALHAMWI
SCIENCE XPLORERS
INTRODUCTION

• Boolean algebra is a fundamental branch of mathematics that deals with binary variables and logic
operations.
• In digital electronics and computer science, Boolean algebra serves as the foundation for designing and
analyzing digital circuits, writing computer programs, and understanding the behavior of logic gates.
INTRODUCTION

• Computer Programming: Boolean algebra is essential in computer programming for implementing


conditional statements, logical operations, and control flow structures. Programmers use Boolean
variables, logic operators (AND, OR, NOT), and conditional expressions to control the flow of execution
in programs. For instance, in programming languages like C, Python, or Java, Boolean expressions are
used in if-else statements, while loops, and logical comparisons to make decisions and execute code
based on specific conditions.
INTRODUCTION

• Logic Gates: Logic gates are fundamental building blocks of digital circuits, and they operate based on
Boolean algebra principles. These electronic devices perform basic logic functions such as AND, OR,
NOT, XOR, etc., based on the input signals they receive. For example, an AND gate produces an output
of 1 (true) only if all of its inputs are 1 (true), while an OR gate produces an output of 1 if any of its
inputs are 1. Boolean algebra helps in analyzing the behavior of logic gates and designing complex
digital systems.
BOOLEAN IDENTITIES

• Boolean identities are rules or laws that describe the behavior of Boolean algebra.
• They are crucial in simplifying Boolean expressions, making them easier to understand and work with.
• By applying Boolean identities, complex expressions can be reduced to simpler forms, which aids in analysis,
design, and optimization of digital circuits and logic operations.
COMMON BOOLEAN IDENTITIES

• Identity: This identity states that for any Boolean variable A, the expression A+0=A and A.1=A In other
words, ORing a variable with 0 or ANDing a variable with 1 does not change its value.

• It means nothing OR any event (eg., A) is the event itself A


• It means the event A and everything is A itself
COMMON BOOLEAN IDENTITIES

Null: This identity states tHAT ORing a variable with 1 or ANDing a variable with 0 always results in 1 or 0,
respectively.

• It means any event OR everything is everything


• It means any event AND nothing is nothing
COMMON BOOLEAN IDENTITIES

• Idempotent: This identity states that ORing or ANDing a variable with itself results in the variable itself.
COMMON BOOLEAN IDENTITIES

• Complement: This identity states that ORing a variable with its complement always results in 1, while
ANDing a variable with its complement always results in 0.

• It means adding the event to complement of the event (everything except the event in the sample
space) will give everything (100%)
• It means the intersection of the event and the complement of the event is nothing
COMMON BOOLEAN IDENTITIES

• Double Negation: This identity states that negating a variable twice results in the original variable itself

The complement of the complement of any event is the event itself.


COMMON BOOLEAN IDENTITIES

• Domination (Absorption): This identity states if a variable is ORed with the conjunction (AND operation)
of itself and another variable, the result is just the variable itself.
COMMON BOOLEAN IDENTITIES

• Distributive: This identity states that for any Boolean variables A,B and C, the distributive property
resembles the distributive property in arithmetic.
COMMON BOOLEAN IDENTITIES

• Associative: This identity states that for any Boolean variables A, B, and C that the order of operations
(either AND or OR) does not matter when grouping expressions:
COMMON BOOLEAN IDENTITIES

• Commutative: This identity states that for any Boolean variables A and B, that the order of variables in
an OR or AND operation does not affect the result.
DE MORGAN'S LAWS

De Morgan's Laws offer two important rules for simplifying Boolean expressions:
• First Law (AND Form): It states that the negation of a conjunction (AND) is equivalent to the disjunction
(OR) of the negations of the individual terms. In other words:

• Second Law (OR Form): It states that the negation of a disjunction (OR) is equivalent to the conjunction
(AND) of the negations of the individual terms. In other words:
DE MORGAN'S LAWS
In sets theory:
DE MORGAN'S LAWS – FIRST LAW
To prove the first law : , we will use the following truth table:
DE MORGAN'S LAWS – SECOND LAW
To prove the second law : , we will use the following truth table:
DE MORGAN'S LAWS

• Demorgan's law is used in computer programming. This law helps to simplify logical expressions written
in codes thereby, reducing the number of lines. Thus, it helps in the overall optimization of the code.
OVERVIEW OF THE RULES
EXAMPLES
EXAMPLE

Simplify

Based on the complement law (A+A’=1):

You might also like