Scribd
Upload
10 views

Tutorial 1-NumberSys

This document provides a tutorial on number systems and codes. It contains 15 problems involving converting between binary, decimal, octal, hexadecimal, BCD, gray code, and signed number representations. It also covers operations like addition, subtraction, multiplication, and division in binary, as well as error detection using odd parity codes.

Uploaded by

todlerr101
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Tutorial 1-NumberSys

This document provides a tutorial on number systems and codes. It contains 15 problems involving converting between binary, decimal, octal, hexadecimal, BCD, gray code, and signed number representations. It also covers operations like addition, subtraction, multiplication, and division in binary, as well as error detection using odd parity codes.

Uploaded by

todlerr101
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIVERSITI TUNKU ABDUL RAHMAN

Faculty : Lee Kong Chian Faculty of Course : UEEA1323/UEEP1323


Engineering and Science Code
Program : 3E, EC, ET, PH, MH, BI, MM Course : Digital Electronics
Name
Year / Trimester : 2022 / 01 Lecturer : Low Foo Wah

Tutorial 1: Number Systems and Codes

1. Convert the following numbers to the base specified:


(a) 301.1210 to base 2
(b) 100110102 to base 10

2. Convert the following binary numbers to their octal and hexadecimal equivalents.
Then convert both of your answers to decimal and verify that they are the same.
(a) 111010011
(b) 11111110.0001

3. Convert the following hexadecimal numbers to their binary equivalents:


(a) AC
(b) 1B.7F

4. Convert 384.7410 to hexadecimal numbers (Round to two digits past the


hexadecimal point). Devise a scheme to convert hexadecimal directly to base 4
and use the scheme to convert your answer to base 4. Verify your scheme by
converting your base-4 answer back to decimal.

5. Add the binary numbers.


(a) 111.111 and 111
(b) 1110010111 and 1100110011

6. Subtract in binary.
(a) 11010 - 10111
(b) 10110010 - 111101

7. Use binary multiplication, adding partial products as they are formed, to find:
(a) 10111  110010
(b) 11001  1011011
Change to decimal and confirm the answers.

8. Use binary long division to calculate:


(a) 100111010  1101
(b) 111010011  11011
Change to decimal and confirm the answers.

1
9. Compute the following numbers in the format of sign-and-magnitude, 1’s
compliment and 2’s complement using 12-bit representation.
(a) 478
(b) -280
(c) -2

10. A computer store numbers in 8-bit 2’s complement form. What is the largest
positive number? What is the negative number with the largest magnitude?

11. Use 2’s complement notation to perform the following. Assume that the numbers
are already in 2’s complement form.
(a) 001111 – 001011
(b) 00110011 – 11100101
(c) 11100011 + 11111010

12. Add the following numbers, with those negative represented in 6-bit 2’s
complement. Indicate if an overflow occurs.
(a) 21 + 11 (b) (-14) + 32 (c) (-12) + 13
(d) (-11) + (-21) (e) (-25) + 18
Repeat using 1’s complement to represent negative numbers.

13. Convert the following numbers to their BCD equivalent.


(a) 10101102
(b) 1100100.112

14. Add the following BCD numbers


(a) 01100100 + 00110011
(b) 100101111000 + 100101010001

15. (a) Convert 3410 to its Gray code equivalent.


(b) Convert the Gray code 11000010001 to binary.

16. Determine whether the following odd parity codes are in error.
(a) 11110110 (b) 00110001

You might also like