Fundamental Logic Gates And, Or, Not. Logic Gates: The Basics Regulate the flow of electricity within circuits to perform desired functionalities Each.

Slides:

Advertisements

Similar presentations

TRUTH TABLES Section 1.3.

Advertisements

TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.

Logic & Critical Reasoning

Chapter 3 section 2. Please form your groups The 1 st column represents all possibilities for the statement that can be either True or False. The 2 nd.

Computer Systems – Logic Gates Introduce the basic logic gates Introduce truth tables Introduce Boolean algebra (dont panic!) Examples of combining gates.

Logic Gates. Digital Signals Logic Gates NOT (Inverter) Gate AND Gate OR Gate NAND Gate NOR Gate XOR Gate.

Hardware Implementations Gates and Circuits. Three Main Gates  AND  OR  NOT.

Gates and Circuits. Three Main Gates  AND  OR  NOT.

Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.

Boolean Algebra Computer Science AND (today is Monday) AND (it is raining) (today is Monday) AND (it is not raining) (today is Friday) AND (it is.

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.

The Logic of Compound Statements

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.

Logic Circuits In today’s lesson we will look at: the symbols for NOT, AND, OR and EOR using truth tables to represent logic circuits two new operators.

Truth Tables for Negation, Conjunction, and Disjunction.

The Foundations: Logic and Proofs

Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.

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.

Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.

Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.

Logic Gates & Boolean Algebra Chin-Sung Lin Eleanor Roosevelt High School.

BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.

Conditional Control Flow By Muhammad Ahsan Qadar SACS Programming Fundamentals Workshop 1.

MATH 102 Contemporary Math S. Rook

Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.

Discrete Mathematics Lecture1 Miss.Amal Alshardy.

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)

Boolean Algebra. Logical Statements A proposition that may or may not be true:  Today is Monday  Today is Sunday  It is raining.

Boolean Logic. Boolean Operators (T/F) xyx AND y FFF FTF TFF TTT xyx OR y FFF FTT TFT TTT xNOT x FT TF.

Conditional Statements

How do I show that two compound propositions are logically equivalent?

Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.

Boolean Algebra Monday/Wednesday 7th Week. Logical Statements Today is Friday AND it is sunny. Today is Friday AND it is rainy. Today is Monday OR it.

3.1 Statements and Quantifiers 3.2 Truth Tables.  A statement is a declarative sentence that is either true or false.  Examples: Mr. Healey is my math.

Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.

Simplifying Boolean Expressions. Boolean Operators (T/F) xyx AND y FFF FTF TFF TTT xyx OR y FFF FTT TFT TTT xyx XOR y FFF FTT TFT TTF xNOT x FT TF.

TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.

CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.

رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.

Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.

Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.

TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.

Minute Paper 4/4/04 Z=50+j86.7=100

Logic Gates and Boolean Algebra Introduction to Logic II.

Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.

Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.

Logic Gates Benchmark Companies Inc PO Box Aurora CO

Exclusive OR Gate.

KS4 Electricity – Electronic systems

KS4 Electricity – Electronic systems

Digital Signals Digital Signals have two basic states:

Computer Science 210 Computer Organization

Boolean Algebra.

KS4 Electricity – Electronic systems

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

GCSE Computer Science – Logic Gates & Boolean Expressions

Truth tables Mrs. Palmer.

Department of Electronics

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

What are Logic Gates?.

Presentation transcript:

Fundamental Logic Gates And, Or, Not

Logic Gates: The Basics Regulate the flow of electricity within circuits to perform desired functionalities Each gate receives one or more inputs but has only one output Represented using Schematics, Words, Symbols, and Boolean Equations

Logic Gates and Transistors

Logic Gates: AND SchematicSymbolBoolean Equation Y = A B (Output) Y is True: Only if both (Inputs) A and B are true.

Aside Boolean Variables Boolean variables are always capital letters and can only take on the values T (true) or F (false). For Example: A=TrueB=False X=true…

Logic Gates: AND continued… Ex. Are the following statements true or false ?  My name is Mr.Kurz and this is Room 231.  I am a human and I am the Prime Minister of Canada. ABY ABY FFF FTF TFF TTT Truth Tables: or 

Note on Truth Tables There is only one pattern to follow! ABY FFF FTF TFF TTT ABY ANY other way is wrong!

Logic Gates: OR SchematicSymbolBoolean Equation +Y = A + B (Output) Y is True: Only if (Inputs) A, B, or both A and B are true.

Logic Gates: OR continued… Ex. Are the following statements true or false ?  This class is ICE4M or is in Room 503.  I am a human or I am the Prime Minister of Canada. ABY ABY FFF FTT TFT TTT Truth Tables: or 

Logic Gates: NOT SchematicSymbolBoolean Equation ¯Y = A Output (Y) is True: Only if Input (A) is false.

Logic Gates: NOT continued… Ex. Which of these are true or false?  This class is not ICE4M.  I am not the Prime Minister of Canada. AY AY FT TF Truth Tables: or 

Example: Create a truth table for the following circuit: Steps:  Create Table  Fill in A, B, C  Solve one gate at a time using in between columns on the table  Solve for Y ABCA B(A+B)C 

Additional Info Equivalent Terminology: For ‘n’ inputs into any logic gate, there will be 2 n rows in your truth table. True1onopenHigh V False0offclosedLow V

The other three gates NOR – “Not Or” NAND – “Not And” Xor - “One or the other, not both”

Today 1. Complete the Logic Gate Summary Chart 2. Use the IC schematics on the resources page to set up and test each of the 6 logic gates. Pin 14 goes to Power Pin 7 to ground.