Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A programmer is looking for a fault. One memory location holds the 16 bits 0110111110100011. The fault report lists the contents in hexadecimal.
Hexadecimal is base 16, with the digits 0 to 9 and A to F (10 to 15). One hex digit is one nibble of four bits, so a byte is two hex digits. Binary to hex: split into nibbles from the right and write each one as a digit. Hex to denary: the place values are 4096, 256, 16 and 1.
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. The 16 bits 0110111110100011.
Plan. Group into nibbles, write each as a hex digit, then use the hex place values.
Step 1. Nibbles. 0110 1111 1010 0011.
Step 2. Each nibble. 0110 is 6, 1111 is 15 (F), 1010 is 10 (A) and 0011 is 3. So the hex is 6FA3.
Step 3. Denary. .
Check. The MSB of the 16 bits is 0, so the value must be less than 32768. It is.
Answer: (a) 6FA3. (b) 28579.
Log in to join the discussion.
Loading…