Digital Electronics Question Topic 1
Digital Electronics Question Topic 1
Digital Electronics Question Topic 1
Topic 1
Number System – 1
Number System – 2
Arithmetic Operation
1’s, 2’s, 9’s & 10’s Complements – 1
Binary Coded Decimal(BCD)
[email protected]
Manjunadha (ECE) ph.no: 7207534529
2
3. If the decimal number is a fraction then its binary equivalent is obtained by ________ the
number continuously by 2.
a) Dividing
b) Multiplying
c) Adding
d) Subtracting
Answer: b
Explanation: On multiplying the decimal number continuously by 2, the binary equivalent
is obtained by the collection of the integer part. However, if it’s an integer, then it’s binary
equivalent is determined by dividing the number by 2 and collecting the remainders.
4. The representation of octal number (532.2)8 in decimal is ________
a) (346.25)10
[email protected]
Manjunadha (ECE) ph.no: 7207534529
3
b) (532.864)10
c) (340.67)10
d) (531.668)10
Answer: a
Explanation: Octal to Decimal conversion is obtained by multiplying 8 to the power of
base index along with the value at that index position.
(532.2)8 = 5 * 82 + 3 * 81 + 2 * 80 + 2 * 8-1 = (346.25)10
Number System – 2
1.The given hexadecimal number (1E.53)16 is equivalent to ____________
a) (35.684)8
b) (36.246)8
c) (34.340)8
d) (35.599)8
Answer: b
[email protected]
Manjunadha (ECE) ph.no: 7207534529
5
Explanation: First, the hexadecimal number is converted to it’s equivalent binary form, by
writing the binary equivalent of each digit in form of 4 bits. Then, the binary equivalent
bits are grouped in terms of 3 bits and then for each of the 3-bits, the respective digit is
written. Thus, the octal equivalent is obtained.
(1E.53)16 = (0001 1110.0101 0011)2
= (00011110.01010011)2
= (011110.010100110)2
= (011 110.010 100 110)2
= (36.246)8.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
6
Answer: b
Explanation: Converting decimal fraction into octal number is achieved by multiplying the
fraction part by 8 everytime and collecting the integer part of the result, unless the result
is 1.
0.345*8 = 2.76 2
0.760*8 = 6.08 6
00.08*8 = 0.64 0
0.640*8 = 5.12 5
0.120*8 = 0.96 0
So, (0.345)10 = (0.26050)8.
8. Convert the binary number (01011.1011)2 into decimal.
a) (11.6875)10
b) (11.5874)10
c) (10.9876)10
d) (10.7893)10
Answer: a
Explanation: Binary to Decimal conversion is obtained by multiplying 2 to the power of
base index along with the value at that index position.
(01011)2 = 0 * 24 + 1 * 23 + 0 * 22 + 1 * 21 + 1 * 20 = 11
(1011)2 = 1 * 2-1 + 0 * 2-2 + 1 * 2-3 + 1 * 2-4 = 0.6875
So, (01011.1011)2 = (11.6875)10.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
8
Answer: b
Explanation: The binary equivalent is segregated into groups of 3 bits, starting from left.
And then for each group, the respective digit is written. Thus, the octal equivalent is
obtained.
(110110001010)2 = (6612)8.
Arithmetic Operation
1. What is the addition of the binary numbers 11011011010 and 010100101?
a) 0111001000
b) 1100110110
c) 11101111111
d) 10011010011
Answer: c
Explanation: The rules for Binary Addition are :
0+0=0
0+1=1
1+0=1
1 + 1 = 0 ( Carry 1)
1
11011011010
+00010100101
_______________________
11101111111
_______________________
[email protected]
Manjunadha (ECE) ph.no: 7207534529
9
1+0=1
1 + 1 = 0 ( Carry 1)
111111
101101
+011011
_______________
1001000
_______________
Therefore, the addition of 101101 + 011011 = 1001000.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
10
Answer: a
Explanation: The rules for Binary Subtraction are :
0–0=0
0 – 1 = 1 ( Borrow 1)
1–0=1
1–1=0
100101
-011110
___________
000111
___________
Therefore, The subtraction of 100101 – 011110 = 000111.
5. Perform multiplication of the binary numbers: 01001 × 01011 = ?
a) 001100011
b) 110011100
c) 010100110
d) 101010111
Answer: a
Explanation: The rules for binary multiplication are:
0*0=0
0*1=0
1*0=0
1*1=1
01001
x01011
____________
01001
010010
0000000
01001000
000000000
[email protected]
Manjunadha (ECE) ph.no: 7207534529
11
___________________
001100011
___________________
Therefore, 01001 × 01011 = 001100011.
6. 100101 × 0110 = ?
a) 1011001111
b) 0100110011
c) 101111110
d) 011011110
Answer: d
Explanation: The rules for binary multiplication are:
0*0=0
0*1=0
1*0=0
1*1=1
100101
x 0110
___________
000000
1001010
10010100
000000000
__________________
011011110
___________________
Therefore, 100101 x 0110 = 011011110.
Answer: c
Explanation: The rules for binary multiplication are:
0*0=0
0*1=0
1*0=0
1*1=1
1 0.1 0
x 0 1.0 1
__________
1010
00000
101000
0000000
_______________
0 1 1.0 0 1 0
_________________
Therefore, 10.10 x 01.01 = 011.0010.
8. Divide the binary numbers: 111101 ÷ 1001 and find the remainder.
a) 0010
b) 1010
c) 1100
d) 0111
Answer: d
Explanation: Binary Division is accomplished using long division method.
1001)111101(11
1001
__________
01100
1001
___________
[email protected]
Manjunadha (ECE) ph.no: 7207534529
13
0111
Therefore, the remainder of 111101 ÷ 1001 = 0111.
9. Divide the binary number (011010000) by (0101) and find the quotient.
a) 100011
b) 101001
c) 110010
d) 010001
Answer: b
Explanation:
0101)011010000(010111
0000
_____________________
01101
00101
______________
010000
000000
______________________
10000
00101
____________________
010110
000101
____________________
100010
000101
________________________
111010
[email protected]
Manjunadha (ECE) ph.no: 7207534529
14
000101
________________________
10101
00101
________________________
10000
Therefore, the quotient of 011010000 ÷ 1001 = 101001.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
15
Answer: c
Explanation: 1’s complement of a binary number is obtained by reversing the binary bits.
All the 1’s to 0’s and 0’s to 1’s.
Thus, 1’s complement of 1011101 = 0100010.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
17
_________________
Minuend - 101001
2’s complement of subtrahend - 110100
_________________
Carry over - 1 011101
Answer: 011101
[email protected]
Manjunadha (ECE) ph.no: 7207534529
18
_________________
1 0010010
Answer: 0 1 0 0 1 0
[email protected]
Manjunadha (ECE) ph.no: 7207534529
19
10. On subtracting +28 from +29 using 2’s complement, we get ____________
a) 11111010
b) 111111001
c) 100001
d) 1
Answer: d
Explanation: Steps For Subtraction using 2’s complement are:
-> 2’s complement of the subtrahend is determined and added to the minuend.
-> If the result has a carry, then it is dropped and the result is positive.
-> Else, if there is no carry, then 2’s complement of the result is found out and a ‘-’ sign
preceeds the result.
1’s complement of subtrahend - 100011
Minuend - 011101
2’s complement of subtrahend - 100100
____________________
Carry over - 1 0 0 0 0 0 1
Answer: 000001 = 1
[email protected]
Manjunadha (ECE) ph.no: 7207534529
20
11. On subtracting +28 from +29 using 2’s complement, we get ____________
a) 11111010
b) 111111001
c) 100001
d) 1
Answer: d
Explanation: Steps For Subtraction using 2’s complement are:
-> 2’s complement of the subtrahend is determined and added to the minuend.
-> If the result has a carry, then it is dropped and the result is positive.
-> Else, if there is no carry, then 2’s complement of the result is found out and a ‘-’ sign
preceeds the result.
1’s complement of subtrahend - 100011
Minuend - 011101
2’s complement of subtrahend - 100100
____________________
Carry over - 1 0 0 0 0 0 1
Answer: 000001 = 1
12. If the number of bits in the sum exceeds the number of bits in each added numbers, it
results in _________
a) Successor
b) Overflow
c) Underflow
d) Predecessor
Answer: c
Explanation: If the number of bits in the sum exceeds the number of bits in each added
numbers, it results in overflow and is also known as excess-one. In case of any arithmetic
operation, if the result has less number of bits than the operands, then it is known as
underflow condition.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
21
Answer: b
Explanation: An overflow is a software problem which occurs when the processor cannot
handle the result properly when it produces an out of the range output.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
22
Answer: a
Explanation: The advantage of 2’s complement is that only one arithmetic operation is
required for 2’s complement’s operation and that is only addition. Just by adding a 1 bit to
1’s complement, we get 2’s complement.
20. The addition of +19 and +43 results as _________ in 2’s complement system.
a) 11001010
b) 101011010
c) 00101010
d) 111110
Answer: d
Explanation: The decimal numbers are converted to their respective binary equivalent and
then the binary addition rules are applied.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
23
4. Carry out BCD subtraction for (68) – (61) using 10’s complement method.
a) 00000111
b) 01110000
c) 100000111
d) 011111000
Answer: a
Explanation: First the two numbers are converted into their respective BCD form using
8421 sequence. Then binary subtraction is carried out.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
24
6. When numbers, letters or words are represented by a special group of symbols, this
process is called __________
a) Decoding
b) Encoding
c) Digitizing
d) Inverting
Answer: b
Explanation: When numbers, letters or words are represented by a special group of
symbols, this process is called encoding. Encoding in the sense of fetching the codes or
words in a computer. It is done to secure the transmission of information.
7. A three digit decimal number requires ________ for representation in the conventional
BCD format.
a) 3 bits
b) 6 bits
c) 12 bits
d) 24 bits
Answer: c
Explanation: The number of bits needed to represent a given decimal number is always
greater than the number of bits required for a straight binary encoding of the same.
Hence, a three digit decimal number requires 12 bits for representation in BCD format.
8. How many bits would be required to encode decimal numbers 0 to 9999 in straight binary
codes?
a) 12
b) 14
c) 16
d) 18
[email protected]
Manjunadha (ECE) ph.no: 7207534529
25
Answer: b
Explanation: Total number of decimals to be represented = 10000 = 104 = 2n (where n is
the number of bits required) = 213.29. Therefore, the number of bits required for straight
binary encoding = 14.
[email protected]
Manjunadha (ECE) ph.no: 7207534529
26
Answer:
a. Bit: Binary digit (Either logic-1 or logic-0) b. Nibble: 4-bits together is called a nibble c.
Byte: 8 bits or 2 nibbles d. Word: 16 bits or 2 bytes.
5. A number N has ‘n’ digits in a r-radix number system. What is its (r-1)’s complement and
r’s complement?
Answer:
(𝒓𝒏 – 1)-N , ( 𝒓𝒏 – N)
6. Represent 45 in the number systems (a) binary (b) BCD (c) Excess-3
Answer:
(a) 101101 (b) To get BCD: Represent each digit separately in binary 0100 0101 (c) Excess-
3: Add 3 to each digit and then represent them separately in binary 0111 1000.
7. What are all the BCD numbers that can be uniquely represented in 2-4-2-1 weighted
code?
Answer:
0, 1, 8 and 9 (Only these 4 numbers will have unique representations).
[email protected]
Manjunadha (ECE) ph.no: 7207534529