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

Lecture 2 - Timeline of Computing History - Comp Society

This document is a tutorial sheet for a fundamentals of computing course that provides questions about data representation. The questions cover topics like: 1) Decoding an ASCII encoded message 2) Calculating the largest numeric value that can be represented using 3 bytes of ASCII encoded digits 3) Converting between binary, decimal, and hexadecimal numeric representations 4) Decoding fixed-point binary numbers to decimal 5) Performing two's complement binary arithmetic 6) Decoding a floating-point binary number to decimal

Uploaded by

silvicutza
Copyright
© © All Rights Reserved
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)
39 views1 page

Lecture 2 - Timeline of Computing History - Comp Society

This document is a tutorial sheet for a fundamentals of computing course that provides questions about data representation. The questions cover topics like: 1) Decoding an ASCII encoded message 2) Calculating the largest numeric value that can be represented using 3 bytes of ASCII encoded digits 3) Converting between binary, decimal, and hexadecimal numeric representations 4) Decoding fixed-point binary numbers to decimal 5) Performing two's complement binary arithmetic 6) Decoding a floating-point binary number to decimal

Uploaded by

silvicutza
Copyright
© © All Rights Reserved
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

School of Computing & Mathematics

First Year – Semester One


CSC-10029: Fundamentals of Computing

Tutorial Sheet 02 - Data Representation


You should prepare answers to these questions in advance of your tutorial in the week beginning
23th October.

1. The following sequence of 48 bits is a message encoded using the eight-bits-per-


symbol ASCII code.
01001000 01100101 01101100 01101100 01101111 00101110

What does this message say? (Taking a look at Appendix A in Brookshear could
prove useful here.)

2. Using just 24 bits, what is the largest numeric value that could be represented with
three eight-bit bytes if:
 each digit was encoded using eight-bit ASCII characters;
 ordinary unsigned binary notation was used for the three byte-long
encoding?

3. Decode the following unsigned binary number 001001012 into its equivalent
decimal value. Go on to encode its decimal value in hexadecimal (i.e. base 16)
notation. Show how the hexadecimal value can alternatively be derived with a
binary-hexadecimal conversion table.

4. Decode the following fixed-point unsigned binary number 0101.1012 into its
equivalent decimal value.

5. Evaluate 7 – 5 using 8-bit two’s-complement encodings for each of these integer


values [Hint: remember that the subtraction 7 – 5 is equivalent to the addition of
7 + (– 5) ].

6. Evaluate 5 – 7 using 8-bit two’s-complement encodings for each of these integer


values.

7. Using the 8-bit floating-point encoding scheme that was illustrated in a recent
lecture, what is the denary (i.e. decimal or base 10) value of the following eight
bits: 10101001 ?

TN/CD CSC-10029: Tutorial Sheet 02 Page 1 of 1

You might also like