Scribd
Upload
47 views4 pages

Assessment Final

Computer Architecture

Uploaded by

Hagi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views4 pages

Assessment Final

Computer Architecture

Uploaded by

Hagi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

The floating point will have the 8 bit exponent & 23 bit fraction and total will be of 32(bits).

IEE-755 consists of 3 parts they are follows:

 Exponent represented as e
 Mantissa represented as m
 0 for the sign bits positive number
 1 for the sign bits negative number

Format for Single precision is [ 1-2s ]x[ 1+f ]x[2 e-Bias] where f is floating point.

The decimal value for the following number

0 01111110 1010000000000….

1)Conversation of each field to decimal.

2)0 is the sign bit(s)

3)S is the Exponent field and it has 01111110 = ( 0x2 7+1x26+1x25+1x24+1x23+1x22+1x21+0x20 )10

= (0 +64 +32 +16 +8 +4 +2 + 0) 10

After adding above fields = ( 126 ) 10

4)Mantissa 0.1010000000000000000 = ( 1 x 0.5 + 0 x 0.25 + 1x 0.125 ) 10

f = ( 0.625 ) 10

Bias = 2n-1-1 , and n is number of bits.

= 2 8-1- 1

= 128 - 1

The final answer is = 127

The representation of the single precision = ( 1-2s )x( 1+f ) x ( 2 e-Bias )

= ( (1- ( 2x0 ) )x( 1+0.625 )x( 2 126-127)

= 1.625/2

= 0.8125
The solution for the 2 (b)

We have 5-bits to represent a signed binary number, (1-bit for the sign bit and 4-bits for the
magnitude bits), then the actual range of numbers we can represent in sign-magnitude
notation would be:

= -2(5-1)-1 to + 2(5-1)-1

= -15 to +15

Decimal Signed Magnitude Signed One’s Signed Two’s


Complement
Complement

+15 01111 01111 01111

+14 01110 01110 01110

+13 01101 01101 01101

+12 01100 01100 01100

+11 01011 01011 01011

+10 01010 01010 01010

+9 01001 01001 01001

+8 01000 01000 01000

+7 00111 00111 00111

+6 00110 00110 00110

+5 00101 00101 00101

+4 00100 00100 00100

+3 00011 00011 00011

+2 00010 00010 00010


+1 00001 00001 00001

+0 00000 00000 00000

-0 10000 11111 -

-1 10001 11110 11111

-2 10010 11101 11110

-3 10011 11100 11101

-4 10100 11011 11100

-5 10101 11010 11011

-6 10110 11001 11010

-7 10111 11000 11001

-8 11000 10111 11000

-9 11001 10110 10111

-10 11010 10101 10110

-11 11011 10100 10101

-12 11100 10011 10100

-13 11101 10010 10011

-14 11110 10001 10010

-15 11111 10000 10001

Question 2

b. Using basic Boolean algebra identities for Boolean variables A, B and C, prove that 

X’Y+XYZ’+Y’+ XZ (Y+Y’) = 1. Please show all steps and mention the identities used.
SOLUTION: LEFT HAND SIDE (L.H.S)

A|B+ABC|+B|+AC (B+B|) [DISTRIBUTIVE LAW]

A|B+ABC|+B|+ACB+ACB|

A|B+B|+ACB|+AB(C+C|) [INVERSE LAW]

A|B+B|+ACB|+AB

B|+ACB|+B (A+A|) [INVERSE LAW]

B| +ACB|+B

B+ACB|+B| (A+A|) [INVERSE LAW]

B+ACB|+B|A+B|A| [DISTRIBUTIVE LAW]

B+A|B|+AB| (1+C) [NULL LAW]

B+B| (A+A|) [INVERSE LAW]

B+B| [INVERSE LAW]

= 1 [RIGHT HAND SIDE]

A|B+ABC|+B|+AC (B+B|) = 1

You might also like