retagged by
596 views

1 Answer

6 votes
6 votes
$-1$ in Twos complement is $1$.

$1$ in Twos complement is $01$.

With $n-bits$, we can represent $-2^{n-1}$ to $2^{n-1} -1 $ numbers in Twos complement number system.
Answer:

Related questions

1.0k
views
2 answers
9 votes
GO Classes asked Jan 28
1,034 views
Suppose we use $\textsf{IEEE-754}$ single precision floating point format to represent the numbers in binary. What will be the hexadecimal representation ... $\textsf{0x80000008}$\textsf{0x80000010}$\textsf{0x80000002}$
528
views
1 answers
5 votes
GO Classes asked Jan 28
528 views
Your code is required to perform the function $(\text{M}\%16) \ast 3.$ What should you do to eliminate multiplication ($\ast$) and mod($\%$ ... the result, shift result left by $2,$ and add the saved result to current result.
443
views
1 answers
4 votes
GO Classes asked Jan 28
443 views
A garage door opens if it ever sees the password $011$ in a transmission. More formally, this FSM takes a bitstring consisting of $\text{0's}$ and $\text{1's}$ as its input, and ... $3 - (1/0)$Arrow $4 - (1/0)$Arrow $5 - (1/1)$
470
views
1 answers
4 votes
GO Classes asked Jan 28
470 views
The figure below represents the Karnaugh map for a function $\text{F(A,B,C,D).}$ Note, $\text{ X'}$ stands for don't care.The simplified ... can be converted into a circuit implementation using only NAND gates, which is shown in:abcd