Students should be able to (a) produce a truth table from a given logic diagram

Similar documents
Why digital? Overview. Number Systems. Binary to Decimal conversion

12/31/2010. Digital Operations and Computations Course Notes. 01-Number Systems Text: Unit 1. Overview. What is a Digital System?

1.10 (a) Function of AND, OR, NOT, NAND & NOR Logic gates and their input/output.

Digital Electronics Part 1: Binary Logic

CSE 20 DISCRETE MATH. Fall

CS1800: Hex & Logic. Professor Kevin Gold

Introduction to digital systems. Juan P Bello

Number Theory: Representations of Integers

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Section 001. Read this before starting! You may use one sheet of scrap paper that you will turn in with your test.

LOGIC GATES A Y=A+B. Logic symbol of OR gate B The Boolean expression of OR gate is Y = A + B, read as Y equals A 'OR' B.

Binary addition example worked out

Philadelphia University Student Name: Student Number:

THE LOGIC OF COMPOUND STATEMENTS

Fundamentals of Digital Design

Wheels Radius / Distance Traveled

Having read this workbook you should be able to: design a logic circuit from its Boolean equation or truth table.

Exercise booklet - Logic

Experiment 7: Magnitude comparators

S C F F F T T F T T S C B F F F F F T F T F F T T T F F T F T T T F T T T

CSEN102 Introduction to Computer Science

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

ENGIN 112 Intro to Electrical and Computer Engineering

COMP2611: Computer Organization. Introduction to Digital Logic

Hakim Weatherspoon CS 3410 Computer Science Cornell University

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Logic Gates and Boolean Algebra

Combinational Logic. Jee-Hwan Ryu. School of Mechanical Engineering Korea University of Technology and Education

1 Computing System 2. 2 Data Representation Number Systems 22

Outline. policies for the first part. with some potential answers... MCS 260 Lecture 10.0 Introduction to Computer Science Jan Verschelde, 9 July 2014

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

Boole Algebra and Logic Series

XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.

Unit 3 Session - 9 Data-Processing Circuits

convert a two s complement number back into a recognizable magnitude.

Possible logic functions of two variables

Combinational Logic. By : Ali Mustafa

Simple Interactions CS 105 Lecture 2 Jan 26. Matthew Stone

for Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid

ENGIN 112 Intro to Electrical and Computer Engineering

Section 001. Read this before starting!

The concept of the amount of information

If bears are brown then rabbits are not red. If giraffes are not green then rabbits are red. Giraffes are green. Therefore bears are brown.

CprE 281: Digital Logic

10/14/2009. Reading: Hambley Chapters

Lecture 4 Modeling, Analysis and Simulation in Logic Design. Dr. Yinong Chen

CMSC 313 Lecture 16 Announcement: no office hours today. Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo

Numbers and Arithmetic

Lecture 17: Designing Sequential Systems Using Flip Flops

Numbering Systems. Contents: Binary & Decimal. Converting From: B D, D B. Arithmetic operation on Binary.

SAMPLE EXAMINATION PAPER

of Digital Electronics

CHAPTER 7. Exercises 17/ / /2 2 0

Learning Objectives:

Counting in Different Number Systems

Name Period Date. RNS1.3 Scientific Notation Read and write large and small numbers. Use scientific notation to write numbers and solve problems.

Appendix: a brief history of numbers

Logic. Basic Logic Functions. Switches in series (AND) Truth Tables. Switches in Parallel (OR) Alternative view for OR

ENG2410 Digital Design Introduction to Digital Systems. Fall 2017 S. Areibi School of Engineering University of Guelph

Informatics 1 - Computation & Logic: Tutorial 3

Week No. 06: Numbering Systems

2-1. Inductive Reasoning and Conjecture. Lesson 2-1. What You ll Learn. Active Vocabulary

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Module 2. Basic Digital Building Blocks. Binary Arithmetic & Arithmetic Circuits Comparators, Decoders, Encoders, Multiplexors Flip-Flops

Section 1A. Introduction & Basic Principles. Engineering Areas

MODULE- 07 : FLUIDICS AND FLUID LOGIC

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

Learning Objectives. Boolean Algebra. In this chapter you will learn about:

Mat Week 8. Week 8. gcd() Mat Bases. Integers & Computers. Linear Combos. Week 8. Induction Proofs. Fall 2013

Number System conversions

Inquiry Based Instruction Unit. Virginia Kromhout

Numbers and Arithmetic

Student Responsibilities Week 8. Mat Section 3.6 Integers and Algorithms. Algorithm to Find gcd()

Digital Circuits, Binary Numbering, and Logic Gates Cornerstone Electronics Technology and Robotics II

PAST EXAM PAPER & MEMO N3 ABOUT THE QUESTION PAPERS:

DIGITAL LOGIC CIRCUITS

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

14:332:231 DIGITAL LOGIC DESIGN. Why Binary Number System?

Chapter 2 Boolean Algebra and Logic Gates

Chapter 1 :: From Zero to One

CPE100: Digital Logic Design I

Gates and Logic: From switches to Transistors, Logic Gates and Logic Circuits

Chapter 1 CSCI

