October 5, 2023

Digital-Logic-Design

Question 629 Simplified form of Boolean expression xy+(~x)z+yz is : A xy+(~x)z. B (~x)y+(~x)z. C (~x)y+xz. D xy+xz. Digital-Logic-DesignBoolean-ExpressionUGC NET CS 2007-Dec-Paper-2 Question 629 Explanation:  Correct […]
October 5, 2023

Number-Systems

Question 24 The 2’s complement representation of the decimal value -15 is A 1111 B 11111 C 111111 D 10001 Digital-Logic-DesignNumber-SystemsGATE 2002 Question 24 Explanation:  15 […]
October 6, 2023

UGC NET CS 2015 June Paper-3

Question 1 For the 8 – bit word 00111001, the check bits stored with it would be 0111. Suppose when the wo​rd is read from memory, […]
October 6, 2023

Digital-Logic-Design

Question 3 Using a 4-bit 2’s complement arithmetic, which of the following additions will result in an overflow? 1. 1100 +1100 2. 0011 +0111 3. 1111 +0111 A […]