## Computer Science: An Overview: Global Edition (12th Edition)

a. Step $1 :$ To convert the binary representations to its equivalent base ten representations, multiply every bit of the binary representation to the power of two from right to left, start at 2^0. Step $2 :$ Represent the number in terms of its positions. $\left(0 * 2^{3}\right)+\left(1 * 2^{2}\right)+\left(0^{*} 2^{1}\right)+\left(1 * 2^{0}\right)$ Step $3 :$ (0 * 8) + (1 * 4) + (0 * 2) + (1 * 1) = 0 + 4 + 0 + 1 = 5 Therefore, $(0101)_{2}=(5)_{10}$ ---- to solve [ b, c, d, e, f ] do the previous steps : b. the solution is: 9 c. the solution is: 11 d. the solution is: 6 e. the solution is: 16 f. the solution is: 18