New Students Day Activity

Digital Logic Design ENEE x. Lecture 14

Math 1312 Lesson 1: Sets, Statements, and Reasoning. A set is any collection of objects. These objects are called the elements of the set.

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

Lecture 1. Notes. Notes. Notes. Introduction. Introduction digital logic February Bern University of Applied Sciences

UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017

Signals and Systems Digital Logic System

CS1800 Discrete Structures Fall 2017 October, CS1800 Discrete Structures Midterm Version A

UNIT III Design of Combinational Logic Circuits. Department of Computer Science SRM UNIVERSITY

CMSC 313 Lecture 15 Good-bye Assembly Language Programming Overview of second half on Digital Logic DigSim Demo

CprE 281: Digital Logic

Digital Logic (2) Boolean Algebra

Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

Math 230 Assembly Language Programming (Computer Organization) Numeric Data Lecture 2

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

CprE 281: Digital Logic

Transcription:

Truth tables Teacher s Notes Lesson Plan Length 60 mins Specification Link 2.1.2/f inary logic Learning objective Students should be able to (a) produce a truth table from a given logic diagram Time (min) ctivity Further Notes 10 Using a projector show the Starter ctivity. sk the students to predict what should be selected for each of the logical arguments and then display the results. The reset button will then display all of the elements. N press the reset button between buttons, otherwise only the results currently displayed will appear. 5 Watch the set of videos. Inform the students that they have been investigating oolean logic, first proposed by George oole in the 1800s. In oolean algebra, all values can be reduced to true or false and is therefore important in the operation of computers as it coincides with the binary numbering system. Show students the link to the specification. Explain the purpose and objectives of the lesson. 5 sk some questions about the videos to assess learning. For example: What is a truth table? What are the shapes of the symbols used to represent ND, OR and NOT? 20 Worksheet 1 Students to complete Worksheet 1 either on paper or on a computer. sk individual students for their answers and discuss with the class so that all students will have the correct answers entered on their worksheets. table that displays all the possible results of a logic function. nswers provided.

Time (min) ctivity Further Notes 15 The students should now use the Kent State University logic gate simulator. (http://www.cambridgegcsecomputing.org/weblink9) Instructions for using this resource may be found in the help section at the top of the webpage. The students can simulate the operation of logic gates and switches. They should demonstrate all of the examples in Worksheet 1 and compound operations e.g. ND with NOT Extension Challenge/Homework The students should complete and submit Worksheet 2. 5 Plenary Display the following example: C 0 0 0 0 1 0 0 0 1 1 0 1 0 1 0 0 0 1 1 1 0 0 1 1 1 0 1 1 0 1 1 1 1 1 1 1 sk the students to produce a truth table for this function.

WORKSHEET 1 NSWERS 1 (a) Explain what is meant by the following terms: (i) inary digit Either of the digits 0 or 1 used in the binary number system. It is shortened to the term bit. (ii) yte unit that usually consist of 8 bits. byte is the number of bits needed to encode a single character of text and is the smallest addressable unit of memory. (b) Explain what is meant by a nibble and why it is used in computing. nibble consists of 4 bits or half a byte. s there are possible values, so a nibble corresponds to a single hexadecimal digit. Therefore an eight digit byte can be represented by two digits of hexadecimal. 2 Split the following bytes into nibbles and then convert them to hex. Write your answers in the spaces provided. (a) 1 1 0 1 0 0 1 1 Nibbles 1 1 0 1 0 0 1 1 Hex (b) 0 1 1 0 0 1 1 0 Nibbles Hex (c) 1 1 1 1 0 0 1 1 Nibbles Hex D 0 1 1 0 5 1 1 1 1 F 0 1 1 0 0 0 1 1 In the spaces below place the following into ascending order according to size. Megabyte it Nibble Terabyte yte Gigabyte Kilobyte it Nibble yte Kilobyte Megabyte Gigabyte Terabyte

WORKSHEET 2 NSWERS 1 Complete the following sentence: Logic gates are switches which perform a logical function on one or more logical inputs and produce a single logical output. 2 In the spaces below draw the symbols used to represent the following logic gates. ND OR NOT Complete the following sentence: truth table is a breakdown of a logic function by listing all possible values the function can attain. 4 Complete the truth tables for the following gates. (a) Symbol Truth table 0 0 0 0 1 1 1 0 1 1 1 1

WORKSHEET 1 NSWERS 4 Complete the truth tables for the following gates. (b) Symbol Truth table 0 0 0 0 1 0 1 0 0 1 1 1 (c) Symbol Truth table 0 1 1 0 5 (a) Complete the truth table for the following combination. C C D 0 0 0 1 1 0 0 1 0 1 0 1 1 1 1 0 (a) Give the logic statement for this combination. = NOT ( ND )

WORKSHEET 1 NSWERS 6 Give the logic gate drawing and the truth table for the following logic statement. = NOT ( OR ) C C D 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 0

WORKSHEET 2 NSWERS 1 P 0 0 0 0 1 1 1 0 0 1 1 0 2 1,1 1 1

2024 © sciencedocbox.com Privacy Policy | Terms of Service | Feedback