3 replies to this topic

[nomss]

I have to calculate the maximum block in a binary number.
For ex:
Binary representation = 11111
Maximum block length = 5

Binary representation = 10111011
Maximum block length = 3

Above are the only 2 examples my professor gave.
"Compute the maximum block length of the binary
representation." This is what he said. I'm assuming this includes 0s as well. I really don't know how to go about it.

[gregwarner]

The way I would do this is to set up a loop that examines one bit at the end at a time, and compares it with the value of the last bit from the previous operation. If it's a match, it increments a counter variable to keep track of how many similar bits it's encountered. If it's not a match, it checks the counter variable to see if you've reached a new maximum (another variable is needed to retain the current maximum) and then resets the counter to 1. After the comparison, you can perform a bitwise shift to push the examined bit off the end so the loop will examine the next bit in line. This entire loop will need to be constrained from the start to only run for as many times as there are bits in your input.

Another option is instead of using a bitwise shift to read the next bit, you could alternatively use a placeholder variable to mark which bit is currently being examined, and increment the placeholder each time. It's your choice. Either would work.

[nomss]

I'd like more clarification please.

[fayyazlodhi]

Please take a look at this tutorial. Though it solves a different problem. But still it has the CODE and certain aspects common from the approach gregwarner has described above. You basically need to modify this code according to the approach he explained.

http://forum.codecal...ts-integer.html