NAND. Grade (10) Instructor. Logic Design 1 / 13

Similar documents
Experiment 9: Binary Arithmetic Circuits. In-Lab Procedure and Report (30 points)

LAB #1 BASIC DIGITAL CIRCUIT

CSE303 Logic Design II Laboratory 01

ECE 270 Lab Verification / Evaluation Form. Experiment 1

Experiment 3: Logic Simplification

GEORGIA INSTITUTE OF TECHNOLOGY School of Electrical and Computer Engineering ECE 2020 Fall 2017 Lab #1: Digital Logic Module

Logic Gates and Boolean Algebra ENT263

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 09 MULTIPLEXERS

Lecture (04) Boolean Algebra and Logic Gates

Lecture (04) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee

A B A+B

Lecture (05) Boolean Algebra and Logic Gates

EEE130 Digital Electronics I Lecture #4_1

Lecture (09) Programmable Logic Devices programming using CUPL By: Dr. Ahmed ElShafee

1. Mark the correct statement(s)

Programmable Logic Design Techniques I

A3 A2 A1 A0 Sum4 Sum3 Sum2 Sum1 Sum

Gate-Level Minimization

Electronic Engineering Part 1 Laboratory Experiment. Digital Circuit Design 1 Combinational Logic. (3 hours)

that system. weighted value associated with it. numbers. a number. the absence of a signal. MECH 1500 Quiz 2 Review Name: Class: Date:

Chapter 3. Gate-Level Minimization. Outlines

CENG 241 Digital Design 1

ELCT201: DIGITAL LOGIC DESIGN

Lec-6-HW-1-devices Reading: PP, Chapter 3:

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

ELCT201: DIGITAL LOGIC DESIGN

DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES

Scheme I. Sample Question Paper

Combinational Devices and Boolean Algebra

Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation

Experiment 4 Boolean Functions Implementation

Combinational Digital Design. Laboratory Manual. Experiment #3. Boolean Algebra Continued

Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic

LAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling

Hours / 100 Marks Seat No.

Combinational Circuits Digital Logic (Materials taken primarily from:

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions

Ch. 5 : Boolean Algebra &

CARLETON UNIVERSITY. Laboratory 2.0

Experiment 0 OR3 Gate ECE 332 Section 000 Dr. Ron Hayne June 8, 2003

Boolean Algebra. BME208 Logic Circuits Yalçın İŞLER

QUESTION BANK FOR TEST

Basic Arithmetic (adding and subtracting)

Lab Manual for COE 203: Digital Design Lab

Combinational Logic Circuits

4. Write a sum-of-products representation of the following circuit. Y = (A + B + C) (A + B + C)

Propositional Calculus. Math Foundations of Computer Science

2008 The McGraw-Hill Companies, Inc. All rights reserved.

Pre-Laboratory #Boolean Expressions ECE 332

Experiment 7 Arithmetic Circuits Design and Implementation

EE292: Fundamentals of ECE

EXPERIMENT #8: BINARY ARITHMETIC OPERATIONS

Presentation 4: Programmable Combinational Devices

ENEE245 Digital Circuits and Systems Lab Manual

Review. EECS Components and Design Techniques for Digital Systems. Lec 05 Boolean Logic 9/4-04. Seq. Circuit Behavior. Outline.

ENEE245 Digital Circuits and Systems Lab Manual

Touch Control Switch + - R6 R4 R8 R7 CAT# Grading. Assembly Instructions by Earl D. Gates SUNY Oswego Fall Conference 2007.

GC03 Boolean Algebra

CURIE Academy, Summer 2014 Lab 1: Computer Engineering Hardware Perspective Sign-Off Sheet

PART 1. Simplification Using Boolean Algebra

A3 A2 A1 A0 Sum4 Sum3 Sum2 Sum1 Sum

Gate-Level Minimization

EE 1315: DIGITAL LOGIC LAB EE Dept, UMD

Principles of Digital Techniques PDT (17320) Assignment No State advantages of digital system over analog system.

Lecture (03) Binary Codes Registers and Logic Gates

Hours / 100 Marks Seat No.

Gate Level Minimization

Lecture 21: Combinational Circuits. Integrated Circuits. Integrated Circuits, cont. Integrated Circuits Combinational Circuits

MODULE 5 - COMBINATIONAL LOGIC

Standard Logic Chips and National Instruments ELVIS Breadboarding for Combinational Logic Circuits

(ii) Simplify and implement the following SOP function using NOR gates:

COMP combinational logic 1 Jan. 18, 2016

Last Name Student Number. Last Name Student Number

Synthesis of combinational logic

CHAPTER NINE - MSI Logic Circuits

Finite State Machine Lab

Overview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder

Combinational Circuits

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

Philadelphia University Student Name: Student Number:

Chapter 2 Programmable Logic Controller (PLC) and Relay Ladder Logic (RLL).

Gate Level Minimization Map Method

ARM 64-bit Register File

Chapter 2. Boolean Expressions:

Following the advice of breaking the longest (uppermost) bar first, I'll begin by breaking the bar covering the entire expression as a first step:

Objectives: 1- Bolean Algebra. Eng. Ayman Metwali

COS 116 The Computational Universe Laboratory 8: Digital Logic II

1. Fill in the entries in the truth table below to specify the logic function described by the expression, AB AC A B C Z

Digital Fundamentals. Integrated Circuit Technologies

UNIT 6 CIRCUIT DESIGN

Bilkent University. CS 319 Object-Oriented Software Engineering. Fall Logic Design and Breadboard Simulator. Final Report 21 November 2009

2.1 Binary Logic and Gates

60-265: Winter ANSWERS Exercise 4 Combinational Circuit Design

Chapter 2: Combinational Systems

Content beyond Syllabus. Parity checker and generator

EGCP 1010 Digital Logic Design (DLD) Laboratory #6

Chapter 2 Logic Gates and Introduction to Computer Architecture

CSC 101: Lab #5 Boolean Logic Practice Due Date: 5:00pm, day after lab session

CS470: Computer Architecture. AMD Quad Core

Drexel University Electrical and Computer Engineering Department ECE 200 Intelligent Systems Spring Lab 1. Pencilbox Logic Designer

Transcription:

Logic Design I Laboratory 02 NAND NOR XOR # Student ID 1 Student Name Grade (10) Instructor signature 2 3 Delivery Date 1 / 13

Objective To find the basic NAND & NOR & XOR gates concept and study on multiple inputs and propagation delay. Theory Overview The basic logic gates are the building blocks of more complex logic circuits. These logic gates perform the basic Boolean functions, such as NAND, NOR, XOR gates, Fig. below shows the circuit symbol, Boolean function, and truth table. 2 / 13

4.1 NAND gate The NAND gate is the same gate as a AND gate and a NOT gate is connected in series, so that the property of a NAND gate is equivalent to that of a AND gate and a NOT gate. 1) Insert a 2 input NAND gate [TTL 7400] 2) Construct the circuit shown in Fig into the logic lab breadboard. 3) Set data switches as shown in following table 4.1. Complete the NAND gate truth table. NAND Gate as Inverter 4) Wire as shown in Fig 5) Complete the NAND gate truth table 4..2 Multiple Input NAND Gate: 6) Construct the 3 input NAND gate using 2 input NAND gates. 3 / 13

