Quelpr
2 marksData Representation

CAPE Computer Science Unit 1 · 2010 · Paper 2 · Question 1(d)(iii)

Showing all working, find the largest and smallest integers that can be represented using 6 bits if signed magnitude is used (leftmost bit for sign, other bits for the integer itself).

The mark scheme is shown once you've answered.

Practise this question

Other parts of this question

  1. 1(a)Give the truth tables of the THREE primary logic gates, appropriately labelled.[3 marks]
  2. 1(b)Explain how a 4-bit binary counter works, specifying the range of values counted.[4 marks]
  3. 1(c)(i)Draw a clearly labelled block diagram of a 2-to-4 line decoder.[3 marks]
  4. 1(c)(ii)Give the truth table of a 2-to-4 line decoder.[2 marks]
  5. 1(c)(iii)Draw a clearly labelled circuit of a 2-to-4 line decoder constructed from one or more of the primary logic gates.[6 marks]
  6. 1(d)(i)Calculate the decimal equivalent of 00101001_2.[1 mark]
  7. 1(d)(ii)Determine if the result of 0110 + 0101 can be stored as a 4-bit binary number.[2 marks]
  8. 1(d)(iv)Find the 4-bit two's complement representation of -4.[2 marks]

More practice: the rest of this paper · more Data Representation questions · all CAPE Computer Science Unit 1 past papers