Boolean Operations 1 and 1 = 1.

Slides:



Advertisements
Similar presentations
ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
Advertisements

DAT2343 Basic Logic Gates © Alan T. Pinck / Algonquin College; 2003.
Logic Gates.
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
XOR, XNOR, and Binary Adders
CS 210.  How do we represent data in a computer? ◦ Easy to recognize two conditions:  1. Presence of a voltage – we’ll call this state “1”  2. Absence.
LOGIC GATES Logic generally has only 2 states, ON or OFF, represented by 1 or 0. Logic gates react to inputs in certain ways. Symbol for AND gate INPUT.
Binary Addition CSC 103 September 17, 2007.
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.
Logic Gates How Boolean logic is implemented. Transistors used as switches to implement Boolean logic: ANDOR Logic with Transistors.
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
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.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.
Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas
Basic logic gates  AND gate:The truth table is given by A.BBA
Gates and Logic Dr John Cowell phones off (please)
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
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. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
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.
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,
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 2. NAND and XOR Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.
Logic Gates and Boolean Algebra Introduction to Logic II.
Logic Gates Review. Logic Gates OR gate – 1 if either input is 1 – 0 if they both are 0.
CS 111 – Aug. 27 Section 1.1 –Binary data and operations –Logic gates –Flip-flop –A binary shorthand: hexadecimal Commitment for next day: –Please read.
Computer Architecture & Operations I
Unit 1 Logical operators.
GCSE OCR Computing A451 Binary logic Computing hardware 6.
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Component 1 Logical operators.
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Logic Gates.
Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.
EI205 Lecture 5 Dianguang Ma Fall 2008.
CSCI-100 Introduction to Computing
Exclusive OR Gate.
Combinational Circuits
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
How Boolean logic is implemented
UNIVERSAL GATES.
Logic Gates.
Boolean Algebra.
Digital Logic.
Logic Gates.
KS4 Electricity – Electronic systems
GCSE Computer Science – Logic Gates & Boolean Expressions
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Logic Gates.
Combinational Circuits
Binary Logic.
Chapter 4 Gates and Circuits.
Truth tables Mrs. Palmer.
Department of Electronics
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Eng. Ahmed M Bader El-Din October, 2018
Dept. of Electrical and Computer Eng., NCTU
Logic Gates By: Asst Lec. Besma Nazar Nadhem
Presentation transcript:

Boolean Operations 1 and 1 = 1

Boolean Logic Boolean Logic Examples: Logical rules for dealing with true/false values Examples: You get an F if you skip the test OR if you get below 60 You can register for CS161 if you have taken CS160 AND you have taken MTH111

Boolean Operators Boolean Operations Combine/modify boolean values Computers implements as logic gate circuits

Or Rule OR rule 1 if either input is 1 0 if they both are 0

Or Rule Logic rules implemented as circuits Can represent anything with true/false values You get an F if you skip the test OR if you get below 60

And Rule AND produces 1 if both inputs are 1 0 if either is 0

And Rule On/Off can stand for any true/false idea You can register for CS161 if you have taken CS160 AND you have taken MTH111

Boolean Operators Truth Table : Shows every combination of inputs and their output Input1 Input2 Out 1

Basic Rules – 1 input If it is not raining my drive is easier NOT Output is 1 if input is 0 Output is 0 if input is 1 If it is not raining my drive is easier In Out 1

Basic Rules – 2 inputs AND OR XOR (exclusive OR) 1 if both inputs 1 Out 1 AND 1 if both inputs 1 0 otherwise OR 1 if either input is 1 0 if both are 0 XOR (exclusive OR) 1 if only one input is 1 0 if both inputs are 0 or 1 In1 In2 Out 1 In1 In2 Out 1

OR vs XOR In English "or" used for OR and XOR You can either pick up your room or you can come help do the laundry You can have an ice cream cone or two cookies

Applying rules Rules only work on two inputs Bit sequences processed on bit at a time EX: Combine with OR Input0: 1 Input1: Output:

Combining Bits Can apply a rule to combine two bit sequences: Apply rule to each pair EX: Combine with OR Input0: 1 Input1: Output:

Combining Bits Can apply a rule to combine two bit sequences: Apply rule to each pair EX: Combine with OR Input0: 1 Input1: Output:

Combining Bits Can apply a rule to combine two bit sequences: Apply rule to each pair EX: Combine with OR Input0: 1 Input1: Output:

Combining Bits Can apply a rule to combine two bit sequences: Apply rule to each pair EX: Combine with OR Input0: 1 Input1: Output: