Presentation is loading. Please wait.

Presentation is loading. Please wait.

GCSE Computer Science – Logic Gates & Boolean Expressions

Published bySharlene Park Modified over 5 years ago

Similar presentations

Presentation on theme: "GCSE Computer Science – Logic Gates & Boolean Expressions"— Presentation transcript:

1 GCSE Computer Science – Logic Gates & Boolean Expressions
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem Logic Gates And Boolean Expressions GCSE Computer Science – Logic Gates & Boolean Expressions

2 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem NOT NOT gates are the only gate that has a single input. They reverse the input: If 1 is passed in, then 0 is passed out If 0 is passed in, then 1 is passed out Draw a Truth Table for a NOT gate. Input Output 1 GCSE Computer Science – Logic Gates

3 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem AND AND gates have two inputs and a single input. They only output true if BOTH inputs are true In the case of logic gates, 1 = True and 0 = False Draw a Truth Table for an AND gate. Input A Input B Output 1 GCSE Computer Science – Logic Gates

4 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem OR OR gates have two inputs and a single input. They output true if EITHER of the inputs are true Where have you seen OR used in your programmes? Draw a Truth Table for an OR gate. Input A Input B Output 1 GCSE Computer Science – Logic Gates

5 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem NAND NAND gates are a combination of a NOT & an AND gate They output true if EITHER of the inputs are NOT True Notice the nose added to the AND gate symbol – that’s the nose from the NOT gate Draw a Truth Table for a NAND gate. Input A Input B Output 1 GCSE Computer Science – Logic Gates

6 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem NOR NOR gates are a combination of a NOT & an OR gate They output true if BOTH of the inputs are False Notice the nose added to the OR gate symbol – that’s the nose from the NOT gate Draw a Truth Table for a NOR gate. Input A Input B Output 1 GCSE Computer Science – Logic Gates

7 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem XOR XOR gates are a special gate known as Exclusive OR They output true if one input is True and the other is False In a Boolean Expression, these are written as ⊕ Draw a Truth Table for a XOR gate. Input A Input B Output 1 GCSE Computer Science – Logic Gates

8 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem GCSE Computer Science – Logic Gates

9 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem GCSE Computer Science – Logic Gates

10 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem GCSE Computer Science – Logic Gates

11 GCSE Computer Science – Logic Gates
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem GCSE Computer Science – Logic Gates

12 GCSE Computer Science – Boolean Equations
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem NOT When showing a symbol with a NOT, we use a ¬ symbol before the letter to represent the NOT gate. Write a Boolean Equation for the following problem: P is true when A is not True P = ¬ A GCSE Computer Science – Boolean Equations

13 GCSE Computer Science – Boolean Equations
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem AND When showing a symbol with an AND, we use a ^ symbol to represent the AND gate. Write a Boolean Equation for the following problem: P is true when A is not True and B is True P = ¬ A ^ B GCSE Computer Science – Boolean Equations

14 GCSE Computer Science – Boolean Equations
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem OR When showing a symbol with an OR, we use a v symbol to represent the OR gate. Write a Boolean Equation for the following problem: P is true when A is not True and B is True, or C is not true P = (¬ A ^ B) v ¬ C GCSE Computer Science – Boolean Equations

15 GCSE Computer Science – Boolean Equations
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem NAND Just like the NOT gate, we use a ¬ before the symbols, but the NAND gate draws the symbol before both inside brackets. Write a Boolean Equation for the following problem: P is true when A and B are not True, or C is true P = ¬(A ^ B) v C GCSE Computer Science – Boolean Equations

16 GCSE Computer Science – Boolean Equations
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem NOR Like the NAND gate, the NOR gate uses the ¬ symbol from the NOT in front of both symbols. Write a Boolean Equation for the following problem: P is true when A or B is not true, and C is true P = ¬(A v B) ^ C GCSE Computer Science – Boolean Equations

17 GCSE Computer Science – Boolean Equations
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem XOR As shown before, when we write an XOR in a Boolean Expression, we use the special symbol ⊕ - look closely and you’ll see that it uses an alternative for the OR symbol (+) and draws a circle around it to show it’s exclusive. Write a Boolean Equation for the following problem: P is true when A is not True and B is True, or B is not True and A is True P = A ⊕ B GCSE Computer Science – Boolean Equations

18 GCSE Computer Science – Exam Practice
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem GCSE Computer Science – Exam Practice

19 GCSE Computer Science – Exam Practice
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem Draw the circuit diagram that will represent the expression P = NOT (A AND B) GCSE Computer Science – Exam Practice

20 GCSE Computer Science – Exam Practice
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem GCSE Computer Science – Exam Practice

21 GCSE Computer Science – Exam Practice
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem GCSE Computer Science – Exam Practice

22 GCSE Computer Science – Exam Practice
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem GCSE Computer Science – Exam Practice

23 GCSE Computer Science – More Help
Learning Objectives Use and create electronic circuits Understand and define logical functions Draw truth tables from a given circuit Recognise logic gates from a given truth table Produce a logic circuit to solve a given problem More Help @TeachAllAboutIT GCSE Computer Science – More Help

Download ppt "GCSE Computer Science – Logic Gates & Boolean Expressions"

Similar presentations

Logic Gates.

Logic Gates.
Logic Gates.

Logic Gates.
CT455: Computer Organization Logic gate

CT455: Computer Organization Logic gate
Computer Science 210 Computer Organization Introduction to Logic Circuits.

Computer Science 210 Computer Organization Introduction to Logic Circuits.
Programmable Logic Controllers.

Programmable Logic Controllers.
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.

ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.

Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
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.

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.
1 Survey of Computer Science CSCI 110, Spring 2011 Lecture 16 Digital Circuits, binary Numbers.

1 Survey of Computer Science CSCI 110, Spring 2011 Lecture 16 Digital Circuits, binary Numbers.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office 305.02,

Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
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:

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:
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.

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.
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.

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.
GCSE Computing: A451 Computer Systems & Programming www.computerscienceuk.com Activity 1 Grab a whiteboard and pen, come to the front and work out the.

GCSE Computing: A451 Computer Systems & Programming Activity 1 Grab a whiteboard and pen, come to the front and work out the.
TODAY YOU ARE LEARNING....... 1. to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.

TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.

 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
LOGIC GATES.

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.

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.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.

Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

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

Similar presentations

Ads by Google