Lecture 2. Binary and Hexadecimal Numbers

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Lecture 2. Binary and Hexadecimal Numbers"

Transcription

1 Lecture 2 Binary and Hexadecimal Numbers Purpose: Review binary and hexadecimal number representations Convert directly from one base to another base Review addition and subtraction in binary representations Determine overflow in unsigned and signed binary addition and subtraction Lecture 2 Page 1

2 The Need for Other Bases Humans are used to the decimal number system, also called radix-10 or base-10. To state the obvious, base-10 means that a digit has one of ten possible values, 0 through 9. In computers, numbers are stored in binary, also called radix-2 or base-2, using arrays of flip-flops. Each digit may take one of two values, either 0 or 1. Long strings of these 1 s and 0 s are cumbersome to use, so we will usually represent binary numbers using hexadecimal, also called radix-16 or base-16. It is important to note that no computer actually stores values in hardware using hexadecimal. This number system is only a convenience for humans. All of these number systems are positional. Lecture 2 Page 2

3 Unsigned Decimal Numbers are represented using the digits 0, 1, 2,, 9. Multi-digit numbers are interpreted as in the following example: = Unsigned Binary Numbers are represented using the digits 0 and 1. Multi-digit numbers are interpreted as in the following example: = In binary, each digit is called a bit. Since we use binary to represent the values stored in a group of flip-flops, we usually specify a binary system by the number of bits (flip-flops) being used to store each number. When we write numbers in this system, we will write all bits, including leading 0 s. The number above is expressed in 5-bit binary. The number below is in 8-bit binary Lecture 2 Page 3

4 Unsigned Hexadecimal Numbers are represented in hexadecimal using the digits 0, 1, 2,, 9, A, B,, F where the letters represent values: A=10, B=11, and so on to F=15. Note that this gives sixteen possible values for each digit. Multidigit numbers are interpreted as in the following example: 76CA 16 = Notes on Bases Since all three number bases will be used, including the correct subscript when a number is written out of context is mandatory. Pronunciation Words like ten, twenty, and one-thousand refer to specific numbers of items, regardless of how the numbers are written. To avoid confusion, binary and hexadecimal numbers are spoken by naming the digits followed by binary or hexadecimal. For example, is pronounced one zero zero zero hexadecimal. One-thousand is actually 3E8 16. Lecture 2 Page 4

5 Ranges of Unsigned Number Systems System Lowest Highest Number of Values 4-bit binary (1-digit hex) 8-bit binary (1 byte) (2-digit hex) 16-bit binary (2 bytes) (4-digit hex) n-bit binary Lecture 2 Page 5

6 2 s Complement Binary Numbers Most microprocessors today use 2 s Complement numbers to represent systems with positive and negative values. Hardware performs addition and subtraction on binary values the same way whether they represent unsigned systems or 2 s complement systems, and this greatly simplifies the design of the processor The only difference between unsigned binary systems and 2 s comp. binary systems is that the most significant bit in signed systems has a weight of -2 n-1. Both systems are also defined by the number of bits being used, and as with unsigned, we must write down all bits. To distinguish between the two, we will use a 2c subscript to indicate a 2 s comp. number. Example: Convert c to decimal. Example: Convert c to decimal. Example: Convert c to decimal. It is very important to note that microprocessors usually view a group of bits as simply a group of bits. It is the human that interprets the group as an unsigned value, signed value, or also as just a group of bits. Lecture 2 Page 6

7 Ranges of Signed Number Systems System Least Greatest Number of Values 4-bit binary 8-bit binary 16-bit binary n-bit binary Note that the least representable value has a single 1 in the column with a negative weight and 0 s in the columns with positive weights. The greatest representable number is just the opposite: 1 s in the positively weighted columns and a 0 in the column with a negative weight. Lecture 2 Page 7

8 Sign Bit Since the leftmost column has a negative weight, and the magnitude of that weight is larger than the weights of all the positive columns added together, any number with a 1 in the leftmost column will be negative. If the leftmost bit has a 0, then there is no negative contribution, and the value will be positive. Hence, the sign of the number can be determined by inspection. Negating a 2 s Complement Number The official way to negate a value is to subtract it from zero. This will generate a number with the same magnitude but with the opposite sign. The second method is to perform the 2 s complement, which is the following two steps: 1. Perform the 1 s complement (flip all the bits) 2. Add 1 Example: Negate c (41 10 ) Lecture 2 Page 8

9 Converting Between Number Systems Given the three number systems (binary, hexadecimal, and decimal), there are six possible conversions to allow us to convert directly from one to another. Binary to Decimal: This was covered earlier in this lecture by determining the weights for each column and adding them up, either as unsigned or as signed. Hexadecimal to Decimal: This was also covered earlier in this lecture by determining the weights for each column and adding them up. Decimal to Binary (or Hexadecimal): This conversion is more of a process than the others. 1. Successively divide the decimal number by the new base and keep track of the remainders generated. 2. Stop dividing once the quotient reaches Write the remainders in the opposite order than they were generated. 4. Add leading digits if necessary. Lecture 2 Page 9

10 Example: Convert to 8-bit unsigned binary. Example: Convert to 2-digit hexadecimal. Lecture 2 Page 10

