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

a. Step $1 :$ To convert the base ten representations to its equivalent binary representations, divide the number by 2 until the quotient is zero as shown in the table below: $\begin{array}{|c|c|c|}\hline \text { remainder } & {\text { divide the number by 2 }} & {\text { number }} \\ \hline 0 & {2} & {6} \\ \hline 1 & {2} & {3} \\ \hline 1 & {2} & {1} \\ \hline & {2} & {0} \\ \hline\end{array}$ Step $2 :$ Therefore, the binary representation is the sequence of the remainder from bottom to the top. Step $3 :$ (0 * 8) + (1 * 4) + (0 * 2) + (1 * 1) = 0 + 4 + 0 + 1 = 5 Therefore, $(6)_{10}=(110)_{2}$ ---- to solve [ b, c, d, e, f ] do the previous steps : b. the solution is: 1101 c. the solution is: 1011 d. the solution is: 10010 e. the solution is: 11011 f. the solution is: 100