Question 91

Computer Awareness Boolean algebra Easy

The \( 2^s \)complement representation of the number \( (-100)_{10} \);in an 8 bit computer is

(A) 10011011
(B) 01100100
(C) 11100100
(D) 10011100
✓ Correct Answer: Option D Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

Let's walk through the correct process:

Conversion of \( (-100)_{10} \) to binary using 2's complement:

1. Convert \( 100_{10} \) to binary: \[ 100_{10} = 1100100_2 \]

2. Pad the binary representation to 8 bits: \[ 100_{10} = 01100100_2 \quad \text{(8 bits)} \]

3. Find the 1's complement of \( 01100100_2 \): \[ 10011011_2 \quad \text{(invert all bits)} \]

4. Find the 2's complement by adding 1 to the 1's complement: \[ 10011011_2 + 1 = 10011100_2 \]

Thus, the 2's complement representation of \( (-100)_{10} \) in an 8-bit system is 10011100. ### Correct Answer: \[ \textbf{D. 10011100} \]

Practice Similar Boolean algebra Questions

Reinforce your conceptual grasp with related questions from NIMCET 2016:

Q92 The number of terms in the product-of-sum canonical form of 
Solve →
Q95

Consider the following min term expression for F.

Solve →
Q97 Subtract (1010)2 from (1101)2 using first...
Solve →
Q99 The Boolean expression represented by the following Venn diagram is: a b
Solve →
Q93 Find the odd man out:
Solve →
Full-Length Test Series

Prepare for NIMCET Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →