edited by
374 views
0 votes
0 votes

$2$’s complement of $-100$ is:

  1. $00011100$
  2. $10011101$
  3. $10011100$
  4. $11100100$
edited by

1 Answer

0 votes
0 votes

C) 10011100 ...

 

The binary equivalent of 100 is 1100100 ..

 

(100)^10 in binary system 1100100 ...

 

Now two’s complement

= 1st complement + 1

= 0011011 + 1 ...

= 0011100 …

 

For (–100)^10 will be 10011100 …

 

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Mar 28, 2020
468 views
The following determiniotic finite automata recognizes:Set of all strings containing $’ab’$Set of all strings containing $’aab’$Set of all strings ending in $’a...
0 votes
0 votes
0 answers
2
go_editor asked Mar 28, 2020
687 views
Depth ion travels of the following directed graph is:$\text{A B C D E F}$$\text{A B D E F C}$$\text{A C E B D F}$None of the above
0 votes
0 votes
0 answers
3
go_editor asked Mar 28, 2020
1,120 views
The maximum number of nodes in a binary tree of depth $10$:$1024$ $2^{10}-1$ $1000$None of the above
1 votes
1 votes
1 answer
4
go_editor asked Mar 28, 2020
1,225 views
The regular expression given below describes:$r=(1+01)$*$(0+\lambda)$Set of all string not containing $’11’$Set of all string not containing $’00’$Set of all stri...