retagged by
4,788 views
1 votes
1 votes
 

Two 2's complement number having sign bits X and Y are added and the sign bit of the result is Z. then, the occurrence of overflow is indicated by the Boolean function.

A. XYZ
B. X Y Z
C. X YZ + XY Z
D. XY + YZ + ZX
retagged by

1 Answer

3 votes
3 votes
Here ..we can think like that when we adds two -ve sign numbers ans must be sign num and when adds two +be sign numbers ans must be +ve  only...

That is x=1 and y=1 same sign -ve  when adds result must be or z must be 1 only... But z is 0 than overflow..

x =0 and y=0 than z must be 0...

So xyz' + x'y'z is the right option...

Related questions

2 votes
2 votes
1 answer
1
pC asked Aug 14, 2016
3,974 views
How many minterms (excluding redundant terms) does the minimal switching functionf (v,w, x, y, z) = x + ȳ z originally have?a. 16b. 20c. 24d. 32
22 votes
22 votes
3 answers
2
Kathleen asked Sep 25, 2014
9,135 views
Which of the following operations is commutative but not associative?ANDORNANDEXOR
42 votes
42 votes
4 answers
3
Kathleen asked Sep 25, 2014
10,126 views
What happens when a bit-string is XORed with itself $n$-times as shown:$\left[B \oplus (B \oplus ( B \oplus (B \dots n \text{ times}\right]$complements when $n$ is evenco...
4 votes
4 votes
6 answers
4
aditi19 asked Dec 4, 2018
2,521 views
Above question modification.This is the actual questionBoolean expression$:(x+y)(x+\bar{y})+\overline{{(x\bar{y}+\bar{x})}}$$(A) x$ $(B)y$ $(C)xy$...