Information Retrieval

Computer Science Level pending

Chris is sending a string of length 14 consisting 7 1s and 7 0s to Agnishom. However, there was an error in the process. All the bits after a point is toggled (1 to 0 and vice versa). When Agnishom received the string, it looks like this :

1 1 0 1 1 0 0 1 1 1 0 0 1 0

How many bits can Agnishom confirm its value?

Details and Assumptions

  • There is one and only one error occurs.
  • Agnishom knows that initially there is 7 1s and 7 0s.
  • The string starts from left to right. If position \(p\) has an error, then bits in position \(p, p+1, p+2, ...\) are toggled.
×

Problem Loading...

Note Loading...

Set Loading...