0% found this document useful (0 votes)
44 views1 page

Web Tut1a Solns Rev

This document contains examples and solutions for number systems and digital design concepts. It includes converting between binary, decimal, octal, hexadecimal and ones' complement representations. It also shows addition examples in 1's complement binary arithmetic and how overflow occurs when the result cannot be represented with a limited number of bits.

Uploaded by

Al Carte
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
44 views1 page

Web Tut1a Solns Rev

This document contains examples and solutions for number systems and digital design concepts. It includes converting between binary, decimal, octal, hexadecimal and ones' complement representations. It also shows addition examples in 1's complement binary arithmetic and how overflow occurs when the result cannot be represented with a limited number of bits.

Uploaded by

Al Carte
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

EE2006: Digital Design

EE2006 Solutions for Number Systems

1. (a) 1010
{ 0101 { • 1111
{ 1001 { 1100
{ 1110
{ (b) ( 578.28F 5....)16
(c) ( 534.07 )8 (d) (10100110.0101…)2 (e) 4623

2. (a) 121 (b) −1 (c) −16 (d) −127

3. (a) (11111010)2 (b) (i). -122 ii).-5 (iii).-6

4. 5.

Decimal Sign Mag. Decimal 1’s Comp.


127 01111111 43 0000101011
-0 10000000 -1 1111111110
-55 10110111 -128 1101111111

6.
(a) 27 + 38 01000001 ⎯⎯⎯→ 65
(b) (-1) + 45 100101100 ⎯⎯⎯→ 44
(Adding these two numbers causes a carry over
into the 9th bit position, which is ignored in the
8-bit arithmetic system.)
(c) -128 + (-60) 01000100 ⎯⎯⎯→ 68
(d) 55 + 75 10000010 ⎯⎯⎯→ -126
(c) and (d) reflect an overflow situation i.e. the
correct result cannot be represented with the
available number of bits. If there is overflow the
sum of 2 positive numbers will become negative,
or the sum of 2 negative numbers becomes
positive.

You might also like