Unit 1 Logical operators.

Slides:



Advertisements
Similar presentations
CT455: Computer Organization Logic gate
Advertisements

Computer Science 210 Computer Organization Introduction to Logic Circuits.
GCSE Computing#BristolMet Session Objectives#5 MUST explain why data is represented in computer systems in binary SHOULD understand and produce simple.
Chapter 4 Gates and Circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
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.
3. DIGITAL ELECTRONICS..
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
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.
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
A-Level Computing#BristolMet Session Objectives#6 MUST understand and produce simple logic diagrams using the operations NOT, AND and OR SHOULD explain.
Teaching Computing to GCSE Level with Python Session 3.
Boolean and Sequential Logic Last week – Basic Gates AND OR NOT NOR XOR NAND.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
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.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
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 Review. Logic Gates OR gate – 1 if either input is 1 – 0 if they both are 0.
GCSE Computing – Topic 2 Lesson 5a – Binary Logic CHALLENGE TO: identify the different types of logic diagrams. ASPIRE TO: Construct a truth table for.
Primary and Secondary Storage
Input, Output, and Specialist Devices
IP and MAC Addresses, DNS Servers
Boolean Algebra & Logic Gates
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.
Creating logic gates with Minecraft
Basics of Logic gates - Part 1
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Additional hardware components, and Embedded Systems
Logic Gates and Truth Tables
Component 1 Logical operators.
Binary, Denary, Hexadecimal Conversion Binary Addition
Arithmetic Shifts and Character Representation
Logic Gates.
Questions Describe the following gates
CSIS-110 Introduction to Computer Science
CSCI-100 Introduction to Computing
Chapter 2.3 Binary Logic.
Component 1 – 2A, B, C Binary Logic
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Agenda – 2/12/18 Questions? Readings: CSI 4, P
Thursday, 22 November 2018 Logic Gates
3.4 Computer systems Boolean logic Lesson 2.
For OCR GCSE Computing Unit 1 - Theory
Week 7: Gates and Circuits: PART II
Boolean Logic Boolean Logic is considered to be the basic of digital electronics. We know that a computer’s most basic operation is based on digital electronics.
Logic Gates.
GCSE Computer Science – Logic Gates & Boolean Expressions
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Binary Logic.
Chapter 4 Gates and Circuits.
Objectives Construct truth tables for the following logic gates:
Truth tables Mrs. Palmer.
Department of Electronics
Component 1 – 2A, B, C Binary Logic
Introduction to Logic diagrams and truth tables
Further binary, Logic diagrams and truth tables
Introduction to Logic diagrams and truth tables
What are Logic Gates?.
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Unit 1 Logical operators

Assessment Outcomes 4G Logical operations 4H Truth tables using up to 3 logical operations

Learning Intentions and Outcomes Learning Intention: To develop an understanding of the NOT, AND, OR, and XOR Logic gates Grade Pass Use AND, OR, NOT and XOR logical operators to create simple truth tables Grade Merit Combine logic gates to create logic circuits and filling in appropriate truth tables Analyse logic circuits to calculate an output, creating appropriate truth tables Grade Distinction Complete truth tables for standard logic circuits without the use of diagrams Combine 8 bit registers using standard logic operators

Starter Pre-Reading Recap What is a logic gate? What is the difference between a not gate and an or gate? What does an XOR gate do? What does an AND gate do? Describe how an OR gate works How many Inputs can a logic gate have? What happens when you combine an AND and a NOT gate? What is the difference between an AND and a NAND gate? If I have a 1 and a 0 pass through an AND gate what is the output? If I have a 1 and a 0 pass through a Not gate what is the output? If I have a 1 and a 0 pass through an OR gate what is the output?

Thinking Task What can you tell me about this?

Thinking Task What can you tell me about this? If there are CLOUDS and COLD there will be RAIN

Thinking Task What can you tell me about this? If A and B are TRUE then Q is TRUE

Thinking Task

Thinking Task Q=1 when A is not 1 Only 1 and 1 = 1 1 and 0 = 0 (or does not = 1)

Logical operators - Binary Why is binary so important? Fundamentally computers are electronic and can decide between two states – true or false, on or off, presence or absence of current and translate this into the binary representation of 1 or 0

Binary Logic As computers use transistors and capacitors to store binary data we can wire them together to make simple logical calculations These simple circuits are known as logic gates There are four fundamental gates you know need to know about: NOT gate AND gate OR gate XOR gate (Exclusive OR gate)

Boolean Algebra: P = NOT A Binary Logic – Not Gate If 0 is input it outputs 1 If 1 is input it outputs 0 INPUT A OUTPUT P Boolean Algebra: P = NOT A Logic Diagram

Boolean Algebra: P = A AND B Binary Logic – AND Gate If both inputs are 1 then the output is 1 Otherwise the output is 0 INPUT A B OUTPUT P Boolean Algebra: P = A AND B Logic Diagram

Boolean Algebra: P = A OR B Binary Logic – OR Gate If either input is 1 then the output is 1 Otherwise the output is 0 INPUT A B OUTPUT P Boolean Algebra: P = A OR B Logic Diagram

Boolean Algebra: P = A XOR B Binary Logic – XOR Gate If either input is 1 then the output is 1 UNLESS! Both are 1! Otherwise the output is 0 INPUT A B OUTPUT P Boolean Algebra: P = A XOR B Logic Diagram

Binary Logic – NAND Gate If both inputs are 1 then the output is 0 Otherwise the output is 1 It is the polar opposite of an AND gate! A B P 1 INPUT A B OUTPUT P Boolean Algebra: P = A AND B Truth Table Logic Diagram

Task Grade Pass Exercises Complete the Grade Pass Exercises Extension: The extension task asks you to combine multiple logic gates. Have a look at slides 16-18 to help you with this.

Combining Logic Gates We can string logic gates together to make more complex circuits Boolean Algebra: P = NOT (A AND B)

Combining Logic Gates We can string logic gates together to make more complex circuits Boolean Algebra: P = NOT (A AND B)

Combining Logic Gates We can string logic gates together to make more complex circuits Boolean Algebra: P = NOT (A AND B)

Combining Logic Gates WHAT GATE IS THIS? Boolean Algebra: P = NOT (A AND B)

Activity: Combined Logic Operators worksheet Draw a logic circuit of your own design that has at least 3 logic gates. You should also draw a truth table and write the Boolean algebra expression. 1

Graded Exercises Complete the Grade Merit and Distinction exercises You can use the pre-reading, PowerPoint, Internet to help you Grade Distinction* Extension: Check out the websites to learn a little more about how Logic Gates work Remember to be smart when using the Internet: Wikipedia is often complicated – sometimes even I don’t understand! BBC Bitesize, Teach ICT, and Revision World are better places to find your information!

Crib Sheet – What I must remember about ___ Starting Point: Read the learning outcomes from the exam board Record the key facts that you need to remember about Logical Operators! Think about what you have learnt today, what questions you have been asked, definitions of words, or anything else you think is important!

Homework Pre-Reading Notes: Low and High level programming languages Exercises: Complete the Merit level exercises