I am trying to understand what this question is asking in terms of conversion. I know how to convert binary to decimal and vice versa, but the method you need to use has me confused.
I need to convert 010111 to decimal using only odd numbered positions while still applying the correct positional exponent in the conversion. What I did was take every odd numbered position from base 2 digit from 010111 so "111" I skipped every other number and took the digit from that position (if that makes sense) I only had three digits so I added a 0 to make it 4 bit 0111 which equals 7 in decimal. I know this is wrong but why??
This is the question: - Imagine that a processor is faulty and reads only odd-numbered positions when converting binary numbers to decimals, but it applies the correct positional exponent in the conversion. In radix 10, the binary number 010111 converted by this processor would be:
The mock test answer says the result is 2 but I cannot figure out why