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.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Logic Gates.
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.
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.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
CMPUT 101 Lab# – October 1, Lab 4 No demo Questions and the answer sheet can be found on the course website (pdf) Write your answers.
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.
Constructing A Truth Table XYZF1F InputsOutput Input Combinations 3 – Inputs 8 – Combinations (8 = 2 3 ) Note the binary counting order.
Circuit, State Diagram, State Table
CPSC 171 Introduction to Computer Science Boolean Logic, Gates, & Circuits.
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.
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.
Summer Institute 2004 Chips and Gates An Introduction Linda Soulliere
Activity 1 Revise / remember what the term ‘binary logic’ means. What do each of the following look like: NOT gate? AND gate? OR gate? 5 minutes.
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 to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.
Chapter 2: Binary logic OCR Computing for GCSE © Hodder Education 2011.
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
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.
Teaching Computing to GCSE Level with Python Session 3.
ITEC 352 Lecture 3 Low level components(2). Low-level components Review Electricity Transistors Gates Really simple circuit.
Karnaugh Maps (K-Maps)
CO5023 Building Circuits from Truth Tables. Build the following… Let’s say we want a circuit which acts as described by the following truth table: We.
Activity 1 Grab a whiteboard and pen, come to the front and work out the Truth Table for the following circuit: 5 minutes R A B C Q.
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.
Boolean Algebra. LO:  Understand why Boolean algebra is used  Understand basic Boolean algebra notation  Understand why Boolean algebra is used  Understand.
Decoders A decoder is a logic circuit that detects the presence of a specific combination of bits at its input. Two simple decoders that detect the presence.
Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.
Logic Gates Review. Logic Gates OR gate – 1 if either input is 1 – 0 if they both are 0.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
© 2016 AQA. Created by Teachit for AQA Boolean logic Lesson 3.
Unit 1 Logical operators.
Computing Binary Logic.
GCSE OCR Computing A451 Binary logic Computing hardware 6.
Creating logic gates with Minecraft
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Lesson Objectives Aims You should be able to:
Component 1 Logical operators.
Logic Gates.
Questions Describe the following gates
Logic Gates.
Chapter 2.3 Binary Logic.
Karnaugh Maps (K-Maps)
Computer Science 210 Computer Organization
Teaching Computing to GCSE
3.4 Computer systems Boolean logic Lesson 2.
For OCR GCSE Computing Unit 1 - Theory
Logic Gates.
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.
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
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.
Combinational Circuits
Binary Logic.
Objectives Construct truth tables for the following logic gates:
XOR Function Logic Symbol  Description  Truth Table 
Logic Circuits Analysis
Truth tables Mrs. Palmer.
Department of Electronics
Principles & Applications
Eng. Ahmed M Bader El-Din October, 2018
Programming Techniques :: Logic & Truth Tables
SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.
Presentation transcript:

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

How do the gates work together to process data? Binary Logic Circuits How do the gates work together to process data?

? Binary Logic Circuits Remembering Last Lesson Binary Logic Circuits Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV Remembering Last Lesson Binary Logic Circuits In your exam you will be expected to be able to look at a circuit and produce a truth table for the inputs and outputs. A B Q ? A B Q

Binary Logic Circuits Worked Example Q A P B A B Q = Not A Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV Worked Example Q A P B A B Q = Not A P = (NOT A) AND B P = Q AND B INPUTS: A, B, C etc OUTPUTS: P, Q, R etc 1 1 1 1 1 1 1

Binary Logic Circuits A Q P B A B Q = A AND B P = NOT (A AND B) Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV Tips: Label the inputs on the circuit diagram Label the outputs on the circuit diagram Create a table with a column for each input and output Label the columns (outputs labelled in the form of an expression) Place the combinations of different zeros and ones in the input columns Workout the outputs for each output column in turn A Q P B A B Q = A AND B P = NOT (A AND B) INPUTS: A, B, C etc OUTPUTS: P, Q, R etc 1 1 1 1 1 1 1 1

What if there were 4 inputs? Binary Logic Circuits Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV Tips: When you place the combinations of different zeros and ones in the input columns…there are patterns that you can remember to help you… A B C 1 1 1 A B What if there were 4 inputs? 1 1 1 1 1 1 1 1 1 1 1 1 1 2 inputs 3 inputs

? ? Binary Logic Circuits This Lesson… Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV This Lesson… Binary Logic Circuit Expressions In your exam you will also be expected to be able to draw a diagram from an expression. ? A P ? B A B Q = A AND B P = NOT (A AND B) 1 1 1 How to we draw a diagram from an expression 1 1 1 1 1

Binary Logic Circuits A P B A B P Binary Logic Circuit Expressions Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV Binary Logic Circuit Expressions P = A AND (NOT B) ----BRACKETS FIRST!---- A 1st 2nd A P B B P

Binary Logic Circuits A P B A B P Binary Logic Circuit Expressions Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV Binary Logic Circuit Expressions P = NOT (A AND B) ----BRACKETS FIRST!---- A 1st 2nd A P B B P

Binary Logic Circuits A B P C A B C P Binary Logic Circuit Expressions Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV Binary Logic Circuit Expressions P = (A OR B) AND C ----BRACKETS FIRST!---- 1st 2nd A A B B P C C P

Binary Logic Circuits A P B A B P Binary Logic Circuit Expressions Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV Binary Logic Circuit Expressions P = (NOT A) AND B ----BRACKETS FIRST!---- 1st 2nd A A P B B P

Binary Logic Circuits A B P C A B C P Binary Logic Circuit Expressions Learning Objectives: why data is represented in computer systems in binary form simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT to two levels. applying logical operators in appropriate truth tables to solve problems applying computing-related mathematics: +, -, /, *, Exponentiation (^), MOD, DIV Binary Logic Circuit Expressions P = ((NOT B) AND C) OR A ----BRACKETS inside BRACKETS FIRST!---- 1st 2nd 3rd A A B B P C C P