1 GCSE Computing Binary Logic. GCSE Computing 2 Candidates should be able to understand and produce simple logic diagrams using the operations NOT, AND,

Slides:



Advertisements
Similar presentations
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.
Advertisements

ADDER, HALF ADDER & FULL ADDER
Gates and Circuits. Three Main Gates  AND  OR  NOT.
Section 10.3 Logic Gates.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
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.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
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.
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Lecture 3. Error Detection and Correction, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Combinational Logic Design CS341 Digital Logic and Computer Organization F2003.
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.
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.
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.
Logic Gates. Transistors as Switches ¡EB voltage controls whether the transistor conducts in a common base configuraiton. ¡Logic circuits can be built.
Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
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. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
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.
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Teaching Computing to GCSE Level with Python Session 3.
WORKING PRINCIPLE OF DIGITAL LOGIC
Winter 2016CISC101 - Prof. McLeod1 Today How transistors can carry out commands in a CPU. For example, how to add two integers in an integrated circuit.
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 The processor is made up of millions of logic gates. These are used to make decisions. Each gate takes an electric input and outputs a result.
Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.
GCSE OCR Computing A451 Binary logic Computing hardware 6.
Logic Gates and Boolean Algebra
Chapter 2.3 Binary Logic.
Combinational Circuits
Jeremy R. Johnson Wed. Sept. 29, 1999
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
Computer Science 210 Computer Organization
Teaching Computing to GCSE
Circuits, Truth Tables & Boolean Algebra
XOR, XNOR, & Binary Adders
For OCR GCSE Computing Unit 1 - Theory
Boolean Algebra.
Week 7: Gates and Circuits: PART II
Digital Logic.
Number Systems and Circuits for Addition
Logic Gates.
Logic Gates.
Adders.
GCSE Computer Science – Logic Gates & Boolean Expressions
Digital Logic.
Input > Process > Output
DIGITAL ELECTRONICS B.SC FY
Binary Logic.
XOR, XNOR, and Binary Adders
Circuits, Truth Tables & Boolean Algebra
XOR Function Logic Symbol  Description  Truth Table 
Truth tables Mrs. Palmer.
Dept. of Electrical and Computer Eng., NCTU
Presentation transcript:

1 GCSE Computing Binary Logic

GCSE Computing 2 Candidates should be able to understand and produce simple logic diagrams using the operations NOT, AND, OR GCSE Computing Learning Objectives :

GCSE Computing 3 The simplified AND gate shown above has two inputs, switch A and switch B. The bulb Q will only light if both switch A AND B are closed. This will allow current to flow through the bulb, illuminating the filament.

GCSE Computing 4 The simplified OR gate shown above has two inputs, switch A and switch B. The bulb Q will light if either switch A OR B are closed. This will allow current to flow through the bulb, illuminating the filament.

GCSE Computing The logic in used in computer systems is called Boolean logic because there are only 2 possible values, TRUE or FALSE (represented in binary as 1 or 0).

GCSE Computing Students taking Computing are in set A Students taking Media are in set B Computing Media

GCSE Computing Students taking Computing AND Media are in the intersection of set A AND set B

GCSE Computing Students taking Computing OR Media are in the combination of set A OR set B

GCSE Computing Students NOT taking Computing Computing

GCSE Computing A AND B – True if and only if both A and B are true. This gate has 2 inputs and 1 output. A OR B – True if A is true, or B is true, or both. This gate has 2 inputs and 1 output. NOT A - True if A is false. This gate has 1 input and 1 output.. AND OR NOT B B B B A A A A A A

GCSE Computing Use to demonstrate switching of inputs and outputs for AND/OR/NOT gates.

GCSE Computing Worksheet 1: Truth Tables - To produce a truth table you need to work out the outputs for every possible combination. AQ 0 1 A A Q Q ABQ A A B B Q Q ABQ NOT OR A A B B Q Q AND

GCSE Computing Logic circuits can be combined. Start with some simple examples. For each example work through the circuit one gate at a time from input to output working out the truth table and the Boolean algebra for each intermediate stage. ABCQ A AND B = C NOT C = Q NOT(A AND B) = Q A AND B = C NOT C = Q NOT(A AND B) = Q ABCQ NOT A = C C AND B = Q (NOT A) AND B = Q NOT A = C C AND B = Q (NOT A) AND B = Q

GCSE Computing If a logic diagram has only 2 inputs then there will only be 4 combinations of inputs (00, 01, 10 and 11) but 3 inputs would give 8 possible combinations and 4 inputs would give 16 combinations. For example, for the following logic diagram, there are 3 inputs, so there are 2^3 (8) combinations. D = NOT(A OR B) E = B AND C Q = E OR D Q = (B AND C) OR (NOT(A OR B)) D = NOT(A OR B) E = B AND C Q = E OR D Q = (B AND C) OR (NOT(A OR B)) ABCDEQ

GCSE Computing This circuit adds two bits. It has 2 outputs: the sum and the carry bit. It is called a half adder. This is a very important point as it explains the purpose of learning about logic gates. They are used to build circuits that perform arithmetic in a processor. Carry = A AND B E = NOT(A AND B) D = AOR B Sum = ( AOR B) AND ( NOT(A AND B)) Carry = A AND B E = NOT(A AND B) D = AOR B Sum = ( AOR B) AND ( NOT(A AND B)) ABDESC

GCSE Computing Useful Links Royal Institution – All very logical logical.pdf#page=1 Youtube - Logic gates using toys How are logic gates made? 16 GCSE Computing

A combination of NAND gates can be used to simulate any other gate. This is an OR gate. Many logic circuits are built entirely out of NAND gates because they are cheap to produce. This also demonstrates De Morgan’s Law. C = NOT A D = NOT B NOT (C AND D) = Q NOT(NOT A AND NOT B) = Q ABCDQ