 Do the following conversions:  Solve the following:  1101.1011+10001.01  1011011-011010  101100/100  10010*110 DecimalOctalHexadecimalBinary 78--

Slides:

Advertisements

Similar presentations

Computer Codes Rohit Khokher. Computer Codes Data types NumericNonnumeric IntegerRealAlphabet A, B, C, …,Z a, b, c,…,z Digits 0,…,9 Special Characters.

Advertisements

Chapter 1 Binary Systems 1-1. Digital Systems

Overview Digital Systems and Computer Systems Number Systems [binary, octal and hexadecimal] Arithmetic Operations Base Conversion Decimal Codes [BCD (binary.

Introduction to Computing Systems (1st Exam). 1. [10] What is the range of decimal integers that can be represented by the following given numbers of.

Digital Circuits. Analog and Digital Signals Noise margins in Logic Circuits VMVM.

ECE 331 – Digital System Design Logic Circuit Design (Lecture #7)

Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Chapter 3 Combinational Logic Design

Digital Logic Design Lecture 19. Announcements Homework 6 due Thursday 11/6 Recitation quiz on Monday, 11/10 – Will cover material from lectures 18,19,20.

Number Systems and Codes Discussion D4.1. Number Systems Counting in Binary Positional Notation Hexadecimal Numbers Negative Numbers.

Number System and Codes

1.6 Signed Binary Numbers.

Top-down modular design

Combinational Logic Design

Combinational Logic. Outline 4.1 Introduction 4.2 Combinational Circuits 4.3 Analysis Procedure 4.4 Design Procedure 4.5 Binary Adder- Subtractor 4.6.

Binary Arithmetic & Data representation

9/15/09 - L27 CountersCopyright Joanne DeGroat, ECE, OSU1 Final Exam Review Exam Time: MONDAY o dark 30 7:30AM this room.

1 Lecture #7 EGR 277 – Digital Logic Reading Assignment: Chapter 4 in Digital Design, 3 rd Edition by Mano Chapter 4 – Combinational Logic Circuits A)

1 Binary Codes Digital systems use 2-state devices that understand only 2 binary values (0 and 1). But we communicate using various symbols and methods.

Chapter 3 Gate-Level Minimization

Chap 2. Combinational Logic Circuits

CO UNIT-I. 2 Multiplexers: A multiplexer selects information from an input line and directs the information to an output line A typical multiplexer has.

CEC 220 Digital Circuit Design Binary Codes

Agenda Character representation Numerical Conversions ASCII EBCDIC

Computing Machinery Chapter 3: Combinational Circuits.

1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.

CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-1 Design Procedure 1Created by: Ms.Amany AlSaleh.

Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.

ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.

Combinational Circuit Design. Digital Circuits Combinational CircuitsSequential Circuits Output is determined by current values of inputs only. Output.

Lecture 2 Number Representation, Overflow and Logic Topics Adders Math Behind Excess-3 Overflow Unsigned, signed-magnitude Two’s Complement Gray Code Boolean.

CEC 220 Digital Circuit Design Binary Codes Mon, Aug 31 CEC 220 Digital Circuit Design Slide 1 of 14.

ECE 301 – Digital Electronics Logic Circuit Design (Lecture #9)

Arithmetic Chapter 4 Subject: Digital System Year: 2009.

Exercise 1.2 (Chapter 1) Prepared by Dr. Lamiaa Elshenawy

School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 0: Introduction Mohd ridzuan mohd nor

Digital Logic Design Lab 1,2 By Nora Alaqeel.

Lecture 1.2 (Chapter 1) Prepared by Dr. Lamiaa Elshenawy

ECE DIGITAL LOGIC LECTURE 11: STANDARD CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 09/24/2015.

Engineer S. A. AHSAN RAJON Lecturer Department of Computer Science, Khulna Public College, Khulna.

COMPUTER HARDWARE Resistors, transistors, Not gates, NAND gates, NOR gates Decoders Reading and Writing to memory.

Exercises 1.2 (Chapter 1) Prepared by Dr. Lamiaa Elshenawy

1 Combinational Logic Design.  A process with 5 steps Specification Formulation Optimization Technology mapping Verification  1 st three steps and last.

Decoder Chapter 12 Subject: Digital System Year: 2009.

Advanced Binary b. describe and use two’s complement and sign and magnitude to represent negative integers; c. perform integer binary arithmetic, that.

Combinational Logic Weiqiang Sun. A brief review Logic gates Logic gates AND, OR, NOT AND, OR, NOT NAND, NOR, XOR, XNOR NAND, NOR, XOR, XNOR Boolean algebra.

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

Presented by A. Maleki Fall Semester, 2010

Chapter 3 - Binary Numbering System

Combinational Circuits

Number systems and codes

Digital Logic & Design Dr. Waseem Ikram Lecture 05

FUNCTION OF COMBINATIONAL LOGIC CIRCUIT

מיתוג ומערכות ספרתיות אתר הקורס:

Complement Theory 1’s and, 2’s complement operation

BCD = Binary Coded Decimal

Computer Hardware Resistors, transistors,

Complement Theory 1’s and, 2’s complement operation

Digital Logic & Design Lecture 05

Figure 2.1 Illustration of a simple binary counting application.

January 19 W’05 Yutao He 4532B Boelter Hall CSM51A/EEM16-Sec.1 W’05

Chapter 1 Number System RGGP, Narwana.

Lecture 9: Radix-64 Tutorial

13 Digital Logic Circuits.

شبکه آموزشی پژوهشی ایران - مادسیج

Table 1.1 Powers of Two.

LOGIC Circuits.

Adder, Subtructer, Encoder, Decoder, Multiplexer, Demultiplexer

Addition & Subtraction Addition & Subtraction

Computer Architecture CST 250

Presentation transcript:

 Do the following conversions:  Solve the following:    /100  10010*110 DecimalOctalHexadecimalBinary FA

 Subtract using 2’s Complement ◦ from  Encode data bits 1001 into 7 bits even parity hamming code.  Represent Decimal no 8620 in:  BCD  Excess 3 code  2421 code  As a binary number

 Write a short note on the following:  ASCII code  EBCDIC code  Simplify the following expression by K-Map:  Y(A,B,C,D)=∑(0,2,4,6,8,10,12,14,15)  AB’C+ABC’+A’BC+ABC+AB’C’+A’B’C’  F(A,B,C,D)= ∑(0,2,3,6,7,12,13,14)+ ∑D(1,4,11,15)

 Explain NAND & NOR as an universal gate.  Distinguish between demultiplexer & decoder.