Boolean Algebra and Truth Table The mathematics associated with binary number system (or logic) is call Boolean: –“0” and “1”, or “False” and “True” –Calculation.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Announcements mid-term on Thursday 12:30 – be on time. Calculators allowed (required!) No assignment due this week Assignment 6 posted on Thursday Project.
Digital logic gates.
Logic Gates.
CT455: Computer Organization Logic gate
Boolean Algebra and Logic Gate
Gates and Circuits. Three Main Gates  AND  OR  NOT.
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
4/11/03 Minute Paper How does MS window work? Like how do we have the screen on the computer. Is it just a bunch of Binary #’s representing colors? When.
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.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
UNIT-8 LOGIC GATES.
Boolean math is the cornerstone of digital communications, whether you are talking computers, PLC, or Cisco Routers on the Internet. ©Emil Decker, 2009.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
CS1Q Computer Systems Lecture 5 Simon Gay. Lecture 5CS1Q Computer Systems - Simon Gay2 Where we are Global computing: the Internet Networks and distributed.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
Gates and Circuits Monday/Wednesday Week 7. Electronic Circuits  Two types of circuit diagrams See pp. 238 in The Analytical Engine by Decker and Hirshfield.
BUILDING COMPUTER CIRCUITS prepared by Burak Galip ASLAN September, 2006 BOOLEAN LOGIC AND GATES CONTROL CIRCUITS.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.
Logic Gates & Boolean Algebra Chin-Sung Lin Eleanor Roosevelt High School.
Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.
LOGIC GATES.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
4. Electrons and electronics 4.5 Digital electronics.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.
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. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
Digital Fundamentals Floyd Chapter 3 Tenth Edition
CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
1 GCSE Computing Binary Logic. GCSE Computing 2 Candidates should be able to understand and produce simple logic diagrams using the operations NOT, AND,
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Fundamental Logic Gates And, Or, Not. Logic Gates: The Basics Regulate the flow of electricity within circuits to perform desired functionalities Each.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Combinational Logic Logic gates. and, or, not Derived gates. nand, nor, xor John F. Wakerly – Digital Design. 4 th edition. Chapter 4.
Minute Paper 4/4/04 Z=50+j86.7=100
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Logic Gates Review. Logic Gates OR gate – 1 if either input is 1 – 0 if they both are 0.
LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
Logic gates.
Boolean Algebra & Logic Gates
Digital Logic.
ECE 3130 Digital Electronics and Design
Combinational Logic Logic gates. and, or, not Derived gates.
Logic Gates.
Boolean Algebra & De Morgan's Theorems
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Practice #Digital Logic Mr. Burleson
Agenda – 2/12/18 Questions? Readings: CSI 4, P
For OCR GCSE Computing Unit 1 - Theory
Logic Gates.
Boolean Algebra.
KS4 Electricity – Electronic systems
GCSE Computer Science – Logic Gates & Boolean Expressions
XOR Function Logic Symbol  Description  Truth Table 
Truth tables Mrs. Palmer.
Department of Electronics
ECE 352 Digital System Fundamentals
What are Logic Gates?.
DIGITAL ELECTRONICS AND LOGIC GATES. ANALOG SIGNAL:- Analog signal is continuous time varying current or voltage signal.
Presentation transcript:

Boolean Algebra and Truth Table The mathematics associated with binary number system (or logic) is call Boolean: –“0” and “1”, or “False” and “True” –Calculation can be carried out in terms of truth table: list all possible combinations of inputs and corresponding output: InputsOutput ABC n inputs, 2 n combinations Logic Function  logic gate (devices)

AND Gate A:B:C: A:B:C: (in) (out) (in) (out) FFF 000 FTF 010 TFF 100 TTT 111 The AND operation has the usual logical significance -- the outcome is true if, and only if, both inputs are true. The symbol for AND looks like the "dot" representing the usual multiplication of two numbers; note that the truth table looks correct for multiplication of "0"s and "1"s.

NOT Gate A:C: (in)(out) 01 10

NAND Gate A:B:C: (in) (out) Please note the connection between the NAND and the AND gate. The output of the NAND gate is opposite of the AND gate -- NAND stands for NOT AND. In digital logic NOT represents the opposite -- NOT true is false, NOT 1 is 0. The symbol for NOT is a bar over whatever quantity is being "NOTed." Compare the schematic symbols for NAND and AND -- the "bubble" near the output of the NAND gate represents the NOT operation. The NAND is one of the binary operations most heavily used in digital logic, an operation involving two input states, resulting in one of two possible output states. These electronic circuits are known as gates because they control the flow of bits (information) through the overall circuit. Note that the truth table is independent of fabrication details; i.e. whether it is a CMOS gate or from a different logic "family" does not change the logic of the operation -- the actual gate is constructed to create the desired truth table.

OR Gate A:B:C: (in) (out) The OR operation also has the usual logical significance -- the outcome is true if either of the two inputs are true. The symbol for OR looks like the "plus" representing the usual addition of two numbers; note that the truth table looks correct for addition of "0"s and "1"s, except for the last entry.

NOR Gate A:B:C: (in) (out)

Example of Gate Combinations Using the truth tables above, construct the truth table for the following combination of gates: What does this circuit accomplish? ABDEC Detect whether the inputs are the same or not

Concept Check: Logic Gate Which of the following inputs yields D = 0? ABC a: 110 b: 001 c: 011 Answer: a and c

De Morgan’s Laws