DATA REPRESENTATION IN COMPUTER MEMORY.  Describe the coding system:  Sign and magnitude  1’s Complement and 2’s Complement  Binary Coded Decimal.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Chapter 3 Logic Gates and Boolean Algebra – Part 1
Chapter 3 Basic Logic Gates 1.
Chapter 4 Gates and Circuits.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
CSCI 1412 Logic Gates Parminder Kang Home: Phones OFF Please.
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.
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 Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.
3. DIGITAL ELECTRONICS..
UNIT-8 LOGIC GATES.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
MR. KERINS Logic Gates- Electrical Engineering. LOGIC GATES Logic gates are primarily implemented using diodes or transistors acting as electronic switches,
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
©zaher elsir Sudan Academy for Banking & Financial Sciences Decimal Number System Base (Radix)10 Digits0, 1, 2, 3, 4, 5, 6, 7, 8, 9 e.g The magnitude.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
NOCTI Review Lesson 4 Objectives:
TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.
Digital Electronics. Introduction to Number Systems & Codes Digital & Analog systems, Numerical representation, Digital number systems, Binary to Decimal.
LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.
Digital Logic Design Week 3
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.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
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.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
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.
Logic Gates Chapter 5 Subject: Digital System Year: 2009.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Digital logic representation In digital logic system,events are described as either 0 or 1 Two logic states 1= logic High 0 = logic Low.
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.
1 Ch.3 Logic Gates and Boolean Algebra – Part 1
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
LOGIC GATES. INTRODUCTION TO LOGIC GATES Boolean functions may be practically implemented by using electronic gates. The following points are important.
11/20/2016SKD1 Logic gates. 11/20/2016SKD2 Logic gates Prepared By: Rashidul Islam Instructor (Civil Construction) Deptt. Of S S C Vocational Alamdanga.
Week 1: Introduction and Logic gates IT3002 – Computer Architecture
Logic gates.
Boolean Algebra & Logic Gates
Basics of Logic gates - Part 1
Digital Logic.
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Chapter 3 Notes – Part II Review Questions
Logic Gates.
EKT 124 / 3 DIGITAL ELEKTRONIC 1
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Logic Gates.
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
TN 221: DIGITAL ELECTRONICS 1
Practice #Digital Logic Mr. Burleson
Chapter 4 Gates and Circuits.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Digital Logic & Design Lecture 05
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Logic Gates.
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.
Boolean Algebra.
Logic Gates.
GCSE Computer Science – Logic Gates & Boolean Expressions
Logic Gates.
Combinational Circuits
Table 1.1 Powers of Two.
Department of Electronics
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

DATA REPRESENTATION IN COMPUTER MEMORY

 Describe the coding system:  Sign and magnitude  1’s Complement and 2’s Complement  Binary Coded Decimal (BCD system)  ASCII and EBCDIC Previous Lesson

By the end of topic, the students should know:  Perform operations with Boolean Algebra  Define logic gates.  Explain the operation of logic gates  Draw the logic symbols for the following logic gates : NOT, AND, OR, NOR, NAND, Exclusive –OR and Exclusive –NOR  Construct truth table of logic gates. LESSON LEARNING OUTCOME

 Digital (logic) circuits operate in the binary mode where each input and output voltage is either 0 or 1.  This characteristic of logic circuits allow us to use Boolean Algebra as a tool for the analysis and design of digital systems.  The input are considered logic variables whose logic levels at any time determine the output levels.  In our work to follow, we shall use letter symbols to represent logic variables. For example, the letter A might represent a certain digital circuit input or output, and any time we must have either A= 0 or A=1; if not one, then the other. Logic Gates

 In Boolean Algebra, there are only 3 basic operations : OR, AND, NOT (logic operations)  Digital circuits called logic gates can be constructed from diodes, transistors, and resistors connected in such a way that the circuit output is the result of a basic logic operation Logic Gates

 Can be performed on a single input variable  Example : if the variable A is subjected to the NOT operation, the result x can be expressed as Gates NOT X = A Presence of small circle always denotes inversion AY Truth Table

 The AND gate output is equal to the AND product of the logic input, that is x=AB.  In other words, the AND gate is a circuit operates in such way that its output is HIGH only when all its input are HIGH. Gates AND

ABY Truth Table

Summary of the AND operation  The AND operation is performed the same as ordinary multiplication of 1 and 0  An AND gate is logic circuit that performs the AND operation on the circuit’s inputs  An AND gate output will be 1 only for the case when all inputs are 1, for all other cases the output will be 0  The expression x=AB is read as ‘x equals A AND B’ Gates AND

 Circuit that has two or more inputs and whose output is equal to the OR combination of the inputs.  The OR gate operates in such a way that its output is HIGH (logic 1) if either input A and B or both are at logic 1 level. Gates OR

ABY Truth Table

Gates OR Summary of the OR operation  The OR operation produces a result (ouput) of 1 whenever any input is a 1.Otherwise the output is 0.  An OR gate is logic circuit that performs an OR operation on the circuit’s inputs  The expression x = A+B is read as ‘x equals A or B’

ORANDNOT 0+0 = 00.0 = 00 = = 10.1 = 01 = = 11.0 = = 11.1 = 1 Summary of Boolean Operations

 Gates NOR  Gates NAND  Gates Exclusive –OR  Gates Exclusive –NOR

 NOR gate is a combination of the OR gate and NOT gate.  It works as an inverted OR gate. It is the same as OR gate symbol except it has a small circle on the output.  This small circle represents inversion operations. This gate will give an inverted output of the OR gate. Gates NOR

InputOutput ABY

 NAND gate is a combination of AND gates and NOT gates.  Its function is to invert the output of AND gate. It is the same as AND gate symbol except for the small circle on the output.  Once again the circle marks the inverse operation.  Thus, the NAND gate operates as an AND gate followed by an inverter. Gates NAND

INPUTOUTPUT ABY

 Two special logic circuit that normally found in digital systems are circuit-Or and Exclusive Exclusive-Nor.  Get Exclusive-Or is a combination of the three basic gates gates NOT, AND and OR.  Get Exclusive-or also known as EX-OR. Gates EXCLUSIVE-OR

INPUTOUTPUT ABY

 Exclusive-Nor gate operations (summarized: EX-NOR) is operating contrary to the Exclusive-Or.  Symbol for EX-NOR obtained simply by adding a small circle at the output of the EX-OR symbols. Gates EXCLUSIVE-NOR

INPUTOUTPUT ABY

 THANK YOU  TO BE CONTINUED….