Digital Electronics 6
Digital Electronics 6
Digital Electronics 6
Answer: b
Explanation: octal equivalent is obtained.
(1E.53)16 = (0001 1110.0101 0011)2
= (00011110.01010011)2
Now put additional zeros to extreme left and right in order to make the
Grouping of 3bits possible
= 000011110.01010010
= (011 110.010 100 110)2
= (36.246)8.
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.
18.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.
19.Octal to binary conversion: (24)8 =?
a) (111101)2
b) (010100)2
c) (111100)2
d) (101010)2
Answer: b
Explanation: Each digit of the octal number is expressed in terms of group of 3
bits. Thus, the binary equivalent of the octal number is obtained.
(24)8 = (010100)2
20.Convert binary to octal: (110110001010)2 =?
a) (5512)8
b) (6612)8
c) (4532)8
d) (6745)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.
21.. In boolean algebra, the OR operation is performed by which properties?
a) Associative properties
b) Commutative properties
c) Distributive properties
d) All of the Mentioned
Answer: d
25. A(A + B) = ?
a) AB
b) 1
c) (1 + AB)
d) A
Answer: d
Explanation: A(A + B) = AA + AB (By Distributive Property) = A + AB (A.A = A
By Commutative Property) = A(1 + B) = A*1 (1 + B = 1 by 1’s Property) = A.
26.DeMorgan’s theorem states that _________
a) (AB)’ = A’ + B’
b) (A + B)’ = A’ * B
c) A’ + B’ = A’B’
d) (AB)’ = A’ + B
Answer: a
Explanation: The DeMorgan’s law states that (AB)’ = A’ + B’ & (A + B)’ =
A’ * B’, as per the Dual Property.
27.(A + B)(A’ * B’) = ?
a) 1
b) 0
c) AB
d) AB’
Answer: b
Explanation: The DeMorgan’s law states that (AB)’ = A’ + B’ & (A + B)’ = A’ *
B’, as per the Dual Property.
28. of the expression A’B + CD’ is _________
a) (A’ + B)(C’ + D)
b) (A + B’)(C’ + D)
c) (A’ + B)(C’ + D)
d) (A + B’)(C + D’)
Answer: b
Explanation: (A’B + CD’)’ = (A’B)'(CD’)’ (By DeMorgan’s Theorem) = (A” + B’)
(C’ + D”) (By DeMorgan’s Theorem) = (A + B’)(C’ + D).
29. Simplify Y = AB’ + (A’ + B)C.
a) AB’ + C
b) AB + AC
c) A’B + AC’
d) AB + A
Answer: a
Explanation: Y = AB’ + (A’ + B)C = AB’ + (AB’)’
= (AB’ + C)( AB’ + AB’) = (AB’ + C).1
= (AB’ + C).
30. The boolean function A + BC is a reduced form of ____________
a) AB + BC
b) (A + B)(A + C)
c) A’B + AB’C
d) (A + C)B
Answer: b
Explanation: (A + B)(A + C) = AA + AC + AB + BC = A + AC + AB + BC (By
Commutative Property) = A(1 + C + B) + BC = A + BC (1 + B + C =1 By 1’s
Property).
31. A single transistor can be used to build which of the following digital logic
gates?
a) AND gates
b) OR gates
c) NOT gates
d) NAND gates
Answer: c
32.How many truth table entries are necessary for a four-input circuit?
a) 4
b) 8
c) 12
d) 16
Answer: d
Explanation: For 4 inputs: 24 = 16 truth table entries are necessary.
33.Which input values will cause an AND logic gate to produce a HIGH output?
a) At least one input is HIGH
b) At least one input is LOW
c) All inputs are HIGH
d) All inputs are LOW
Answer: c
34.The basic logic gate whose output is the complement of the input is the
___________
a) OR gate
b) AND gate
c) INVERTER gate
d) XOR gate
Answer: c
19
12
27
21
Answer : 4
1. NAND gate
2. OR gate
3. AND gate
4. None of the above
Answer : 1
1. NOT gate
2. OR gate
3. AND gate
4. None of the above
Answer : 1
38. The inputs of a NAND gate are connected together. The resulting circuit is
………….
1. OR gate
2. AND gate
3. NOT gate
4. None of the above
Answer : 3
1. AND gate
2. NAND gate
3. NOT gate
4. None of the above
Answer : 3
1. NOT gate
2. OR gate
3. AND gate
4. None of the above
Answer : 1
1. OR gates
2. NOT gates
3. NAND gates
4. None of the above
Answer : 3
1. Stop signal
2. Invert input signal
3. Act as a universal gate
4. None of the above
Answer : 2
43. When an input signal 1 is applied to a NOT gate, the output is ………………
a. 0
b. 1
c. Either 0 & 1
d. None of the above
Answer : a
1. OR operation
2. AND operation
3. NOT operation
4. None of the above
Answer : 3
45. An OR gate has 4 inputs. One input is high and the other three are low. The
output is …….
1. Low
2. High
3. alternately high and low
4. may be high or low depending on relative magnitude of inputs
Answer : 2
1. 1110
2. 1010
3. 1001
4. 1000
Answer : 2
Explanation: 1010 = 8 + 2 = 10 in decimal.
1. True
2. False
Answer : 2
48. For the gate in the given figure the output will be ………..
1)0
2)1
3) A
4)Ā
Answer : 4
A. 8
B. 7
C. 9
D. 10
Answer : A
50. The circuit of the given figure realizes the function …………
Answer : 1
Explanation:
51. Q1: The following truth table corresponds to the logic gate
Input Output
A B X
0 0 0
0 1 1
1 1 1
1 0 1
A. NAND
B. OR
C. AND
D. XOR
Answer: (b) OR
52: Boolean Algebra is essentially based on
A. Truth
B. Logic
C. Symbol
D. Numbers
Answer: (a) HIgh output when both the inputs are low
54: A logic gate is an electronic circuit which
A. 1
B. 2
C. 3
D. 4
Answer: (b) 2
56: Which logic gate is represented by the following combination of logic gates?
a. OR
b. NAND
c. AND
d. NOR
a. OR
b. NOT
c. AND
d. NOR
a. NAND gate
b. Inverter
c. NOR gate
d. AND gate