Register

UGC NET CSE | June 2013 | Part 2 | Question: 43

4,064 views

2 Answers

3 votes
3 votes
number is  in 2's complement form and sign bit is 1 so it is a negative number and to find original number find its 2'complement

as below

1101010  its one's complement 1010101 add 1 to LSB =1010110 =-22 (note sign bit remain unchanged in complementing)

hence ans is B
• edited by
User Avatar
2 votes
2 votes

$2's\ complement \frac{\begin{matrix} &1 &1 &0 & 1&0&1&0\\\end{matrix}}{\begin{matrix}1&0 & 1 &0 &1&1&0 \end{matrix}}$

and  1 0 1 0 1 1 0    =   - 22

       $\uparrow$

negetive sign bit  

Hence,Option(B)-22.

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
go_editor asked Jul 14, 2016
2,262 views
UGC NET CSE | June 2013 | Part 2 | Question: 45
When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as handoff mobile switching mobile routing cell switching
When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known ashand...
User Avatar
2 votes
2 votes
1 answer
2
go_editor asked Jul 13, 2016
755 views
UGC NET CSE | June 2013 | Part 2 | Question: 5
Cyclometric complexity of a flow graph G with n vertices and e edges is V(G) = e+n-2 V(G) = e-n+2 V(G) = e+n+2 V(G) = e-n-2
Cyclometric complexity of a flow graph G with n vertices and e edges isV(G) = e+n-2V(G) = e-n+2V(G) = e+n+2V(G) = e-n-2
User Avatar
3 votes
3 votes
3 answers
3
shivani2010 asked Jun 12, 2016
4,639 views
UGC NET CSE | June 2013 | Part 2 | Question: 37
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
Which of the following connected graph has exactly one spanning tree? Complete graph Hamiltonian graph Euler graph None of the above
User Avatar
2 votes
2 votes
1 answer
4
Sanjay Sharma asked May 7, 2016
3,607 views
UGC NET CSE | June 2013 | Part 2 | Question: 38
How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? M+N-C M-N-C M-N+C M+N+C
How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?M+N-CM-N-CM-N+CM+N+C
User Avatar
Link Copied!