11 Note: To convert a negative value, first convert the magnitude to the correct number of bits as done above. Then, negate the result to get the final answer. Binary to Hexadecimal: This conversion is the reason that hexadecimal is used in the first place. Since once hexadecimal digit can represent 16 different values, and four bits can also represent 16 (2 4 ) different values, the bits of the binary number will be grouped together in 4 s and replaced by the hexadecimal digit with the same value. Example: Convert the binary numbers below to hexadecimal c Note that a binary number may not always contain an integer multiple of 4 bits. In these cases, always extend the binary number by padding it with zeros, whether the number is unsigned or signed. Example: Convert the binary numbers below to hexadecimal c c Lecture 2 Page 11

12 Hexadecimal to Binary: As with binary to hexadecimal, this conversion is by inspection. Each hexadecimal digit is replaced with the four bits that represents the same value. Example: Convert the following hexadecimal numbers to binary. BEFA 16 73FC 16 Hexadecimal is not usually interpreted as signed or unsigned. It is simply a more convenient method for humans to discuss binary patterns. By default, we will assume that the binary pattern has four bits for every hexadecimal digits used, as done above. However, we can also specify a binary system with any number of bits, as done on the latter half of the previous slide. We must explicitly state the binary system being used, and we will ignore the padding 0 s. Example: Convert the following hexadecimal numbers to the specified binary system. 07B 16 to 9-bit signed 1F 16 to 5-bit unsigned Lecture 2 Page 12

13 Binary Arithmetic Unsigned and signed addition and subtraction generate the same numerical result. The difference is determining if overflow or underflow (usually grouped together generically as overflow ) occurs. The methods below work for both addition and subtraction. For unsigned: For signed: The above methods are easily implemented in hardware. For humans, there is an alternate approach for signed arithmetic. Addition: If the two numbers being added have the same sign, the answer must have that sign. Otherwise, overflow occurs. Signed addition cannot generate overflow if the two numbers being added have different signs. Subtraction: Lecture 2 Page 13

14 Example: Determine the result, if unsigned overflow occurred, and if signed overflow occurred. (Note that the binary numbers are shown with an unsigned subscript for simplicity.) Lecture 2 Page 14

15 Modular Number Systems Wrap-around point for unsigned Wrap-around point for signed Here s another way to visualize overflow. Binary systems are modular. For our purposes, modular means that a constant number of digits are used. Above, increasing a value (i.e. add a positive or subtract a negative) moves us clockwise around the number line. Decreasing a value (i.e. subtract a positive or add a negative) moves us counterclockwise. If the wrap-around point is crossed during this move, overflow occurs. Lecture 2 Page 15

16 Extending Binary Numbers When performing arithmetic operations, the binary numbers must have the same number of bits. Therefore, it is sometimes necessary to extend the shorter number so that it has the same number of bits as the longer number. This must be done in a manner such that the new, longer number still represents the same value as the shorter number. For unsigned: For signed: Example: Extend the binary numbers below to 16 bits c c Note that a binary number can always be extended correctly. Lecture 2 Page 16

17 Truncating Binary Numbers There are times when a value will be expressed in more bits than needed, and the number of bits being used should be reduced to save space. This is done by discarding the most significant bits of a binary number. Technically, truncation may always be performed. However, we will say that it is not possible if it yields a shorter number that does not represent the same value as the original, longer number. For example, of the possible 16-bit numbers, only 512 may be correctly truncated to the 512 possible 9-bit numbers. Unsigned: All bits discarded must be 0 s, otherwise the shorter number will not be accurate. Signed: All bits discarded must be the same as the new sign bit of the shorter number, otherwise the shorter number will not be accurate. Example: Determine which of the 16-bit values below can be truncated to 8 bits in the specified system c c c c Lecture 2 Page 17

Levent EREN levent.eren@ieu.edu.tr A-306 Office Phone:488-9882 INTRODUCTION TO DIGITAL LOGIC

Levent EREN levent.eren@ieu.edu.tr A-306 Office Phone:488-9882 INTRODUCTION TO DIGITAL LOGIC Levent EREN levent.eren@ieu.edu.tr A-306 Office Phone:488-9882 1 Number Systems Representation Positive radix, positional number systems A number with radix r is represented by a string of digits: A n

More information

Chapter 1: Digital Systems and Binary Numbers

Chapter 1: Digital Systems and Binary Numbers Chapter 1: Digital Systems and Binary Numbers Digital age and information age Digital computers general purposes many scientific, industrial and commercial applications Digital systems telephone switching

More information

Binary Numbering Systems

Binary Numbering Systems Binary Numbering Systems April 1997, ver. 1 Application Note 83 Introduction Binary numbering systems are used in virtually all digital systems, including digital signal processing (DSP), networking, and

More information

Chapter Binary, Octal, Decimal, and Hexadecimal Calculations

Chapter Binary, Octal, Decimal, and Hexadecimal Calculations Chapter 5 Binary, Octal, Decimal, and Hexadecimal Calculations This calculator is capable of performing the following operations involving different number systems. Number system conversion Arithmetic

More information

ECE 0142 Computer Organization. Lecture 3 Floating Point Representations

