HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /A car park barrier counts the cars that pass through it in one year, in a 16-bit register…
HardComputer ScienceHigh School (9–10)Computer Science › Data RepresentationNumericalConceptualIGCSE

A car park barrier counts the cars that pass through it in one year, in a 16-bit register…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

A car park barrier counts the cars that pass through it in one year, in a 16-bit register. On one day the count reaches 2026.

  1. Write 2026 as a 16-bit binary number.
  1. What is the largest count the register can hold?
  1. Would an 8-bit register be enough to count 2026 cars? Explain.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Binary is base 2. The 8-bit place values are 128, 64, 32, 16, 8, 4, 2 and 1, and 16 bits go on to 256, 512 and so on up to 32768. Binary to denary: add the place values under the 1s. Denary to binary: take away the largest place values that fit, or divide by 2 again and again and read the remainders from the bottom up.

The worked solution

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Given. 2026 in a 16-bit register.

Plan. Take away place values, starting from the largest that fits.

Step 1. 2048 is too big, so the largest place value that fits is 1024. 2026−1024=10022026 - 1024 = 10022026−1024=1002.

Step 2. 1002−512=4901002 - 512 = 4901002−512=490, then 490−256=234490 - 256 = 234490−256=234, then 234−128=106234 - 128 = 106234−128=106.

Step 3. 106−64=42106 - 64 = 42106−64=42, then 42−32=1042 - 32 = 1042−32=10. 16 does not fit. 10−8=210 - 8 = 210−8=2. 4 does not fit. 2−2=02 - 2 = 02−2=0. 1 does not fit.

Step 4. Write the bits. The 1s are under 1024, 512, 256, 128, 64, 32, 8 and 2. In 16 bits: 0000011111101010.

Step 5. The largest count. All sixteen bits set to 1 give 65536−1=6553565536 - 1 = 6553565536−1=65535.

Step 6. Eight bits. 8 bits hold at most 255. 2026 is much larger, so the count would overflow.

Check. 1024+512+256+128+64+32+8+2=20261024 + 512 + 256 + 128 + 64 + 32 + 8 + 2 = 20261024+512+256+128+64+32+8+2=2026.

Answer: (a) 0000011111101010. (b) 65535. (c) No: 8 bits can hold only 0 to 255.

Log in to save this for later
← All Problems
← A school scoreboard shows each score with eight lamps in a row…A web designer picks a green colour with the code 2E8B57… →
More onComputer Science › Data Representation

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. A student must compress two files. File A is a text file holding the 7 characters ABCDEFG, one byte…Hard
  2. A line of an icon is stored with run-length encoding as these pairs of (count, colour code): (5…Medium
  3. One row of a scanned page is 13 pixels: 6 white, then 3 black, then 4 white…Easy
  4. An image is 800 pixels wide and 600 pixels high…Hard
  5. A camera takes photos of 2048 by 1536 pixels with a colour depth of 24 bits…Medium
All problems on this topic →