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. /In a parallel cable, the slowest wire falls behind the fastest one by 0.25 ns for every metre of…
HardComputer ScienceHigh School (9–10)Computer Science › Data TransmissionNumericalConceptualIGCSE

In a parallel cable, the slowest wire falls behind the fastest one by 0.25 ns for every metre of…

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.

In a parallel cable, the slowest wire falls behind the fastest one by 0.25 ns0.25\ \text{ns}0.25 ns for every metre of cable. Each bit lasts 2 ns2\ \text{ns}2 ns. An engineer says the bits stay in step only while the gap is less than half the time of one bit.

  1. What is half the time of one bit?
  1. What is the longest cable that keeps the bits in step?
  1. The bit rate is doubled, so each bit lasts half as long. What happens to the longest safe cable? What does this tell you about fast parallel links?

Check your answer

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

ns
m
m
Need a reminder? The key ideaShowHide

Serial sends one bit at a time on one wire: cheap, no skew, reliable over long distances. Parallel sends several bits at once on several wires: faster over short distances, but skew makes it unreliable over long ones. Simplex is one direction only, half-duplex is both directions one at a time, full-duplex is both directions at once. The ideal time is t=bitsbits per secondt = \dfrac{\text{bits}}{\text{bits per second}}t=bits per secondbits​.

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.

Step 1. The allowed gap. Half of 2 ns2\ \text{ns}2 ns is 1 ns1\ \text{ns}1 ns.

Step 2. The longest cable. Each metre adds 0.25 ns0.25\ \text{ns}0.25 ns. So the longest cable is 1÷0.25=4 m1 \div 0.25 = 4\ \text{m}1÷0.25=4 m.

Step 3. Double the rate. Each bit now lasts 1 ns1\ \text{ns}1 ns, so the allowed gap is 0.5 ns0.5\ \text{ns}0.5 ns. The longest cable is 0.5÷0.25=2 m0.5 \div 0.25 = 2\ \text{m}0.5÷0.25=2 m.

Step 4. The lesson. The faster the bits, the shorter a parallel cable must be. This is why fast links over any real distance are serial. The exam does not ask for this calculation, but it does ask you to explain skew.

Answer: (a) 1 ns1\ \text{ns}1 ns. (b) 4 m4\ \text{m}4 m. (c) It halves to 2 m2\ \text{m}2 m; fast parallel links only work over very short distances.

Log in to save this for later
← All Problems
← A file of 6 000 000 bits must be sent. Each wire carries 3 million bits per second…Two computers, P and Q, must each send 3 messages to the other… →
More onComputer Science › Data Transmission

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. A sender uses an automatic repeat query to send 8 packets, one at a time…Hard
  2. The valid book number 9781861978769 is typed into a library system, but the 7th and 8th digits are…Medium
  3. A library adds a new book. The first twelve digits of its 13-digit ISBN are 978186197876…Easy
  4. A computer sends the byte 01001101 to a device using an echo check…Easy
  5. The block of bytes 87, 142, 203 and 61 is sent with its checksum, worked out as the total bmod 256…Hard
All problems on this topic →