Step 1: Divide 1111 by 2. Use the integer quotient obtained in this step as the dividend for the next step. Repeat the process until the quotient becomes 0.
Step 2: Write the remainder from bottom to top i.e. in the reverse chronological order. This will give the binary equivalent of 1111.
Therefore, the binary equivalent of decimal number 1111 is 10001010111.
Answers & Comments
Verified answer
Answer:
Concept:
The binary representation of a decimal number b3 b2 b1 b0 is given by:
Decimal = (b3) × 23 + (b2 ) × 22 + (b1 ) × 21 + (b0 ) × 20
Application:
Given binary number (1111)2
Converting binary into decimal, we can write:
(1111)2 = 1 × 23 + 1 × 22 + 1 × 21 + 1 × 20
(1111)2 = 8 + 4 + 2 + 1
(11111)2 = 15
Answer:
Step 1: Divide 1111 by 2. Use the integer quotient obtained in this step as the dividend for the next step. Repeat the process until the quotient becomes 0.
Step 2: Write the remainder from bottom to top i.e. in the reverse chronological order. This will give the binary equivalent of 1111.
Therefore, the binary equivalent of decimal number 1111 is 10001010111.
Explanation:
hope it helps u dear ✨❣️✨❣️