COMPSCI 210 Semester 1 - 2015 Tutorial 2: Logic Gates.

Slides:

Advertisements

Similar presentations

Advertisements

CT455: Computer Organization Logic gate

Combinational Logic Circuits Chapter 2 Mano and Kime.

CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.

Morgan Kaufmann Publishers

COMPSCI 210 Semester Tutorial 3: Latches & Exercises from Ch3.

Logic Design Fundamentals - 1 Lecture L1.1. Logic Design Fundamentals - 1 Basic Gates Basic Combinational Circuits Basic Sequential Circuits.

Lab 6 – Part C2 Circuit for Problem 3.6 p 20. a b s y z = ~s & a w = s & b = ~s & a  s & b b s a ~s w = (b & s ) z = (a & ~s ) y = ~ (z & w) De Morgan’s.

Basic Logic Gates and De Morgan's Theorem Discussion D5.1 Appendix D.

Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.

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.

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.

Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.

DeMorgan Theorem, Computer Simulation Exercises

1 Logic Gates. 2 Review of Boolean algebra Just like Boolean logic Variables can only be 1 or 0 Instead of true / false Instead of true / false.

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.

LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.

CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.

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 Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.

COE 202: Digital Logic Design Combinational Logic Part 4

Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.

1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.

Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 4 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

Computer Systems 1 Fundamentals of Computing Simplifying Boolean Expressions.

Boolean Algebra and Logic Gates CSE-1108 Ahsanullah University of Science and Technology (AUST)

Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.

COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.

Basic Logic Gates By : Ashima Wadhwa Assistant Professor (giBS)

Chapter 5 Boolean Algebra and Reduction Techniques 1.

1 Logic Gates CS 202, Spring 2008 Epp, sections 1.4 and 1.5.

Chapter 33 Basic Logic Gates. Objectives After completing this chapter, you will be able to: –Identify and explain the function of the basic logic gates.

WORKING PRINCIPLE OF DIGITAL LOGIC

Logic Gates and Boolean Algebra Introduction to Logic II.

CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.

LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.

1 Review of Boolean algebra Just like Boolean logic Variables can only be 1 or 0 Instead of true / false Instead of true / false.

1 Review of Boolean algebra Not is a horizontal bar above the number –0 = 1 –1 = 0 Or is a plus –0+0 = 0 –0+1 = 1 –1+0 = 1 –1+1 = 1 And is multiplication.

SAM GIRLS COLLEGE, BHOPAL DEPARTMENT OF COMPUTER SCIENCE.

Digital Logic Design Ch1-1. Digital Logic Design Ch1-2 Introduction to digital logic (logic gates, flip-flops, circuits) Definition of Digital Logic 

Boolean Constants and Variables Boolean 0 and 1 do not represent actual numbers but instead represent the state, or logic level. Closed switchOpen switch.

Computer Architecture & Operations I

Dr. Ameria Eldosoky Discrete mathematics

Table 2.1 Postulates and Theorems of Boolean Algebra

Eng. Mai Z. Alyazji October, 2016

Transistors and Logic Circuits

Digital gates and difinition

Exclusive OR Gate.

Discussion D5.1 Section Sections 13-3, 13-4

Digital Signals Digital Signals have two basic states:

Basic Digital Logic Basic Gates

Digital Systems: Logic Gates and Boolean Algebra

Universal gates.

Example Question: Consider the expressions: (a) F = XY + XY'

13 Digital Logic Circuits.

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

Table 2.1 Postulates and Theorems of Boolean Algebra

University of Maryland Baltimore County Department of Computer Science and Electrical Engineering CMPE 212 Laboratory (Discussion 4) Hasib Hasan

Discussion D5.1 Section Sections 13-3, 13-4

Discussion D5.1 Section Sections 13-3, 13-4

Basic Logic Gates.

Logic Circuits I Lecture 3.

Basic Logic Gates.

Department of Electronics

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Eng. Ahmed M Bader El-Din October, 2018

Boolean Algebra.

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

Presentation transcript:

COMPSCI 210 Semester Tutorial 2: Logic Gates

Review of Boolean algebra Example 1. Write the truth table for : B+(BA)=F(AB) ABABF(AB)

Exercise 1: write a “truth table” for: a) (x+y+z)(xyz) b) (XYZ) + (XY) (Z+Y) c) PT(P+Z) _ _ _ _ _ _ _ _ _ 3

Basic logic gates Not And Or Nand Nor Xor 4

NAND Gate NAND Z X Y Z X Y Z = X.Y nand(Z,X,Y) W = X.Y Z = W = X.Y NOT-AND X Y Z W ____ _ 5

NOR Gate NOR X Y Z Z = (X + Y) nor(Z,X,Y) X Y Z NOT-OR X Y W = X + Y Z = W = (X + Y) Z W _______ _ 6

Rosen, §10.3 question 1 Find the output of the following circuit Answer: (x+y)y x+yx+y y (x+y)y(x+y)y__ 7

Rosen, §10.3 question 2 Find the output of the following circuit Answer: xy x y xyxy _ _ ___ ___ 8

Rosen, §10.3 question 6 Write the circuits for the following Boolean algebraic expressions a) x+y __ __ x x+yx+y 9

Rosen, §10.3 question 6 Write the circuits for the following Boolean algebraic expressions b)(x+y)x _______ x+yx+y x+yx+y (x+y)x(x+y)x 10

Example Draw the circuit diagram to implement the expression 11

Create truth table for the following circuit: ABX

Exercise 2: Create truth table for the following circuit: 13

14 Exercise 3: Draw the truth table for this decoder:

ABQ0Q1Q2Q Exercise 3 - Solution 15

De Morgan’s Theorem NOT all variables Change. to + and + to. NOT the result (X + Y) = __________ (X. Y) = ______ __ _______ __ (X + Y) = X + Y X + Y = __ 16 __ X. Y

Memory A flip-flop holds a single bit of memory – The bit “flip-flops” between the two NAND gates In reality, flip-flops are a bit more complicated – Have 5 (or so) logic gates (transistors) per flip-flop Consider a 1 Gb memory chip – 1 Gb = 8,589,934,592 bits of memory – That’s about 43 million transistors! In reality, those transistors are split into 9 ICs of about 5 million transistors each 17