COMPUTING FUNDAMENTALS

Slides:



Advertisements
Similar presentations
BOOLEAN ALGEBRA. A Mathematical notation used to represent the function of the Digital circuit. A notation that allows variables & constants to have only.
Advertisements

1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.
Boolean rules for simplification Dr. Ahmed Telba.
Chapter 2 – Combinational Logic Circuits Part 1 – Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 3 Dr. Shi Dept. of Electrical and Computer Engineering.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.
1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Digital Logic Design ESGD2201
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
Boolean Algebra ‘An algebra of Logic’ Prepared by: Manish Kumar, Asst Master (Comp. Sc.) Sainik School Gopalganj.
22C:19 Discrete Math Boolean Algebra & Digital Logic Fall 2010 Sukumar Ghosh.
Lecture 2 – Boolean Algebra Lecturer: Amy Ching Date: 21 st Oct 2002.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
Combinational Logic 1.
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
Identity and Equality Properties. Properties refer to rules that indicate a standard procedure or method to be followed. A proof is a demonstration of.
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.
Math 021.  An equation is defined as two algebraic expressions separated by an = sign.  The solution to an equation is a number that when substituted.
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.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Digital Logic Design Week 4 Boolean algebra. Laws and rules De Morgan’s theorem Analysis of logic circuits Standard forms Project 1 preparation.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
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.
Chapter 2 Boolean Algebra and Minimization Techniques.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
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).
Boolean Algebra.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Introduction to Digital Electronics Lecture.
Hoda Roodaki Boolean Algebra Hoda Roodaki
Boolean Algebra & Logic Gates
Logic Gates and Boolean Algebra
Computer Science 210 Computer Organization
De Morgan’s Theorem,.
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture)
Boolean Algebra & De Morgan's Theorems
Logic Gates and Boolean Algebra
Identity and Equality Properties
Identity and Equality Properties
CHAPTER 1 : INTRODUCTION
… and now for the Final Topic:
Prof. Giancarlo Succi, Ph.D., P.Eng.
Boolean Algebra.
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
Boolean Algebra A Boolean algebra is a set B of values together with:
Propositional Calculus: Boolean Algebra and Simplification
Boolean Algebra.
BASIC & COMBINATIONAL LOGIC CIRCUIT
Boolean Algebra Digital Electronics
CSE 370 – Winter Combinational Logic - 1
Computer Science 210 Computer Organization
Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: We can represent.
Fundamentals of Computer Systems
Yes, No, Maybe... BooleanAlgebra 12/10/2018.
Boolean Algebra.
Boolean Algebra.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
Digital Fundamentals Floyd Chapter 4 Tenth Edition
Boolean Algebra How gates get picked.
BOOLEAN ALGEBRA.
Laws & Rules of Boolean Algebra
Presentation transcript:

COMPUTING FUNDAMENTALS Instructor: Romana Farhan Assistant Professor CPED Lecture # 04

Overview Boolean algebra AND OR NOT

Boolean Algebra The Greek philosopher Aristotle founded a system of logic based on only two types of propositions: true false

Boolean Algebra contd.. Later on The English mathematician George Boole (1815-1864) tried to give symbolic form to Aristotle's system of logic. He defined several rules of relationship between mathematical quantities limited to one of two possible values: true or false => 1 or 0. His mathematical system became known as Boolean algebra.

Boolean Algebra contd.. All arithmetic operations performed with Boolean quantities have one of two outcomes. Either 1 or 0 Boolean numbers are not the same as binary numbers. Boolean numbers represent an entirely different system of mathematics from real numbers. Binary is nothing more than an alternative notation for real numbers. But both Boolean math and binary notation use the same two ciphers: 1 and 0

Some Definitions Complement: variable with a bar over it A, B, C Literal: variable or its complement A, A, B, B, C, C Implicant: product of literals ABC, AC, BC Minterm: product that includes all input variables ABC, ABC, ABC Maxterm: sum that includes all input variables (A+B+C), (A+B+C), (A+B+C) Copyright © 2007 Elsevier

Addition of numbers in Boolean algebra Let us begin our exploration of Boolean algebra by adding numbers together: What is the difference between the first three and last sum?

Addition of numbers in Boolean algebra contd.. Consider the following sums: What is the pattern of first two equations?

OR Gate

Multiplication in Boolean Algebra Multiplication is valid in Boolean algebra, it is the same as in real-number algebra: anything multiplied by 0 is 0, anything multiplied by 1 remains unchanged: Are you familier?

AND Gate

Boolean variables  Boolean algebra uses alphabetical letters to denote variables. Unlike "normal" algebra, though, Boolean variables are always CAPITAL letters, never lower-case. For example if variable "A" has a value of 0, then the complement of A has a value of 1. Boolean notation uses a bar above the variable character to denote complementation, like this:

Boolean variables contd..

Boolean Algebraic Identities An identity is a statement true for all possible values of its variables. The algebraic identity of x + 0 = x tells us that anything (x) added to zero equals the original "anything," no matter what value that "anything" (x) may be. Boolean algebra has its own unique identities based on the bivalent states of Boolean variables.

Total number of Boolean additive Identities Four identities A+0 A+1 A+A A+A̅

Boolean Additive Identities

Boolean Multiplicative Identities  Ax0 Ax1 AxA AxA̅

Summary of Boolean Identities

Double complement a variable inverted twice. Complementing a variable twice (or any even number of times) results in the original Boolean value.

Basic Boolean Algebra Properties

Basic Boolean Algebra Properties contd..

Basic Boolean Algebra Properties contd..

Distributive Property illustrating how to expand a Boolean expression formed by the product of a sum, and in reverse shows us how terms may be factored out of Boolean sums-of-products:

Boolean Rules for Simplification

Solve A+AB=?

Example 1 of circuit

Sol:

Example 2 of circuit

Example 3 of circuit

Example 4 of circuit

Example 5 of circuit

Summary Boolean algebra is based on logic defined by Aristotle. Boolean algebra is different from algebra and binary numbers Boolean algebra has arithmetic operations like addition, multiplication. Different properties also of Boolean algebra arithmetic also exist. Boolean algebra has simple rules to solve digital circuits.

Questions

References http://www.allaboutcircuits.com/vol_4/chpt_ 7/1.html