BOOLEAN ALGEBRA Only involves in calculations of TRUE and FALSE; either be inputs or output. When a logic statement is TRUE it is assigned a Boolean logic.

Slides:



Advertisements
Similar presentations
CS 151 Digital Systems Design Lecture 5 Boolean Algebra.
Advertisements

Presented by: Ms. Maria Estrellita D. Hechanova, ECE
Chapter 2 Logic Circuits.
Boolean Algebra and Logic Gate
Chapter 3 Boolean Algebra and Logic Gate (Part 2).
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
1 CSE 20: Lecture 8 Boolean Postulates and Theorems CK Cheng 4/26/2011.
1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.
ENGIN112 L5: Boolean Algebra September 12, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
In a not gate, if the input is on(1) the output is off (0) and vice versa.
Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.
9/15/09 - L5 Boolean AlgebraCopyright Joanne DeGroat, ECE, OSU1 Boolean Algebra.
Boolean Algebra Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
CHAPTER 2 Boolean Algebra
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
Module 4.  Boolean Algebra is used to simplify the design of digital logic circuits.  The design simplification are based on: Postulates of Boolean.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.
Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
LOGIC GATES & BOOLEAN ALGEBRA
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
CSE 20: Lecture 7 Boolean Algebra CK Cheng
Mathematical Preliminaries
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Lecture 4 Boolean Algebra. Logical Statements °A proposition that may or may not be true: Today is Monday Today is Sunday It is raining °Compound Statements.
CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.
CEC 220 Digital Circuit Design Boolean Algebra Friday, January 17 CEC 220 Digital Circuit Design Slide 1 of 22.
Laws (Theorems) of Boolean algebra Laws of Complementation oThe term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
1.4 Properties of Real Numbers ( )
ECE DIGITAL LOGIC LECTURE 6: BOOLEAN ALGEBRA Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 02/01/2016.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
©2010 Cengage Learning SLIDES FOR CHAPTER 3 BOOLEAN ALGEBRA (continued) Click the mouse to move to the next page. Use the ESC key to exit this chapter.
Hoda Roodaki Boolean Algebra Hoda Roodaki
ECE 301 – Digital Electronics
Logic Gates and Boolean Algebra
Computer Science 210 Computer Organization
Boolean Algebra.
Boolean Algebra & De Morgan's Theorems
CHAPTER 2 Boolean Algebra
Logic Gates.
CHAPTER 1 : INTRODUCTION
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Boolean Algebra.
Boolean Expressions Lecture No. 10.
COMPUTING FUNDAMENTALS
FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA
Lecture 3: Boolean Algebra
Karnaugh Maps (K-Maps)
Computers & Programming Languages
Boolean Algebra & Logic Circuits
Basic Logic Gates 1.
Computer Science 210 Computer Organization
January 19 W’05 Yutao He 4532B Boelter Hall CSM51A/EEM16-Sec.1 W’05
Logic Gates.
Boolean Algebra Introduction CSCI 240
Boolean Algebra.
CSE 20: Lecture 8 Boolean Postulates and Theorems CK Cheng
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
BOOLEAN ALGEBRA.
Laws & Rules of Boolean Algebra
Presentation transcript:

BOOLEAN ALGEBRA Only involves in calculations of TRUE and FALSE; either be inputs or output. When a logic statement is TRUE it is assigned a Boolean logic value of one (1). When a logic statement is FALSE it is assigned a Boolean logic value of zero (0)

TWO VARIABLES Let have two binary variables : A and B. Each of the variables can have either TRUE (1) or FALSE (0) value. CombinationAB Combination 1FALSE (0) Combination 2FALSE (0)TRUE (1) Combination 3TRUE (1)FALSE (0) Combination 4TRUE (1)

There are only four ways to combine these two variables, i.e.; ABCombination

OR and AND In this examples, there are two inputs, i.e., A and B, and output, i.e.,C. OR symbol A A + B = C (Probability add) B C AND symbol A C A x B = C (Probability multiply) B or A.B = C or AB = C

Remember there are four ways to combine the two outputs ; OR means either. If any of the values is TRUE (1) the answer (resulting value) is TRUE (1). AND meant both. Only if both A and B are true, only then the resulting value is TRUE (1). AB ABC = A + BD = AB

For OR operation, there is only one out of four chance to be FALSE (0), i.e., when both A and B are FALSE. On the other hand for AND operation, there is only one chance out of four to TRUE (1), i.e., when both A and B are TRUE. What happen if more two input variables involved, say X, Y, Z. Let; C = X + Y + Z D = X.Y.Z

XYZC = X+Y+ZD = X.Y.Z

Z Y X Z Y C = X + Y +Z OR gate AND gate X

Those qualities which are valuable tools for working problems are designated as Theorems. Intermediate results necessary in the proof of the theorems and results, which are included only for the sake of completeness, are called Lemmas. LEMMA AND THEOREMS OF BOOLEAN ALGEBRA

LEMMA 1: The 0 and 1 are unique. LEMMA 2: For every element a in K, a+a = a, and a.a = a LEMMA 3: For every element a in K, a+1 = 1, a.0 = 0 LEMMA 4: The element 1 and 0 are distinct LEMMA 5: For every pair of elements of a and b in K, a+ab = a and a (a+b) = a LEMMA 6: The for every a in K is unique, a.a = 0 and a +a = 1 LEMMA 7: For every a in K, a = a LEMMA 8 : a [(a + b) + c] = [(a + b) + c] a = a THEOREM 9: For any three elements a, b and c in K, a+ (b+c) = (a+b) + c and a(bc) = (ab)c THEOREM 10: For any pair of elements a and b in K, a+ab = a+b; a(a+b) = ab THEOREM 11: For any pair of elements a and b in K, a+b = ab; ab= a+ab