Symbolically equivalent circuit is: 7) Set data switches as shown below. Verify the output states in table 4.3 Results and data analysis Input1 (SW1) Table 4.1 Input2 (SW2) Output (L1) Input1 (SW3) Table 4.2 Output (L2) Input SW1 A SW2 B SW3 C Table 4.3 Output L1 (AB)' L2 (AB)'' L3 (ABC)' 4 / 13

4.2 NOR gate To find a NOR gate characteristics. The NOR gate IS the equivalent of an inverted OR function. 2 input NOR Gate I) Insert a 2 input NOR gate [TTL 7402 #3 T] into the logic lab breadboard. 2) Construct the circuit as shown 3) With data switches as shown in Table 4.4, check the output states. NOR Gate as Inverter 4) The NOR gate can be used as an inverter by connecting all the inputs in one, Wire as shown. 5) Complete the truth table 4.5 Multiple Input NOR gate 6) Construct the 3 input NOR gate using 2 input NOR gates 5 / 13

This circuit can be represented symbolically as 7) Set data switches as shown in Table 4.6. Record the output states 6 / 13

Results and data analysis Input1 (SW1) Table 4.44 Input2 (SW2) Output (L1) Input1 (SW3) Table 4.5 Output (L2) SW1 A Input SW2 B SW3 C Table 4.6 L1 (A+B)' Output L2 (A+ B)'' L3 (A+B+C)' 7 / 13

4.3 XOR gate The XOR gate function is to yield a high output state when two inputs are in the opposite state. 2 input XOR Gate 1) Insert a 2 input XOR gate [TTL 7486] into the logic lab breadboard. 2) Wire as shown in Fig. 3) Complete the following truth table. 4.7 Implementing the XOR Function using NAND gates 1) Insert a Quad 2 input NAND gate [7400] into the logic lab breadboard. 2) Construct the circuit as shown in Fig. 3) Complete the following truth table 4.8.. 4) write thel1, L2, L3 Expressions inside the table 8 / 13

Implementing the XOR Function using NOR gates 1) Construct the circuit as shown in Fig. 2) Complete the following truth table 4.9.. 3) write thel1, L2, L3 Expressions inside the table Implementing the XOR Function using AND, OR, NOT gates 1) Construct the circuit as shown in Fig. 2) Complete the following truth table 4.10. 3) write thel1, L2, L3 Expressions inside the table 9 / 13

Results and data analysis Input1 (SW1) Table 4.7 Input2 (SW2) Output (L1) Input SW1 SW2 A B L1. Table 4.8 Output L2 L3.. L4. 10 / 13

Input SW1 A SW2 B L1. Table 4.9 Outpu L2 L3.. L4. Input SW1 A SW2 B L1. Table 4.10 Outpu L2 L3.. L4. 11 / 13

tions an Dr. Ahm nd Conc med ElShafee lusions e, ACU : Sprin 12 / 13 ng 2017, Logi ic Design I

2. Dr. Ahm med ElShafee e, ACU : Sprin 13 / 13 ng 2017, Logi ic Design I