ECE 0142 Computer Organization. Lecture 3 Floating Point Representations ECE 0142 Computer Organization Lecture 3 Floating Point Representations 1 Floating-point arithmetic We often incur floating-point programming. Floating point greatly simplifies working with large (e.g.,

More information

Machine Architecture and Number Systems. Major Computer Components. Schematic Diagram of a Computer. The CPU. The Bus. Main Memory.

Machine Architecture and Number Systems. Major Computer Components. Schematic Diagram of a Computer. The CPU. The Bus. Main Memory. 1 Topics Machine Architecture and Number Systems Major Computer Components Bits, Bytes, and Words The Decimal Number System The Binary Number System Converting from Decimal to Binary Major Computer Components

More information

Cyber Security Workshop Encryption Reference Manual

Cyber Security Workshop Encryption Reference Manual Cyber Security Workshop Encryption Reference Manual May 2015 Basic Concepts in Encoding and Encryption Binary Encoding Examples Encryption Cipher Examples 1 P a g e Encoding Concepts Binary Encoding Basics

More information

Digital Logic Design. Introduction

Digital Logic Design. Introduction Digital Logic Design Introduction A digital computer stores data in terms of digits (numbers) and proceeds in discrete steps from one state to the next. The states of a digital computer typically involve

More information

Computer Science PLUS I Volume 1 : Concepts Government of Tamilnadu

Computer Science PLUS I Volume 1 : Concepts Government of Tamilnadu Computer Science PLUS I Volume 1 : Concepts Government of Tamilnadu Government of Tamilnadu First Edition 2005 Chairman Syllabus Committee Dr. Balagurusamy E, Vice Chancellor, Anna University, Chennai

More information

Copyright 2012 Pearson Education, Inc. Chapter 1 INTRODUCTION TO COMPUTING AND ENGINEERING PROBLEM SOLVING

Copyright 2012 Pearson Education, Inc. Chapter 1 INTRODUCTION TO COMPUTING AND ENGINEERING PROBLEM SOLVING Chapter 1 INTRODUCTION TO COMPUTING AND ENGINEERING PROBLEM SOLVING Outline Objectives 1. Historical Perspective 2. Recent Engineering Achievements 3. Computing Systems 4. Data Representation and Storage

More information

Memory is implemented as an array of electronic switches

Memory is implemented as an array of electronic switches Memory Structure Memory is implemented as an array of electronic switches Each switch can be in one of two states 0 or 1, on or off, true or false, purple or gold, sitting or standing BInary digits (bits)

More information

Subnetting Examples. There are three types of subnetting examples I will show in this document:

Subnetting Examples. There are three types of subnetting examples I will show in this document: Subnetting Examples There are three types of subnetting examples I will show in this document: 1) Subnetting when given a required number of networks 2) Subnetting when given a required number of clients

More information

Lecture N -1- PHYS 3330. Microcontrollers

Lecture N -1- PHYS 3330. Microcontrollers Lecture N -1- PHYS 3330 Microcontrollers If you need more than a handful of logic gates to accomplish the task at hand, you likely should use a microcontroller instead of discrete logic gates 1. Microcontrollers

More information

EE360: Digital Design I Course Syllabus

EE360: Digital Design I Course Syllabus : Course Syllabus Dr. Mohammad H. Awedh Fall 2008 Course Description This course introduces students to the basic concepts of digital systems, including analysis and design. Both combinational and sequential

More information

Discrete Structures. Rajmohan Rajaraman Eric Ropiak Chris Burrows Ravi Sundaram

Discrete Structures. Rajmohan Rajaraman Eric Ropiak Chris Burrows Ravi Sundaram Discrete Structures Harriet Fell Javed A. Aslam Rajmohan Rajaraman Eric Ropiak Chris Burrows Ravi Sundaram Discrete Structures Version 2.1 Harriet Fell Javed A. Aslam Rajmohan Rajaraman Eric Ropiak Chris

More information

DNA Data and Program Representation. Alexandre David 1.2.05 adavid@cs.aau.dk

DNA Data and Program Representation. Alexandre David 1.2.05 adavid@cs.aau.dk DNA Data and Program Representation Alexandre David 1.2.05 adavid@cs.aau.dk Introduction Very important to understand how data is represented. operations limits precision Digital logic built on 2-valued

More information

Subnetting Study Guide

Subnetting Study Guide Subnetting Study Guide by Boson Software, LLC An octet is a binary number of 8 bits, with the lowest possible number being 00000000 and the highest possible number being 11111111, or 28. The binary number

More information

A NEW REPRESENTATION OF THE RATIONAL NUMBERS FOR FAST EASY ARITHMETIC. E. C. R. HEHNER and R. N. S. HORSPOOL

A NEW REPRESENTATION OF THE RATIONAL NUMBERS FOR FAST EASY ARITHMETIC. E. C. R. HEHNER and R. N. S. HORSPOOL A NEW REPRESENTATION OF THE RATIONAL NUMBERS FOR FAST EASY ARITHMETIC E. C. R. HEHNER and R. N. S. HORSPOOL Abstract. A novel system for representing the rational numbers based on Hensel's p-adic arithmetic

More information

