Programming for GCSE Topic 9.1: Logic Circuits T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen Mary.

Slides:



Advertisements
Similar presentations
DAT2343 Basic Logic Gates © Alan T. Pinck / Algonquin College; 2003.
Advertisements

Logic Gates.
Computer Science 210 Computer Organization Introduction to Logic Circuits.
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
Programming for GCSE Topic 3.1: If Statements in Python T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science.
CSE 311: Foundations of Computing Fall 2013 Lecture 3: Logic and Boolean algebra.
Programming for GCSE Topic 3.3: Boolean Logic and Truth Tables
Computer Science 101 Circuit Design Algorithm. Circuit Design - The Problem The problem is to design a circuit that accomplishes a specified task. The.
Think about the following expression If the number entered is greater than 15 but less than 25 or the number is 100 and the letter chosen is after p but.
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
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 & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
Introduction to Computer Science David Goldschmidt, Ph.D. Computer Science The College of Saint Rose CIS September 6, 2007.
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.
Chapter 2: Binary logic OCR Computing for GCSE © Hodder Education 2011.
Computer Science 101 Logic Gates and Simple Circuits.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.
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.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
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.
ITEC 352 Lecture 3 Low level components(2). Low-level components Review Electricity Transistors Gates Really simple circuit.
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,
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Minute Paper 4/4/04 Z=50+j86.7=100
Binary Logic Derrington KCL CPD/SKE Binary We’ve seen how data of all different sorts and kinds can be represented as binary bits… 0s and 1s 1 is.
Logic Gates and Boolean Algebra Introduction to Logic II.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Programming for GCSE Topic 9.2: Circuits for Adding T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen.
L OGIC G ATES Computer Organization – week 3. W HAT ’ S ALU? 1. ALU stands for: Arithmetic Logic Unit 2. ALU is a digital circuit that performs Arithmetic.
Logic gates.
Computer Architecture & Operations I
Computer Architecture & Operations I
GCSE OCR Computing A451 Binary logic Computing hardware 6.
Activity 1 5 minutes Grab a whiteboard and pen, come to the front and work out the Truth Table for the following circuit: R A B C Q.
Digital Logic.
Truth Table to Statement Form
Morgan Kaufmann Publishers
Component 1 Logical operators.
Logic Gates.
Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.
Computer Science 210 Computer Organization
CHAPTER 2 Boolean Algebra
Logic Gates.
Chapter 2.3 Binary Logic.
TN 221: DIGITAL ELECTRONICS 1
Jeremy R. Johnson Wed. Sept. 29, 1999
Aberdeen Grammar School
Practice #Digital Logic Mr. Burleson
Computer Science 210 Computer Organization
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Elec 2607 Digital Switching Circuits
Week 7: Gates and Circuits: PART II
Logic Gates.
Logic Gates.
Adders.
GCSE Computer Science – Logic Gates & Boolean Expressions
Binary Logic.
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
XOR Function Logic Symbol  Description  Truth Table 
Truth tables Mrs. Palmer.
Boolean Algebra and Gate Networks
Boolean Algebra By: Asst Lec. Besma Nazar Nadhem
ECE 352 Digital System Fundamentals
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Programming for GCSE Topic 9.1: Logic Circuits T eaching L ondon C omputing William Marsh School of Electronic Engineering and Computer Science Queen Mary University of London

Aims Show how computers are built from logic gates Logic gates … and truth tables … and boolean algebra … Circuit for Adding

Teaching Issue How to provide a coherent, joined up view Some curricula include logic circuits but it is not related to operation of a computer Logic circuits add binary numbers computer architecture

L OGIC G ATES And, Or, Not

Logic Gates Logic gates are electronic components Transistors Gates behave like switches Two states State represented by a boolean variable open, X = 0 closed, X = 1

Basic Logic Gates OR gate AND gate X Y X X Y X Y Y

NOT Gate Only 1 input Xnot X X

Basic Logic Gates OR gate NOT gate AND gate X Y X Y Xnot X

Connecting Gates Output of one gate connects to input for next X0X0 X1X1 Y X2X2

T RUTH T ABLES F OR C IRCUITS

AND, OR OR gate AND gate X Y X Y X Y X. Y X Y X + Y True when either X or Y true True when both X and Y true

Circuit to Truth Table Test a circuit X0X0 X1X1 Y X2X2 X2 X1 X0 Y

Circuit to Truth Table Test a circuit X0X0 X1X1 Y X2X2 X2 X1 X0 Y

Circuit to Truth Table Test a circuit X0X0 X1X1 Y X2X2 X2 X1 X0 Y Two circuits equivalent if (and only if) they have the same truth table

T RANSLATING C IRCUITS TO B OOLEAN A LGEBRA

Circuit to Formula Label each point in turn X0X0 X1X1 X2X2 X 0 or X 1 (X 0 or X 1 ) and X 2 not X 1 ((X 0 or X 1 ) and X 2 ) or not X 1

De-Morgans Laws – Recap Important law for exchanging AND with OR ( A. B ) = A + B A and B is false when either A is false or B is false ( A + B ) = A. B A or B is false when both A is false and B is false

De-Morgans Law II Same with circuits Quiz: draw the other law as a circuit A B A B ( A + B ) = A. B

De-Morgans Law III Second law as a circuits A B A B ( A. B ) = A + B

Summary Logic circuits Build a computer Truth table Specify a circuit Boolean expression (formula) Algebraic rules All express same thing Translate from one to other