16 views

Uploaded by Alvira Aisyura

digital aritmatic logic and binary task ,

- Machine Language for Beginners
- Revision Numbers.pdf
- DLD-Chap_2.pptx
- Digital Longevity
- d103639x012
- Grade 4 Math test
- 231394668-RC5-inroduction
- CompArchCh03L02AddSubtrOperations (1)
- day 1 plan
- Devicenet_1794-Adn User Manual
- Keywords & Terminologies Chapter 1 (Digital Logic Section 108)
- Macro Programming With ImageJ
- Buffer_Credit_Calculations
- 6ES72883AE040AA0 Datasheet En
- Digital Logic Review
- Computer Science 101 Introuction
- Bits,datatypes,& operationg ch2
- Chapter 5
- Device Profile e Base de Dados DNP 3.0 R2809014 FORM 5
- SMK PUTERIJAY1

You are on page 1of 12

system.Use a total of eight bits including the sign bit.

a.

+32

e.

+127

i.

-1

m.

+84

b.

-14

f.

-127

j.

-128

n.

+3

c.

+63

g.

+89

k.

+169

o.

-3

d.

-104

h.

-55

l.

p.

-190

Answer

a)Since the number is positive,the magnitude (32) will be represented in its

true-magnitude form,that is, 32= 100000 . Attaching the sign bit of 0, we have

+32= 00100000

b)Since the number is negative ,the magnitude (14) must be represented in 2s

complement form:

+14= 00001100

11110011

1 +

-14= 11110100

c) +63 = 00111111

d) +104 =

+104 =

01101000

10010111

1+

-104 =

10011000

e) +127 = 01111111

f) -127 =

-127 =

01111111

10000000

1+

-127 =

10000001

g) +89 = 01010011

h) +55:

+55

00110111

11001000

1+

-55

11001001

bits.However,the problem statement requires a eight-bit magnitude

preceded by a sign bit.

Thus,start with + 1

+1

00000001

11111110

1 +

-1

11111111

10000000

J) +128 :

+128

01111111

1+

-128 =

10000000

k) +169= 01010111

l) 0

0

00000000

11111111

1+

00000000

m)

+84= 01010100

n)

+3= 00000011

+3 =

00000011

11111100

1 +

-3

= 11111101

+190 =

01000010

10111101

1+

-190 =

10111110

6-3

Each of the following numbers represent a signed decimal number in the 2s

complement system.Determine the decimal value in each case.(Hint: Use negation

to convert negative numbers to positive)

a.

01101

e.

01111111

i.

01100011

b.

11101

f.

10000000

j.

11011001

c.

01111011

g.

11111111

d.

10011001

h.

10000001

Answer

a)The sign bit is 0,so the number is positive and the other four bits represent the

true

Thus,the decimal of number is +13

b)The sign bit of 11101 is a 1,so we know the number is negative,but,we cant tell

what the

magnitude is.

convert it

11101

00010

+

00011

(+29)

Since the result of negation is 00011= +29, the original number 11101 must

be equivalent to -29.

c) 01111011= +123

d) Follow the same procedure as in (b):

10011001

01100110

+

01100111

(+153)

,10011001= -153

e) 01111111=+127

f) Follow the same procedure as in (b):

10000000

(-128)

01111111

+

10000000

(-128)

11111111

(-253)

00000000

+

00000001

(+253)

10000001

(-129)

01111110

+

01111111

(+129)

11011001

(-217)

a) 01100011= +99

b) 11011001

00100110

+

00100111

(+217)

6-4

(a).What range of signed decimal values can be represented using 12 bits including

the sign bit ?

(b).How many bits would be required to represent decimal numbers from -32.768

to +32.767 ?

Answer

a) Since the MSB is to be used as the sign bit, there are twelve bits for the

magnitude.

The largest negative value is

1000000000000 = -212

= - 4096

The largest positive is

0111111111111= +212 1 = +4095

Thus, the range is -4096 to +4095 , this is a total of 8192 different values,

including zero.

Alternatively,since there are twelve magnitude bits (N=12),then there are

2+1 = 213 = 8192 different values

b) -32.768 = 1000000000000000 = 215

To

+32.767 = 0111111111111111= +215

Thus,the range is -32.768 to +32.767 have 15 bits.

6-6

Represent each of the following decimal values as an 8-bit signed binary value.

Then negate each one.

a. +73

b. -12

c. +15

Answer

a) +73 =

+73 = 01001001

10110110

1+

-73= 10110111

b) -12 =

-12 = 11110100

00001011

1+

+12 = 00001100

c) +15=

+15 = 00001101

11110010

1 +

-15 =

d) -1=

11110011

d. -1

e. -128

f.+127

-1 = 11111111

00000000

1 +

+1 = 00000001

e) -128 =

-128 = 10000000

01111111

1 +

+128 = 10000000

f) +127 =

+127 = 01111111