Expert Reference Series of White Papers. Simple Tricks To Ace the Subnetting Portion of Any Certification Exam 1-800-COURSES. www.globalknowledge.

Expert Reference Series of White Papers. Simple Tricks To Ace the Subnetting Portion of Any Certification Exam 1-800-COURSES. www.globalknowledge. Expert Reference Series of White Papers Simple Tricks To Ace the Subnetting Portion of Any Certification Exam 1-800-COURSES www.globalknowledge.com Simple Tricks To Ace the Subnetting Portion of Any Certification

More information

Sistemas Digitais I LESI - 2º ano

Sistemas Digitais I LESI - 2º ano Sistemas Digitais I LESI - 2º ano Lesson 6 - Combinational Design Practices Prof. João Miguel Fernandes (miguel@di.uminho.pt) Dept. Informática UNIVERSIDADE DO MINHO ESCOLA DE ENGENHARIA - PLDs (1) - The

More information

Fast Arithmetic Coding (FastAC) Implementations

Fast Arithmetic Coding (FastAC) Implementations Fast Arithmetic Coding (FastAC) Implementations Amir Said 1 Introduction This document describes our fast implementations of arithmetic coding, which achieve optimal compression and higher throughput by

More information

MEP Y9 Practice Book A

MEP Y9 Practice Book A 1 Base Arithmetic 1.1 Binary Numbers We normally work with numbers in base 10. In this section we consider numbers in base 2, often called binary numbers. In base 10 we use the digits 0, 1, 2, 3, 4, 5,

More information

Do not open this examination paper until instructed to do so. Section A: answer all the questions. Section B: answer all the questions.

Do not open this examination paper until instructed to do so. Section A: answer all the questions. Section B: answer all the questions. N10/5/COMSC/HP1/ENG/TZ0/XX 88107011 Computer science HIGHER level Paper 1 Tuesday 16 November 2010 (afternoon) 2 hours 15 minutes INSTRUCTIONS TO CANDIDATES Do not open this examination paper until instructed

More information

Classless Subnetting Explained

Classless Subnetting Explained Classless Subnetting Explained When given an IP Address, Major Network Mask, and a Subnet Mask, how can you determine other information such as: The subnet address of this subnet The broadcast address

More information

Z80 Instruction Set. Z80 Assembly Language

Z80 Instruction Set. Z80 Assembly Language 75 Z80 Assembly Language The assembly language allows the user to write a program without concern for memory addresses or machine instruction formats. It uses symbolic addresses to identify memory locations

More information

The science of computing

The science of computing The science of computing first edition by Carl Burch Copyright c 2004, by Carl Burch. This publication may be redistributed, in part or in whole, provided that this page is included. A complete version,

More information

IP Subnetting and Related Topics A Tutorial by Chris Uriarte <chrisjur@cju.com> Updated April 2001

IP Subnetting and Related Topics A Tutorial by Chris Uriarte <chrisjur@cju.com> Updated April 2001 IP Subnetting and Related Topics A Tutorial by Chris Uriarte Updated April 2001 IP Addresses and their Binary Equivalents First and foremost, it s important to understand that every

More information

Q-Format number representation. Lecture 5 Fixed Point vs Floating Point. How to store Q30 number to 16-bit memory? Q-format notation.

Q-Format number representation. Lecture 5 Fixed Point vs Floating Point. How to store Q30 number to 16-bit memory? Q-format notation. Lecture 5 Fixed Point vs Floating Point Objectives: Understand fixed point representations Understand scaling, overflow and rounding in fixed point Understand Q-format Understand TM32C67xx floating point

More information

Technical Support Bulletin Nr.18 Modbus Tips

Technical Support Bulletin Nr.18 Modbus Tips Technical Support Bulletin Nr.18 Modbus Tips Contents! Definitions! Implemented commands! Examples of commands or frames! Calculating the logical area! Reading a signed variable! Example of commands supported

More information

Classful Subnetting Explained

Classful Subnetting Explained Classful ting Explained When given an IP Address and a Mask, how can you determine other information such as: The subnet address of this subnet The broadcast address of this subnet The range of Host Addresses

More information

One of the most important topics in any discussion of TCP/IP is IP. IP Addressing

One of the most important topics in any discussion of TCP/IP is IP. IP Addressing IP Addressing 125 machine, called a RARP server, responds with the answer, and the identity crisis is over. RARP uses the information it does know about the machine s MAC address to learn its IP address

More information

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell Digital Electronics Part I Combinational and Sequential Logic Dr. I. J. Wassell Introduction Aims To familiarise students with Combinational logic circuits Sequential logic circuits How digital logic gates

More information

Cryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur

Cryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards

More information

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}

More information

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding

More information

Major Work of the Grade

Major Work of the Grade Counting and Cardinality Know number names and the count sequence. Count to tell the number of objects. Compare numbers. Kindergarten Describe and compare measurable attributes. Classify objects and count

More information

isppac-powr1220at8 I 2 C Hardware Verification Utility User s Guide

isppac-powr1220at8 I 2 C Hardware Verification Utility User s Guide November 2005 Introduction Application Note AN6067 The isppac -POWR1220AT8 device from Lattice is a full-featured second-generation Power Manager chip. As part of its feature set, this device supports

