Professional Documents
Culture Documents
Org
GATE-Digital Logic-Number
System
Labels: GATE , GATE questions on Digital Logic
CS/IT
GATE-1999
1. Booth’s coding in 8 bits for the decimal number –57 is
(a) 0–100+1000
(b) 0–100+100-1
(c) 0–1+100–10+1
(d) 00–10+100-1
Note: When lsb b0= 1, assume that it had b-1 as 0, thus take b0 = –1
GATE-2000
2. The number 43 in 2's complement representation is
(a) 01010101
(b) 11010101
(c) 00101011
(d) 10101011
Ans: option(c)
Explanation:
If the number is positive: 2's complement numbers are represented as the simple binary.
Therefore 2's complement of 43 = 0010 1011
But if the question was to nd 2's complement of -43 then we should proceed as below.
To nd 2's complement rst nd the 1's complement and add 1 to the result
43 = 0010 1011
1's complement of 43 = 1101 0100 { To nd 1's complement: change the bit 1 to 0 and 0 to 1 }
2's complement of 43 = 1's complement of 43 + 1 = 11010100 +1 = 11010101
GATE-2002
Ans: option(d)
Explanation:
Binary representation of 15 = 1111
2's complement = 1's complement + 1 = 0000 + 1 = 0001
The 2's complement representation of the decimal value -15 = 10001.
GATE-2002
4. The decimal value 0.25
(a) is equivalent to binary 0.1
(b) is equivalent to binary 0.01
(c) is equivalent to binary 0.00111
(d) cannot be represented precisely in binary
GATE-2003
5. Assuming all numbers are in 2’s complement representation, which of the following numbers is
divisible by 1111 1011?
(a) 11100111
(b) 11100100
(c) 11010111
(d) 11011011
GATE-1997
6. Given √(224)r= (13)r
The value of the radix r is:
(a) 10 (b) 8 (c) 5 (d) 6
GATE-2004
7. Let A = 1111 1010 and B = 0000 1010 be two 8-bit 2's complement numbers. Their product in 2's
complement is
(a) 1100 0100
(b) 1001 1100
(c) 1010 0101
(d) 1101 0101
GATE-2001
8. The 2's complement representation of (-539)10 in hexadecimal is
(a) ABE (b) DBC (c) DE5 (d) 9E7
The most signi cant bit is 1 this means that the number is a negative number. To get the magnitude
of the number perform the 2's complement of the number and number thus came is 1925,
Hence P = -1925
8 x P = -15400
GATE-2013
10. The smallest integer that can be represented by an 8-bit number in 2’s complement form is
(a) -256 (b) -128 (c) -127 (d) 0
Hence the smallest integer that can be represented by an 8-bit number = -28-1 = -27 = -128
6 comments:
question no 2 is wrong here because they are asking 2's complement of +43 positive
number . so no need to convert to 2's complement . its direct binary conversion .so
option (c) is correct.
Reply
Replies
Reply
Reply
Thanks u sir... I was actually confused in that type of questions.. thanks a lot.
Reply
Qn 9. Can also be solved using the theory that multiplication/division in binary can
be done by right/left shifting.
Reply
Reply
LABELS
GATE (24) PHP (23) C Programming (13) Computer Networks (10) GATE questions on
DBMS (5) CakePHP (4) GATE questions on Computer Networks (4) TOC (4) GATE questions on Operating Systems
(3) GATE-Data Structures (3) TOC-Finite Automata (3) Digital Electronics (2) MySQL (2) Ajax (1) Algorithm (1) Formulas (1)
GATE questions on Digital Logic (1) Gate questions on C programming (1) Gate questions on WEB Technologies (1) Maths (1) Pointers (1)
Software Engineering (1) TOC-Regular Expressions (1) Time Complexity (1) Web Development (1) hybrid mobile app development (1) ionic
(1)