CSCI 1412 Logic Gates Parminder Kang Home: Phones OFF Please.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

ADDER, HALF ADDER & FULL ADDER
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Number Systems & Logic Gates Day 2. Octal Number System Base (Radix)8 Digits0, 1, 2, 3, 4, 5, 6, 7 e.g = =648 1 =88 0 =1 The digit.
Binary Numbers.
Chapter 4 Gates and Circuits. Integrated Circuits aka CHIPS What’s in this thing???? 4–2.
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.
NOCTI Review Lesson 4 Objectives:
CPS120: Introduction to Computer Science
Computer Organization 1 Logic Gates and Adders. Propositions –Venn Diagrams.
LOGIC GATES.
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.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.
LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.
Basic logic gates  AND gate:The truth table is given by A.BBA
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
Universal college of engineering & technology. .By Harsh Patel)
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=
CHAPTER 5 Combinational Logic Analysis
Figure S1.1 The Motorola MPC 7400 PowerPC CPU. Figure S1.3 Truth table for INCLUSIVE-OR operation.
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
Logic Gates Chapter 5 Subject: Digital System Year: 2009.
1’S COMPLEMENT REPRESENTATION 1’s complement of a number (binary) is obtained by changing all 1’s to 0 and all 0’s to 1. If one of these numbers is positive.
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. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
DATA REPRESENTATION IN COMPUTER MEMORY.  Describe the coding system:  Sign and magnitude  1’s Complement and 2’s Complement  Binary Coded Decimal.
11/20/2016SKD1 Logic gates. 11/20/2016SKD2 Logic gates Prepared By: Rashidul Islam Instructor (Civil Construction) Deptt. Of S S C Vocational Alamdanga.
Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.
Dr.Ahmed Bayoumi Dr.Shady Elmashad
ECE 3130 Digital Electronics and Design
ECE 3130 Digital Electronics and Design
Logic Gates and Boolean Algebra
Logic Gates.
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.
Logic Gates.
Boolean Algebra.
Week 7: Gates and Circuits: PART II
Logic Gates.
Digital Logic.
Number Systems and Circuits for Addition
Logic Gates.
KS4 Electricity – Electronic systems
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Logic Gates.
Binary Logic.
XOR Function Logic Symbol  Description  Truth Table 
Department of Electronics
Logic Gates AIM: To know the different types of logic gate
SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.
Presentation transcript:

CSCI 1412 Logic Gates Parminder Kang Home: Phones OFF Please

1.Basic Gates 1.1 AND gate: The AND operation is performed by the AND gate. Definition: For two integers A & B; if A AND B are equal to 1 then the result is 1. Otherwise the result is 0. The AND operation is represented by '.' (dot), although the dot is often omitted in logical expressions. We write: T=A.B (or T=AB), and say, 'T equals A and B'

The operation of the AND gate is described by the truth table: A B T

1.2 OR Gate: The OR operation is performed by the OR gate: Definition: For two integers A & B; if A OR B, OR both are equal to 1 then the result is 1. Otherwise the result is 0. The OR operation is represented by '+' We write: T=A+B, and say, 'T equals A or B'

The operation of the OR gate is described by the truth table: A B T

1.3 NOT Gate: The NOT operation is performed by the INVERTER (or NOT gate). The output of the inverter is the logical inverse of the input. We write: T=/A, and say, 'T equals not A'. The operation of the inverter is described by the truth table: A T

Inverters are often appended to AND and OR gates to produce NAND and NOR gates. ABAB T NAND Gate ABAB T NOR Gate

1.4 EXCLUSIVE-OR The EXCLUSIVE-OR operation is performed by the EXCLUSIVE-OR gate: Definition: For two integers A & B; if A OR B are different then the result is 1. Otherwise the result is 0. T=A B; 'T equals A exclusive or B' A B T

ABAB T The EX-OR is a luxury as we don't really need it and we can make it anyway from the other gates. EX-OR is very common so someone decided that we need special symbols for it.

2 Adder: an adder is a digital circuit that performs addition of numbers. In modern computers adders reside in the ALU where other operations are performed. 2.1 Half Adder: A half adder has two inputs, generally labelled A and B, and two outputs, the sum S and carry C.

2.1 Full Adder: A full adder is a logical circuit that performs an addition operation on three binary digits. The full adder produces a sum and carry value, which are both binary digits. InputOutput ABCinCoutS