More information

Chapter 5. Binary, octal and hexadecimal numbers

Chapter 5. Binary, octal and hexadecimal numbers Chapter 5. Binary, octal and hexadecimal numbers A place to look for some of this material is the Wikipedia page http://en.wikipedia.org/wiki/binary_numeral_system#counting_in_binary Another place that

More information

Data Storage: Each time you create a variable in memory, a certain amount of memory is allocated for that variable based on its data type (or class).

Data Storage: Each time you create a variable in memory, a certain amount of memory is allocated for that variable based on its data type (or class). Data Storage: Computers are made of many small parts, including transistors, capacitors, resistors, magnetic materials, etc. Somehow they have to store information in these materials both temporarily (RAM,

More information

Combinational Logic Design

Combinational Logic Design Chapter 4 Combinational Logic Design The foundations for the design of digital logic circuits were established in the preceding chapters. The elements of Boolean algebra (two-element switching algebra

More information

IP Subnetting: Practical Subnet Design and Address Determination Example

IP Subnetting: Practical Subnet Design and Address Determination Example IP Subnetting: Practical Subnet Design and Address Determination Example When educators ask students what they consider to be the most confusing aspect in learning about networking, many say that it is

More information

CSE 2300W DIGITAL LOGIC DESIGN

CSE 2300W DIGITAL LOGIC DESIGN CSE 2300W DIGITAL LOGIC DESIGN How this class fits into ECE/CSE/EE/CS curricula: Already had at least some computer basics and one programming language. This course will emphasize some of the major inner

More information

Object Oriented Software Design

Object Oriented Software Design Object Oriented Software Design Introduction to Java - II Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 28, 2010 G. Lipari (Scuola Superiore Sant Anna) Introduction

More information

A NEW HASH ALGORITHM: Khichidi-1

A NEW HASH ALGORITHM: Khichidi-1 A NEW HASH ALGORITHM: Khichidi-1 Abstract This is a technical document describing a new hash algorithm called Khichidi-1 and has been written in response to a Hash competition (SHA-3) called by National

More information

Memory Management Simulation Interactive Lab

Memory Management Simulation Interactive Lab Memory Management Simulation Interactive Lab The purpose of this lab is to help you to understand deadlock. We will use a MOSS simulator for this. The instructions for this lab are for a computer running

More information

The Subnet Training Guide

The Subnet Training Guide The Subnet Training Guide A Step By Step Guide on Understanding and Solving Subnetting Problems by Brendan Choi v25 easysubnetcom The Subnet Training Guide v25 easysubnetcom Chapter 1 Understanding IP

More information

DATA_TYPE Values and Data File Storage Formats

DATA_TYPE Values and Data File Storage Formats Chapter 3. DATA_TYPE Values and Data File Storage Formats 3-1 Chapter 3. DATA_TYPE Values and Data File Storage Formats Each PDS archived product is described using label objects that provide information

More information

Concepts in IP Addressing...

Concepts in IP Addressing... 3 Concepts in IP Addressing Terms You ll Need to Understand: Binary Hexadecimal Decimal Octet IP address Subnet Mask Subnet Host Increment Techniques You ll Need to Master: Identifying Address Class and

More information

PURSUITS IN MATHEMATICS often produce elementary functions as solutions that need to be

PURSUITS IN MATHEMATICS often produce elementary functions as solutions that need to be Fast Approximation of the Tangent, Hyperbolic Tangent, Exponential and Logarithmic Functions 2007 Ron Doerfler http://www.myreckonings.com June 27, 2007 Abstract There are some of us who enjoy using our

More information

2.3 IPv4 Address Subnetting Part 2

2.3 IPv4 Address Subnetting Part 2 .3 IPv4 Address Subnetting Part Objective Upon completion of this activity, you will be able to determine subnet information for a given IP address and subnetwork mask. When given an IP address, network

More information

Simple C++ Programs. Engineering Problem Solving with C++, Etter/Ingber. Dev-C++ Dev-C++ Windows Friendly Exit. The C++ Programming Language

Simple C++ Programs. Engineering Problem Solving with C++, Etter/Ingber. Dev-C++ Dev-C++ Windows Friendly Exit. The C++ Programming Language Simple C++ Programs Engineering Problem Solving with C++, Etter/Ingber Chapter 2 Simple C++ Programs Program Structure Constants and Variables C++ Operators Standard Input and Output Basic Functions from

More information

Computer and Network Security

Computer and Network Security MIT 6.857 Computer and Networ Security Class Notes 1 File: http://theory.lcs.mit.edu/ rivest/notes/notes.pdf Revision: December 2, 2002 Computer and Networ Security MIT 6.857 Class Notes by Ronald L. Rivest

More information

MACM 101 Discrete Mathematics I

MACM 101 Discrete Mathematics I MACM 101 Discrete Mathematics I Exercises on Combinatorics, Probability, Languages and Integers. Due: Tuesday, November 2th (at the beginning of the class) Reminder: the work you submit must be your own.

More information

Lecture 4: Binary. CS442: Great Insights in Computer Science Michael L. Littman, Spring 2006. I-Before-E, Continued

Lecture 4: Binary. CS442: Great Insights in Computer Science Michael L. Littman, Spring 2006. I-Before-E, Continued Lecture 4: Binary CS442: Great Insights in Computer Science Michael L. Littman, Spring 26 I-Before-E, Continued There are two ideas from last time that I d like to flesh out a bit more. This time, let

More information

Volume Serial Numbers and Format Date/Time Verification

Volume Serial Numbers and Format Date/Time Verification Volume Serial Numbers and Format Date/Time Verification Written by Craig Wilson, MSc MBCS CITP Digital Detective Group October 2003 (updated June 2005) Table of Contents Table of Contents... 2 Introduction...

More information

Progressions for the Common Core State Standards in Mathematics (draft)

Progressions for the Common Core State Standards in Mathematics (draft) Progressions for the Common Core State Standards in Mathematics (draft) cthe Common Core Standards Writing Team 2 April 202 K 5, Number and Operations in Base Ten Overview Students work in the base-ten

More information

Simplifying Logic Circuits with Karnaugh Maps

Simplifying Logic Circuits with Karnaugh Maps Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified

More information

The finite field with 2 elements The simplest finite field is

The finite field with 2 elements The simplest finite field is The finite field with 2 elements The simplest finite field is GF (2) = F 2 = {0, 1} = Z/2 It has addition and multiplication + and defined to be 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 0 0 = 0 0 1 = 0

More information

2003 HSC Notes from the Marking Centre Software Design and Development

2003 HSC Notes from the Marking Centre Software Design and Development 00 HSC Notes from the Marking Centre Software Design and Development 004 Copyright Board of Studies NSW for and on behalf of the Crown in right of the State of New South Wales. This document contains Material

More information

Chapter 2: Basics on computers and digital information coding. A.A. 2012-2013 Information Technology and Arts Organizations

Chapter 2: Basics on computers and digital information coding. A.A. 2012-2013 Information Technology and Arts Organizations Chapter 2: Basics on computers and digital information coding Information Technology and Arts Organizations 1 Syllabus (1/3) 1. Introduction on Information Technologies (IT) and Cultural Heritage (CH)

More information

eztcp Technical Document Modbus/TCP of eztcp Caution: Specifications of this document may be changed without prior notice for improvement.

eztcp Technical Document Modbus/TCP of eztcp Caution: Specifications of this document may be changed without prior notice for improvement. eztcp Technical Document Modbus/TCP of eztcp Version 1.3 Caution: Specifications of this document may be changed without prior notice for improvement. Sollae Systems Co., Ltd. http://www.sollae.co.kr Contents

More information

Floating point package user s guide By David Bishop (dbishop@vhdl.org)

Floating point package user s guide By David Bishop (dbishop@vhdl.org) Floating point package user s guide By David Bishop (dbishop@vhdl.org) Floating-point numbers are the favorites of software people, and the least favorite of hardware people. The reason for this is because

More information

Unit 2.1. Data Analysis 1 - V2.0 1. Data Analysis 1. Dr Gordon Russell, Copyright @ Napier University

Unit 2.1. Data Analysis 1 - V2.0 1. Data Analysis 1. Dr Gordon Russell, Copyright @ Napier University Data Analysis 1 Unit 2.1 Data Analysis 1 - V2.0 1 Entity Relationship Modelling Overview Database Analysis Life Cycle Components of an Entity Relationship Diagram What is a relationship? Entities, attributes,

More information

Taking Place Value Seriously: Arithmetic, Estimation, and Algebra

Taking Place Value Seriously: Arithmetic, Estimation, and Algebra Taking Place Value Seriously: Arithmetic, Estimation, and Algebra by Roger Howe, Yale University and Susanna S. Epp, DePaul University Introduction and Summary Arithmetic, first of nonnegative integers,

More information

Arithmetic Coding: Introduction

Arithmetic Coding: Introduction Data Compression Arithmetic coding Arithmetic Coding: Introduction Allows using fractional parts of bits!! Used in PPM, JPEG/MPEG (as option), Bzip More time costly than Huffman, but integer implementation

More information

IP Addressing A Simplified Tutorial

IP Addressing A Simplified Tutorial Application Note IP Addressing A Simplified Tutorial July 2002 COMPAS ID 92962 Avaya Labs 1 All information in this document is subject to change without notice. Although the information is believed to

More information

Module 2: Assigning IP Addresses in a Multiple Subnet Network

Module 2: Assigning IP Addresses in a Multiple Subnet Network Module 2: Assigning IP Addresses in a Multiple Subnet Network Contents Overview 1 Lesson: Assigning IP Addresses 2 Lesson: Creating a Subnet 19 Lesson: Using IP Routing Tables 29 Lesson: Overcoming Limitations

More information

CSE140: Components and Design Techniques for Digital Systems. Introduction. Prof. Tajana Simunic Rosing

CSE140: Components and Design Techniques for Digital Systems. Introduction. Prof. Tajana Simunic Rosing CSE4: Components and Design Techniques for Digital Systems Introduction Prof. Tajana Simunic Rosing Welcome to CSE 4! Instructor: Tajana Simunic Rosing Email: tajana@ucsd.edu; please put CSE4 in the subject

More information

Transition To College Mathematics

Transition To College Mathematics Transition To College Mathematics In Support of Kentucky s College and Career Readiness Program Northern Kentucky University Kentucky Online Testing (KYOTE) Group Steve Newman Mike Waters Janis Broering

More information

Recommendation for Applications Using Approved Hash Algorithms

Recommendation for Applications Using Approved Hash Algorithms NIST Special Publication 800-107 Recommendation for Applications Using Approved Hash Algorithms Quynh Dang Computer Security Division Information Technology Laboratory C O M P U T E R S E C U R I T Y February

More information

WHITE PAPER. Understanding IP Addressing: Everything You Ever Wanted To Know

WHITE PAPER. Understanding IP Addressing: Everything You Ever Wanted To Know WHITE PAPER Understanding IP Addressing: Everything You Ever Wanted To Know Understanding IP Addressing: Everything You Ever Wanted To Know CONTENTS Internet Scaling Problems 1 Classful IP Addressing 3

More information

Network and Host Addresses 1.3. 2003, Cisco Systems, Inc. All rights reserved. INTRO v1.0a 6-4

Network and Host Addresses 1.3. 2003, Cisco Systems, Inc. All rights reserved. INTRO v1.0a 6-4 IP Addressing To facilitate the routing of packets over a network, the TCP/IP protocol suite uses a 32-bit logical address known as an IP address. This topic introduces the components of an IP address.

More information

IP Subnetting Colin Weaver, ITdojo

IP Subnetting Colin Weaver, ITdojo IP Subnetting Colin Weaver, ITdojo Note: This document assumes that subnet zero is NOT used. For a description of subnet-zero, go here (http://www.cisco.com/warp/public/105/40.html). Subnetting IP networks

More information

73M2901CE Programming the Imprecise Call Progress Monitor Filter

73M2901CE Programming the Imprecise Call Progress Monitor Filter A Maxim Integrated Products Brand 73M2901CE Programming the Imprecise Call Progress Monitor Filter APPLICATION NOTE AN_2901CE_042 March 2009 Introduction The Teridian 73M2901CE integrated circuit modem

More information

What Every Computer Scientist Should Know About Floating-Point Arithmetic

What Every Computer Scientist Should Know About Floating-Point Arithmetic What Every Computer Scientist Should Know About Floating-Point Arithmetic D Note This document is an edited reprint of the paper What Every Computer Scientist Should Know About Floating-Point Arithmetic,

More information

MS ACCESS DATABASE DATA TYPES

MS ACCESS DATABASE DATA TYPES MS ACCESS DATABASE DATA TYPES Data Type Use For Size Text Memo Number Text or combinations of text and numbers, such as addresses. Also numbers that do not require calculations, such as phone numbers,

More information

Caml Virtual Machine File & data formats Document version: 1.4 http://cadmium.x9c.fr

Caml Virtual Machine File & data formats Document version: 1.4 http://cadmium.x9c.fr Caml Virtual Machine File & data formats Document version: 1.4 http://cadmium.x9c.fr Copyright c 2007-2010 Xavier Clerc cadmium@x9c.fr Released under the LGPL version 3 February 6, 2010 Abstract: This

More information

Intel 64 and IA-32 Architectures Software Developer s Manual

Intel 64 and IA-32 Architectures Software Developer s Manual Intel 64 and IA-32 Architectures Software Developer s Manual Volume 1: Basic Architecture NOTE: The Intel 64 and IA-32 Architectures Software Developer's Manual consists of seven volumes: Basic Architecture,

More information

3201 Computer Networks 2014/2015 Handout: Subnetting Question

3201 Computer Networks 2014/2015 Handout: Subnetting Question Subnetting Questions with Answers Question1: Given the following: Network address: 192.168.10.0 Subnet mask: 255.255.255.224 1. How many subnets? Ans: 6 2. How many hosts? Ans: 30 3. What are the valid

More information

IA-32 Intel Architecture Software Developer s Manual

IA-32 Intel Architecture Software Developer s Manual IA-32 Intel Architecture Software Developer s Manual Volume 1: Basic Architecture NOTE: The IA-32 Intel Architecture Software Developer s Manual consists of three volumes: Basic Architecture, Order Number

More information

Internet Addresses (You should read Chapter 4 in Forouzan)

Internet Addresses (You should read Chapter 4 in Forouzan) Internet Addresses (You should read Chapter 4 in Forouzan) IP Address is 32 Bits Long Conceptually the address is the pair (NETID, HOSTID) Addresses are assigned by the internet company for assignment

More information

CPU Organization and Assembly Language

CPU Organization and Assembly Language COS 140 Foundations of Computer Science School of Computing and Information Science University of Maine October 2, 2015 Outline 1 2 3 4 5 6 7 8 Homework and announcements Reading: Chapter 12 Homework:

More information

Attention: This material is copyright 1995-1997 Chris Hecker. All rights reserved.

Attention: This material is copyright 1995-1997 Chris Hecker. All rights reserved. Attention: This material is copyright 1995-1997 Chris Hecker. All rights reserved. You have permission to read this article for your own education. You do not have permission to put it on your website

More information

KCPSM6 Instruction Set

KCPSM6 Instruction Set KPSM6 Instruction Set aaa : 2-bit address to FFF kk : 8-bit constant to FF pp : 8-bit port ID to FF p : 4-bit port ID to F ss : 8-bit scratch pad location to FF x : Register within bank s to sf y : Register

More information

Introduction to Computer & Information Systems

Introduction to Computer & Information Systems Introduction to Computer & Information Systems Binnur Kurt kurt@ce.itu.edu.tr Istanbul Technical University Computer Engineering Department Copyleft 2005 1 Version 0.1 About the Lecturer BSc İTÜ, Computer

More information

1. Start Log Monitor. 2. Stop Log Monitor, check. Alarm State and turn on. alarm LED if alarm was. triggered. 3. Reset LED control state,

1. Start Log Monitor. 2. Stop Log Monitor, check. Alarm State and turn on. alarm LED if alarm was. triggered. 3. Reset LED control state, CS8304 operation MAIN flow 1. Start Log Monitor 1a. Check Alarm State Only 2. Stop Log Monitor, check Alarm State and turn on alarm LED if alarm was triggered 3. Reset LED control state, Get Number of

More information

Tamper protection with Bankgirot HMAC Technical Specification

Tamper protection with Bankgirot HMAC Technical Specification Mars 2014 Tamper protection with Bankgirot HMAC Technical Specification Bankgirocentralen BGC AB 2013. All rights reserved. www.bankgirot.se Innehåll 1 General...3 2 Tamper protection with HMAC-SHA256-128...3

More information

CCNA R&S: Introduction to Networks. Chapter 9: Subnetting IP Networks

CCNA R&S: Introduction to Networks. Chapter 9: Subnetting IP Networks CCNA R&S: Introduction to Networks Chapter 9: Subnetting IP Networks Frank Schneemann Chapter 9: Subnetting IP Networks Subnetting IP Networks In this chapter, you will be learning how devices can be grouped

More information

1.Eastron SDM220Modbus Smart Meter Modbus Protocol Implementation V1.0

1.Eastron SDM220Modbus Smart Meter Modbus Protocol Implementation V1.0 1.Eastron SDM220Modbus Smart Meter Modbus Protocol Implementation V1.0 1.1 Modbus Protocol Overview This section provides basic information for interfacing the Eastron Smart meter to a Modbus Protocol

More information

Memory Systems. Static Random Access Memory (SRAM) Cell

Memory Systems. Static Random Access Memory (SRAM) Cell Memory Systems This chapter begins the discussion of memory systems from the implementation of a single bit. The architecture of memory chips is then constructed using arrays of bit implementations coupled

More information

PRODUCT MANUAL SKX OPEN SKX ADVANCE ZN1RX-SKXOPEN. Edition 2 Version 1.1

PRODUCT MANUAL SKX OPEN SKX ADVANCE ZN1RX-SKXOPEN. Edition 2 Version 1.1 PRODUCT MANUAL SKX OPEN SKX ADVANCE ZN1RX-SKXOPEN Edition 2 Version 1.1 INDEX 1. Introduction... 3 1.1. SKX Interface... 3 1.2. SKX Installation... 5 1.3. SKX Advance: Application Program... 5 1.3.1. SKX

More information

Computer Science 217

Computer Science 217 Computer Science 217 Midterm Exam Fall 2009 October 29, 2009 Name: ID: Instructions: Neatly print your name and ID number in the spaces provided above. Pick the best answer for each multiple choice question.

More information

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 33, NO. 11, NOVEMBER 2014 1611

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 33, NO. 11, NOVEMBER 2014 1611 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 33, NO. 11, NOVEMBER 2014 1611 An SMT Based Method for Optimizing Arithmetic Computations in Embedded Software Code Hassan

More information

Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)

Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the

More information

Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #10 Symmetric Key Ciphers (Refer

More information

The mathematics of RAID-6

The mathematics of RAID-6 The mathematics of RAID-6 H. Peter Anvin 1 December 2004 RAID-6 supports losing any two drives. The way this is done is by computing two syndromes, generally referred P and Q. 1 A quick

More information

Pre-lab Preparation: 1. Read thoroughly and prepare the experiment sheet. 2. You must bring a printed copy of this experiment with you to the lab.

Pre-lab Preparation: 1. Read thoroughly and prepare the experiment sheet. 2. You must bring a printed copy of this experiment with you to the lab. University of Jordan Faculty of Engineering & Technology Computer Engineering Department Computer Networks Laboratory 907528 Lab.5 Subnetting &Variable Length Subnet Mask (VLSM) Objectives 1. To become

More information

Package PKI. July 28, 2015

Package PKI. July 28, 2015 Version 0.1-3 Package PKI July 28, 2015 Title Public Key Infrastucture for R Based on the X.509 Standard Author Maintainer Depends R (>= 2.9.0),

More information

The Keyed-Hash Message Authentication Code (HMAC)

The Keyed-Hash Message Authentication Code (HMAC) FIPS PUB 198-1 FEDERAL INFORMATION PROCESSING STANDARDS PUBLICATION The Keyed-Hash Message Authentication Code (HMAC) CATEGORY: COMPUTER SECURITY SUBCATEGORY: CRYPTOGRAPHY Information Technology Laboratory

More information