CalulationProblem1
CalulationProblem1
............................................................................................................................................. [1]
Working space
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [2]
Working space
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
(c) A logical left shift of three places is performed on the binary number.
(i) Give the 8-bit binary number that would be stored after this logical left shift.
..................................................................................................................................... [1]
(ii) Tick (3) one box to show which statement is true about the impact the logical left binary
shift would have on the binary number.
(d) Add the two 8-bit binary numbers 11101110 and 00110001 using binary addition.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
............................................................................................................................................. [4]
Calculate the least number of bits that can be used to store the denary number 301.
............................................................................................................................................. [1]
Working space
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
Calculate the least number of bits that can be used to store the hexadecimal number A4D.
............................................................................................................................................. [1]
Working space
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................