Scribd
Upload
60 views

Computer Science 101: Boolean Algebra

The document provides an overview of Boolean algebra, which is a type of algebra used to represent logical reasoning and understand digital circuits. It introduces Boolean operators like AND, OR, and NOT and how they are used to represent logical expressions. Boolean expressions can be represented as truth tables and simplified using Boolean algebraic laws like distribution, identity, and complement. Python can also be used to work with Boolean logic and expressions.

Uploaded by

Ram Paliwal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
60 views

Computer Science 101: Boolean Algebra

The document provides an overview of Boolean algebra, which is a type of algebra used to represent logical reasoning and understand digital circuits. It introduces Boolean operators like AND, OR, and NOT and how they are used to represent logical expressions. Boolean expressions can be represented as truth tables and simplified using Boolean algebraic laws like distribution, identity, and complement. Python can also be used to work with Boolean logic and expressions.

Uploaded by

Ram Paliwal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 18

Computer Science 101

Boolean Algebra

Whats next?

A new type of algebra Helps us


With logical reasoning Understand and design circuits of a computer

The innards of a computer


Basic circuits Major components and how they work together Low level instructions machine language How data and instructions are stored in computer

George Boole

English mathematician 1815-1864 1854: Introduction to the Laws of Thought Boolean algebra Logic Set Theory Circuits Programming: Conditions in while and if

Boolean Constants and Variables

In Boolean algebra, there are only two constants.


True and False On and Off +5v and 0v 1 and 0

Boolean variables are variables that store values that are Boolean constants.

Boolean Operator AND

If A and B are Boolean variables (or expressions) then A AND B is True (1) if and only if both A and B have values of True (1).

We denote the AND operation like multiplication in ordinary algebra: AB or A.B

Boolean Operator OR

If A and B are Boolean variables (or expressions) then A OR B is True (1) if and only if at least one of A and B has value of True (1).

We denote the OR operation like addition in ordinary algebra: A+B

Boolean Operator NOT

If A is a Boolean variable (or expression) then NOT A

has the opposite value from A.

We denote the NOT operation by putting a bar over the variable (or expression) _ A

Boolean Expressions

As with ordinary algebra, a Boolean expression is a well-formed expression made from


Boolean constants Boolean variables Operators AND, OR and NOT Parentheses

Example:

_ ____ AB + (A+C)B

The value of a Boolean expression

At any point, the value of a BE can be computed using the current values of the variables. Unlike ordinary algebra, for a BE, there are only finitely many possible assignments of values to the variables; so, theoretically, we can make a table, called a truth table that shows the value of the BE for every possible set of values of the variables.

Truth Table: _ ____ E = AB + (A+C)B


A B C 0 0 0 0 0 0 1 0 1 1 1 1 1 0 0 1 1 1 0 1 0 1 0 1 _ B 1 1 0 0 1 1 0 0 _ AB 0 0 0 0 1 1 0 0 ____ ____ A+C A+C (A+C )B E 0 1 0 0 1 0 1 1 1 1 1 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 1 1 0 0

In Python!

Laws of Algebra?

In ordinary algebra, we have a distributive law : A(B+C) = AB + AC What does it mean to say this is a law?
The left side has parentheses, right side doesnt. The left side has one multiplication and the right side has two.

Laws of Algebra?

A(B+C) = AB + AC

No matter what the numerical values of A, B, and C are, the two indicated computations will have the same value.

Laws of Boolean Algebra


Identity A+0=A, A.1=A Idempotent A+A=A, AA=A Associative (A+B)+C=A+(B+C) (AB)C=A(BC) Zero Element A.0=0, A+1=1 Commutative A+B=B+A, AB=BA Distributive A(B+C)=AB+AC A+BC=(A+B)(A+C)

Laws of Boolean Algebra


Absorption A+AB=A, A(A+B)=A Complement _ _ A+A =1, AA =0 DeMorgan_ _ ____ A+B ___ =_A B , _ AB = A +B Double Complement _ A=A

Boolean Expression Simplification


_ _ ____ (A+B )C + AC + (B+C ) _ _ _ _ = (A+B )C + AC + B_C _ _ = (A+B )C + _ (A+B )C _ = (A+B )(C+C ) _ = (A+B )1 _ = A+B

(DeMorgan) (Distributive) (Distributive) (Complement) (Identity)

Boolean Expression Simplification


_ _ _ A B + AB _ AB _ _ + _ = A B + AB + AB + AB _ _ _ = B (A +A) + A(B +B) _ =B1+A1 _ =B+A

(Idempotent) (Distributive) (Complement) (Identity)

You might also like