3.

4 Example Questions

1. a) Express the number 113 (denary) in

(i) binary
(ii) in BCD
using an appropriate number of bytes in each case. (4)
b) Using the answer obtained in part (a) show how 113 (denary) can be expressed
in
(i) octal
(ii) hexadecimal. (4)

2. Explain how the denary number –27 can be represented in binary in

(i) sign and magnitude
(ii) two’s complement
notation, using a single byte for each answer. (4)
3. Add together the binary equivalents of 34 and 83, using single byte arithmetic,
showing you working. (3)

4. Describe a floating point representation for real numbers using two bytes. (4)

5. a) Explain how the fraction part of a real number can be normalised. (2)

b) State the benefit obtained by storing real numbers using normalised form. (1)

6. a) A floating point number is represented in a certain computer system in a single

8 bit byte. 5 bits are used for the mantissa and 3 bits for the exponent. Both
are stored in two’s complement form and the mantissa is normalised.

(i) State the smallest positive value,

(ii) state the most negative value

that can be stored. Give each answer as an 8 bit binary value and as a decimal
equivalent. (4)

b) Explain the relationship between accuracy and range when storing floating
point representations of real numbers. (4)

7. State the difference between dynamic and static data structures giving an
example of each. (3)

8. a) Show how a binary tree can be used to store the data items Feddi, Eda, Joh,
Sean, Dav, Gali in alphabetic order. (4)

b) Explain why problems may arise if Joh is deleted from the tree and how such
problems may be overcome. (4)

4.4 - 29
9. Describe two types of search routine, giving an indication of when it would be
advisable to use each. (6)

10. Describe the steps in sorting a list of numbers into order using an insertion
sort. (4)

11. Given two sorted lists describe an algorithm for merging them into one sorted
list. (6)

4.4 - 30