GCSE Computing Theory © gcsecomputing.net 1 GCSE Computing 2.14 Data Representation Binary Arithmetic.

Slides:

Advertisements

Similar presentations

Abdullah Said Alkalbani University of Buraimi

Advertisements

Register Transfer and Microoperations Part2

Slide 1 Insert your own content. Slide 2 Insert your own content.

Principles & Applications

Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13

Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13

DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.

ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.

SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION

MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.

Binary Numbers.

A Simple ALU Binary Logic.

B261 Systems Architecture

GCSE Computing Theory © gcsecomputing.net 1 GCSE Computing Data Representation Why Binary?

ILLUSTRATING INTEGERS

Monika Gope Lecturer IICT, KUET

ABC Technology Project

Discrete Mathematical Structures: Theory and Applications

Morgan Kaufmann Publishers Arithmetic for Computers

O X Click on Number next to person for a question.

5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:

Lecture no 6. Two's Complement Given a negative number (N), represented using the Two's Complement representation (N*), the magnitude of the number (P)

ADDER, HALF ADDER & FULL ADDER

Number Systems Digital Logic By: Safwan Mawlood

Nat 4/5 Computing Science Lesson 1: Binary

Binary Lesson 3 Hexadecimal. Counting to 15 Base Base Base 16 Base Base Base 16 Two Ten (Hex) Two Ten (Hex)

Binary Lesson 3 Hexadecimal. Counting to 15 Base Base Base 16 Base Base Base 16 Two Ten (Hex) Two Ten (Hex)

25 seconds left…...

Digital Logic & Design Lecture No. 3. Number System Conversion Conversion between binary and octal can be carried out by inspection.  Each octal digit.

11 = This is the fact family. You say: 8+3=11 and 3+8=11

ENEE244-02xx Digital Logic Design Lecture 10. Announcements HW4 due 10/9 – Please omit last problem 4.6(a),(c) Quiz during recitation on Monday (10/13)

Datorteknik IntegerAddSub bild 1 Integer arithmetic Depends what you mean by "integer" Assume at 3-bit string. –Then we define zero = 000 one = 001 Use.

O X Click on Number next to person for a question.

and M-ary Quadrature Amplitude Modulation (M-QAM)

Candidates should be able to:

Chapter 4.2 Binary numbers: Arithmetic

Number System and Codes

© GCSE Computing Candidates should be able to:  convert positive denary whole numbers (0-255) into 8-bit binary numbers and vice versa  add two 8-bit.

Computer Organization & Programming Chapter2 Number Representation and Logic Operations.

BINARY ARITHMETIC Binary arithmetic is essential in all digital computers and in many other types of digital systems.

Chapter 4: Representation of data in computer systems: Number OCR Computing for GCSE © Hodder Education 2011.

Positional Number Systems

07/12/ Data Representation Two’s Complement & Binary Arithmetic.

GCSE Computing: A451 Computer Systems & Programming Numbers Representation of Data in Computer Systems.

Candidates should be able to:

A)Convert positive denary whole numbers (0-255) into 8-bit binary numbers and vice versa b)Add two 8-bit binary integers and explain overflow errors which.

Digital Representations ME 4611 Binary Representation Only two states (0 and 1) Easy to implement electronically %0= (0) 10 %1= (1) 10 %10= (2) 10 %11=

1 4. Computer Maths and Logic 4.1 Number Systems.

GCSE Computing#BristolMet Session Objectives#8 MUST add two 8-bit binary integers SHOULD explain overflow errors COULD provide solutions to limit overflow.

IT1004: Data Representation and Organization Negative number representation.

09/03/20161 Information Representation Two’s Complement & Binary Arithmetic.

1 Integer Representations V1.0 (22/10/2005). 2 Integer Representations  Unsigned integer  Signed integer  Sign and magnitude  Complements  One’s.

Chapter 4 Operations on Bits.

Exercise: Add these two single precision IEEE 754 numbers: … …0 Left number: 1.101x24 Right number: 1.011x 22= x24.

Addition and Substraction

Teaching Computing to GCSE

Lesson Objectives To understand how to add 4 and 8 bit binary numbers together To understand what is meant by the term “Overflow” ALL students will add.

Teaching Computing to GCSE

1.6) Storing Integer:.

Unit 18: Computational Thinking

Topic 1: Data Representation

CPS120: Introduction to Computer Science

Binary Name: Class: .

Data Binary Arithmetic.

GCSE COMPUTER SCIENCE Topic 3 - Data 3.2 Signed Integers.

Chapter 1 (Part c) Digital Systems and Binary Numbers

Theory: 2.6 – Data Representation

Two’s Complement & Binary Arithmetic

Presentation transcript:

GCSE Computing Theory © gcsecomputing.net 1 GCSE Computing 2.14 Data Representation Binary Arithmetic

Learning Objectives: 2 add two 8-bit binary integers explain overflow errors which may occur GCSE Computing GCSE Computing Theory © gcsecomputing.net

Decimal Arithmetic Rules 3 ADDdenarydenary sum = 7= = 15= 5 (carry 1) GCSE Computing GCSE Computing Theory © gcsecomputing.net

Adding Decimal Numbers Carry + GCSE Computing GCSE Computing Theory © gcsecomputing.net

Adding Decimal Numbers Carry + 1 GCSE Computing GCSE Computing Theory © gcsecomputing.net

Binary Arithmetic Rules 6 ADDdenarybinarybinary sum = 0= 00= = 1= 01= = 1= 01= = 2= 10= 0 (carry 1) = 3= 11= 1 (carry 1) GCSE Computing GCSE Computing Theory © gcsecomputing.net

Adding Binary Numbers Carry Decimal AdditionBinary Addition 1 GCSE Computing GCSE Computing Theory © gcsecomputing.net

Adding Binary Numbers Carry Decimal AdditionBinary Addition 1 GCSE Computing 1 1 GCSE Computing Theory © gcsecomputing.net

Overflow in Binary Number Addition Carry Decimal AdditionBinary Addition GCSE Computing If we only have 4 bits to store the result there would be no room for a carry, so it is lost and we get the wrong answer. When there isn’t enough room for a result, this is called an overflow and it produces an overflow error. GCSE Computing Theory © gcsecomputing.net