in question they have asked for 2's complement in solution they have solved for sum of bits..? ambiguity?

The Gateway to Computer Science Excellence

0 votes

2’s complement representation of the number $(-89)_{10}$ is

- 7
- 5
- 4
- 3

I don’t understand their solution. Please help.

0

in question they have asked for 2's complement in solution they have solved for sum of bits..? ambiguity?

0

I'm not getting the question correctly.But some of the case i can give.

1.Number of bits to represent.

$-2^{n-1} \geq -89 $

$2^{n-1} \geq 2^{7} $

n = 8 bits.

2.2's complement of the -89.

10100111 .

Sum of bits = 1 + 0 + 1 + 0 +0+ 1+1+1 => 5.

Number of bits = 8.

1.Number of bits to represent.

$-2^{n-1} \geq -89 $

$2^{n-1} \geq 2^{7} $

n = 8 bits.

2.2's complement of the -89.

10100111 .

Sum of bits = 1 + 0 + 1 + 0 +0+ 1+1+1 => 5.

Number of bits = 8.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,378 answers

198,523 comments

105,317 users