10000000

1

-127 = 10000001

6-7

What is the range of the unsigned decimal values that can be represented in 1bits?

What is the range of signed decimal values using the same number of bits?

Answer

-A byte is 10 bits. Since we are interested in unsigned numbers here,there is no

sign bit, so all of the ten bits are used for magnitude. Therefor the values will

range from

0000000000 = 0

To

1111111111 = 1023

This is a total of 1024 different values,which we could predicted since 210 =

1024.

-Since the MSB is to be used as the sign bit,there are nine bits for the

magnitude

The largest positive is :

0111111111= +29 1 = +511

Thus, the range is -512 to +511 ; this is a total of 1024 different values,including

zero. Alternatively,since there are nine magnitude bits (N=9),then there are 2+1 =

210 = 1024 different values.

- Machine Language for BeginnersUploaded bytom brady
- Revision Numbers.pdfUploaded bydevit siahaan
- DLD-Chap_2.pptxUploaded byrizwan
- Digital LongevityUploaded byartmaker43
- d103639x012Uploaded byMahmoud Fawzy
- Grade 4 Math testUploaded byLooser Paker
- 231394668-RC5-inroductionUploaded byalex3712
- CompArchCh03L02AddSubtrOperations (1)Uploaded bypreetha
- day 1 planUploaded byapi-254910622
- Devicenet_1794-Adn User ManualUploaded byarrellin
- Keywords & Terminologies Chapter 1 (Digital Logic Section 108)Uploaded bysameernsn
- Macro Programming With ImageJUploaded byChen Qian
- Buffer_Credit_CalculationsUploaded byEd Tanner
- 6ES72883AE040AA0 Datasheet EnUploaded byKevin Yeo
- Digital Logic ReviewUploaded bysara_lolo
- Computer Science 101 IntrouctionUploaded byJm Aseniero
- Bits,datatypes,& operationg ch2Uploaded bylogugl89
- Chapter 5Uploaded byAgrippa Mungazi
- Device Profile e Base de Dados DNP 3.0 R2809014 FORM 5Uploaded byAlex Almeida
- SMK PUTERIJAY1Uploaded byCik Yana
- BIT_ECE_09_SS11_NBUploaded bySanam1378
- 7828.pdfUploaded byMohammad Alzein
- 61-64WV51232Axx-BxxUploaded bysaurabh07tripathi
- Analysis 1Uploaded byAndrew Zhang
- DS1307Uploaded byKeyvleon
- a1s cw hw-20170814 ansUploaded byapi-279744489
- rfc392Uploaded byNickyNET
- ELEC module 20.pdfUploaded byRichard Regidor
- fractions intervention unit lessonsUploaded byapi-242808498
- c HardsoftUploaded byCarlos Mendoza

- ShilohUploaded byRobert John Meehan
- EPC-12 User ManualUploaded bynebiyou
- `Iolani - Heavenly HawkUploaded byKingdom of Hawai'i
- Task 8, Sem 1Uploaded byparamita
- 33520-90001Uploaded byArianeTaffarelloCardoso
- Fast DNS Xor Botnet Case StudyUploaded byhoney well
- 2017.02.01-21.15.12-simons-nlp-tutorialUploaded bygovindmanian
- the odyssey projectUploaded byapi-253866947
- MDaemon EnUploaded byJohn Thomas Rogan
- Towards a Systemic Profile of the Spanish MOODUploaded bysur_intercultural
- Apps Interview Questions.docUploaded byVenkidivi
- 202838-20-code-challenges.pdfUploaded byViet Quoc Hoang
- AlumniPortal.docUploaded byRahul Pandit
- Virtual San 62 Administration GuideUploaded byshyco007
- Narcissus-erotic poetryUploaded bygamahucher
- SESSION7-5Uploaded byNndondeni Ndondz-Nasri Mudau
- Writing Successful Query LettersUploaded bytroubledsoul
- Define Structure of Data Screens for Each Screen SequenceUploaded byaalex_aalex
- 1. Complexity AnalysisUploaded byHno Al-sobhy
- Courses Taught in English.pdfUploaded bycuachanhdong
- Death of Hired Man poemUploaded byAhmed Shigri
- Read My World 2014 English OverviewUploaded byNyirej Lewis
- oslabmanualUploaded byHafiz Deen
- Ramadan Daily Dua Plan_ When, How and What to Ask for - ProductiveMuslimUploaded byMohammad Aasimuddin
- Statutory Construction Reviewer for MidtermsUploaded byDanJalbuna
- Formal vs FunctionalUploaded byIrbaz Khan
- English Helpful Things for Legal WritingUploaded byRosette Yniguez Lerias
- Writing Guide - Act.3 - NewUploaded byEdwin Mejia Orozco
- Past Present and Future of JavascriptUploaded byparniangh
- Historicizing the PosthumanUploaded byMonja Milinkovic Jovic