The Student Room Group

Pseudocode exam-style question help

Could someone please help me answer this question in Pseudocode, please.

Write an algorithm to convert an 8-bit binary number into a denary number. You can assume that the binary number is correctly formatted as 1s and 0s and has the correct number of digits so that validation is not required. Use pseudo-code.

My answer:

binary = 01101101 # a random binary number I made up (didn't know if you had to get an input or make up the number?)
FOR i IN LENGTH(binary) THEN
number1 = 128*i[0]
number2 = 64*i[1]
number3 = 32*i[2]
number4 = 16*i[3]
number5 = 8*i[4]
number6 = 4*i[5]
number7 = 2*i[6]
number8 = 1*i[7]
denary = number1 + number2 + number3 + number4 + number5 + number6 + number7 + number8
SEND denary TO DISPLAY

I think my answer is correct, but it's not really efficient so would like some help on how to improve my answer or a whole different and more efficient way of answering the question.
denary = 0binary = 01101010FOR i in length(binary)denary = (2^(binary - 1 - i) * binarySEND denary to DISPLAY

Quick Reply

Latest