CIPHER ACADEMY –LBS MCA ENTRANCE

DIGITAL ELECTRONICS- NUMBER SYSTEM

1. Any signed negative binary number is recognised by its ________

a) MSB
b) LSB
c) Byte
d) Nibble

2. The parameter through which 16 distinct values can be represented is known as

________
a) Bit
b) Byte
c) Word
d) Nibble

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

4. The representation of octal number (532.2)8 in decimal is ________

a) (346.25)10
b) (532.864)10
c) (340.67)10
d) (531.668)10

5. The decimal equivalent of the binary number (1011.011)2 is ________

a) (11.375)10
b) (10.123)10
c) (11.175)10
d) (9.23)10

6. An important drawback of binary system is ________

a) It requires very large string of 1’s and 0’s to represent a decimal number
b) It requires sparingly small string of 1’s and 0’s to represent a decimal number
c) It requires large string of 1’s and small string of 0’s to represent a decimal number
d) It requires small string of 1’s and large string of 0’s to represent a decimal number

7. The decimal equivalent of the octal number (645)8 is ______

a) (450)10
b) (451)10
c) (421)10

Cipher: 7558956002
d) (501)10

8. The largest two digit hexadecimal number is ________

a) (FE)16
b) (FD)16
c) (FF)16
d) (EF)16

9. Representation of hexadecimal number (6DE)H in decimal:

a) 6 * 162 + 13 * 161 + 14 * 160
b) 6 * 162 + 12 * 161 + 13 * 160
c) 6 * 162 + 11 * 161 + 14 * 160
d) 6 * 162 + 14 * 161 + 15 * 160

10. The quantity of double word is ________

a) 16 bits
b) 32 bits
c) 4 bits
d) 8 bits

11. 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

12. The octal number (651.124)8 is equivalent to ______

a) (1A9.2A)16
b) (1B0.10)16
c) (1A8.A3)16
d) (1B0.B0)16

13. The octal equivalent of the decimal number (417)10 is _____

a) (641)8
b) (619)8
c) (640)8
d) (598)8

14. Convert the hexadecimal number (1E2)16 to decimal.

a) 480
b) 483
c) 482
d) 484

15. (170)10 is equivalent to ____________

a) (FD)16

Cipher: 7558956002
b) (DF)16
c) (AA)16
d) (AF)16

16. Convert (214)8 into decimal.

a) (140)10
b) (141)10
c) (142)10
d) (130)10

17. Convert (0.345)10 into an octal number.

a) (0.16050)8
b) (0.26050)8
c) (0.19450)8
d) (0.24040)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

19. Octal to binary conversion: (24)8 =?

a) (111101)2
b) (010100)2
c) (111100)2
d) (101010)2

20. Convert binary to octal: (110110001010)2 =?

a) (5512)8
b) (6612)8
c) (4532)8
d) (6745)8

21. Binary coded decimal is a combination of __________

a) Two binary digits
b) Three binary digits
c) Four binary digits
d) Five binary digits

22. The decimal number 10 is represented in its BCD form as __________

a) 10100000
b) 01010111
c) 00010000
d) 00101011

Cipher: 7558956002
23. Add the two BCD numbers: 1001 + 0100 = ?
a) 10101111
b) 01010000
c) 00010011
d) 00101011

24.

25. Code is a symbolic representation of __________ information.

a) Continuous
b) Discrete
c) Analog
d) Both continuous and discrete

26. 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

27. 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

28.

29. The excess-3 code for 597 is given by __________

a) 100011001010
b) 100010100111
c) 010110010111
d) 010110101101

30. The decimal equivalent of the excess-3 number 110010100011.01110101 is

_____________
a) 970.42
b) 1253.75
c) 861.75
d) 1132.87

31. A code converter is a logic circuit that _____________

a) Inverts the given input
b) Converts into decimal number

Cipher: 7558956002
c) Converts data of one type into another type
d) Converts to octal

32. Use the weighting factors to convert the following BCD numbers to binary
___________

0101 0011 & 0010 0110 1000

a) 01010011 001001101000
b) 11010100 100001100000
c) 110101 100001100
d) 101011 001100001

33. The primary use for Gray code is ___________

a) Coded representation of a shaft’s mechanical position
b) Turning on/off software switches
c) To represent the correct ASCII code to indicate the angular position of a shaft on
rotating machinery
d) To convert the angular position of a shaft on rotating machinery into hexadecimal
code

34. Code is a symbolic representation of ___________

a) Discrete information
b) Continuous information
c) Decimal information into binary
d) Binary information into decimal

35. One way to convert BCD to binary using the hardware approach is ___________
a) With MSI IC circuits
b) With a keyboard encoder
c) With an ALU
d) UART

36. Why is the Gray code more practical to use when coding the position of a rotating
shaft?
a) All digits change between counts
b) Two digits change between counts
c) Only one digit changes between counts
d) Alternate digit changes between counts

37. Reflected binary code is also known as ___________

a) BCD code

Cipher: 7558956002
b) Binary code
c) ASCII code
d) Gray Code

38. Why do we use gray codes?

a) To count the no of bits changes
b) To rotate a shaft
c) Error correction
d) Error Detection

39. Earlier, reflected binary codes were applied to ___________

a) Binary addition
b) 2’s complement
c) Mathematical puzzles
d) Binary multiplication

40. The binary representation of BCD number 00101001 (decimal 29) is ___________
a) 0011101
b) 0110101
c) 1101001
d) 0101011

41. Convert binary number into gray code: 100101.

a) 101101
b) 001110
c) 110111
d) 111001
42. What does EBCDIC stand for?
a) Extended Binary Converted Decimal Intermediate Code
b) Extended Binary Coded Decimal Intermediate Code
c) Extended Binary Coded Decimal Interchange Code
d) Extended Binary Converted Decimal Interchange Code
43. In EBCDIC, a maximum of 128 different characters can be represented.
a) True
b) False
44.The gray code equivalent of the decimal number 5 is ________.

a)0101
b)1000
c)1100
d)0111

Cipher: 7558956002
 45.The given logic circuit represents:

a) 4 bit binary to decimal converter

b) 4 bit decimal to excess-3 code
converter
c) 4 bit binary to Gray code converter
d)4 bit decimal to binary converter
e)Excess-3 code converter to 4 bit
decimal

46 .What would be the gray code equal to the number 14?

a) 1000
b) 1110
c) 1111
d) 1001

47.The code used to reduce the error due to ambiguity in reading of a binary optical
encoder is

a) Octal code
b) Excess-3 code
c) Gray code
d) BCD code

1s complement 2s complement

48. 1’s complement of 1011101 is ____________

a) 0101110
b) 1001101
c) 0100010
d) 1100101

49. 2’s complement of 11001011 is ____________

a) 01010111
b) 11010100
c) 00110101
d) 11100010

50. The subtraction using 1’s complement of 110 – 100 will give the result ___________
a) -011
b) 011
c) 010
d) -010

Cipher: 7558956002
51. The 1’s complement of 1111111110.101 is _______________
a) 1.010
b) 0000000000.010
c) 1111111110.101
d) 1.101

52. What is the 2's complement of (-28)10 in 16 bit representation?

a) 1111111111000101
b) 1000000000011100
c) 1111111111100011
d) 1111111111100101
e) 1111111111100100

53. The range of values that can be represented with 8 bit in 2’s complement form is

a) 0 to +128
b) +256 to -256
c) -128 to +128
d) +127 to -128

54) The 8-bit 2's complement form of the number -14 is ______.

a)11110010
b) 00001110
c) 10001110
d) 01110001

55. The smallest integer that can be represented by an 8 - bit number in 2's complement
form is

a) -256
b) -128
c) 0
d) -127

56. 10001 is the 2’s complement of which of the following number in 2’s complement
representation?

A) -15 B)15

C) 14 D) -14

Cipher: 7558956002
57. A universal logic gate is one which can be used to generate any logic function.
Which of the following is a universal logic gate?
a) OR
b) AND
c) XOR
d) NAND

58. A full adder logic circuit will have __________

a) Two inputs and one output
b) Three inputs and three outputs
c) Two inputs and two outputs
d) Three inputs and two outputs

59. How many two input AND gates and two input OR gates are required to realize Y =
BD + CE + AB?
a) 3, 2
b) 4, 2
c) 1, 1
d) 2, 3

60. Which of the following are known as universal gates?

a) NAND & NOR
b) AND & OR
c) XOR & OR
d) EX-NOR & XOR

61. The gates required to build a half adder are __________

a) EX-OR gate and NOR gate
b) EX-OR gate and OR gate
c) EX-OR gate and AND gate
d) EX-NOR gate and AND gate

62. 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

63. How many truth table entries are necessary for a four-input circuit?
a) 4
b) 8
c) 12
d) 16

64. Which input values will cause an AND logic gate to produce a HIGH output?
a) At least one input is HIGH

Cipher: 7558956002
b) At least one input is LOW
c) All inputs are HIGH
d) All inputs are LOW

65. Exclusive-OR (XOR) logic gates can be constructed from what other logic gates?
a) OR gates only
b) AND gates and NOT gates
c) AND gates, OR gates, and NOT gates
d) OR gates and NOT gates

66. 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

67. The AND function can be used to ___________ and the OR function can be used to
_____________
a) Enable, disable
b) Disable, enable
c) Synchronize, energize
d) Detect, invert

68. The dependency notation “>=1” inside a block stands for which operation?
a) OR
b) XOR
c) AND
d) XNOR

69. If we use an AND gate to inhibit a signal from passing one of the inputs must be
___________
a) LOW
b) HIGH
c) Inverted
d) Floating

70. Logic gate circuits contain predictable gate functions that open theirs ____________
a) Outputs
b) Inputs
c) Pre-state
d) Impedance state

Cipher: 7558956002
BOOLEAN LAWS

71. 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

72. The expression for Absorption law is given by _________

a) A + AB = A
b) A + AB = B
c) AB + AA’ = A
d) A + B = B + A

73. According to boolean law: A + 1 = ?

a) 1
b) A
c) 0
d) A’

74. The involution of A is equal to _________

a) A
b) A’
c) 1
d) 0

75. A(A + B) = ?
a) AB
b) 1
c) (1 + AB)
d) A
76. DeMorgan’s theorem states that _________
a) (AB)’ = A’ + B’
b) (A + B)’ = A’ * B
c) A’ + B’ = A’B’
d) (AB)’ = A’ + B
77. (A + B)(A’ * B’) = ?
a) 1
b) 0
c) AB
d) AB’

Cipher: 7558956002
78. Complement 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’)

79. Simplify Y = AB’ + (A’ + B)C.

a) AB’ + C
b) AB + AC
c) A’B + AC’
d) AB + A

80. 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
81. What are the canonical forms of Boolean Expressions?
a) OR and XOR
b) NOR and XNOR
c) MAX and MIN
d) SOM and POM
82. The logical sum of two or more logical product terms is called __________
a) SOP
b) POS
c) OR operation
d) NAND operation

83. The expression Y=AB+BC+AC shows the _________ operation.

a) EX-OR
b) SOP
c) POS
d) NOR

84. The expression Y=(A+B)(B+C)(C+A) shows the _________ operation.

a) AND
b) POS
c) SOP
d) NAND

85. A product term containing all K variables of the function in either complemented or
uncomplemented form is called a __________
a) Minterm
b) Maxterm

Cipher: 7558956002
c) Midterm
d) ∑ term

86. According to the property of minterm, how many combination will have value equal
to 1 for K input variables?
a) 0
b) 1
c) 2
d) 3
87. The canonical sum of product form of the function y(A,B) = A + B is __________
a) AB + BB + A’A
b) AB + AB’ + A’B
c) BA + BA’ + A’B’
d) AB’ + A’B + A’B’

88. A variable on its own or in its complemented form is known as a __________

a) Product Term
b) Literal
c) Sum Term
d) Word

89. Maxterm is the sum of __________ of the corresponding Minterm with its literal
complemented.
a) Terms
b) Words
c) Numbers
d) Nibble

90. Canonical form is a unique way of representing ____________

a) SOP
b) Minterm
c) Boolean Expressions
d) POS

91. There are _____________ Minterms for 3 variables (a, b, c).

a) 0
b) 2
c) 8
d) 1

Cipher: 7558956002
K MAP
92. K-map is used for _______
a) logic minimization
b) expression maximization
c) summing of parity bits
d) logic gate creation

93. To display time in railway stations which digital circuit is used?

a) seven segment decoder
b) eight segment encoder
c) 8:3 multiplexer
d) 9 bit segment driver

94. Simplify the expression using K-maps: F(A,B,C,D)=Σ (1,3,5,6,7,11,13,14).

a) AB+BC’D+A’B’C
b) BCD’+A’C’D+BD’
c) A’D+BCD+A’BC+AB’C’
d) AC’D’+BC+A’BD+C’D’

COMBINATIONAL AND SEQUENTIAL CIRCUTES

95. The Output is dependent only on present input?

a)Combinational Circuits
b)Analog Circuits
c)Flip Flop
d) Sequential Circuits

96. The combination of two half adders is a ________.

a) full adder
b) Schimtt trigger
c) Comparator
d) half adder

97. Race Around condition can be avoided in Digital logic circuits using?

a) Shift Register
b) Master Slave JK Flip Flop
c) Full Adder
d) AND Gate

Cipher: 7558956002
98 _______ are an example of a combinational circuit.

a) Shift Registers
b) Multiplexers
c) Counters
d) Flip-Flops

99. Any combinational circuit can be designed using only

a) AND gates
b) OR gates
c) XOR gates
d) NOR gates

100. For which of the following gates the output is zero when one or more inputs are
zero?

a) OR
b) NOR
c) NOT
d) AND

101. In a half adder, the carry output is high if the inputs are:

a) 1, 1
b) 0, 0
c) 0, 1
d) 1, 0

102. For a design of (16 ∶ 1) multiplexer, how many select lines will be required?

a) 1
b) 3
c) 4
d) 2

103. Which of the following is a combinational logic circuit that has 2n input lines and a
single output line?

a) Demultiplexer
b) Decoder
c) Encoder
d) Multiplexer

104. Which of the following is a combinational logic circuit that has 2n input lines and a
single output line?

Cipher: 7558956002
a) Demultiplexer
b) Decoder
c) Encoder
d) Multiplexer

105 __________ converts binary-coded information to unique outputs such as

decimal, octal digits, etc.

a) Decoder
b) Demultiplexing
c) Multiplexing
d) Encoder

106. A logic circuit which is used to change a BCD number into an equivalent decimal
number is -
a) Decoder
b) Encoder
c) Multiplexer
d) Code converter

107. When both inputs of a J-K flip-flop cycle, the output will ___________
a) invalid
b) Change
c) No change
d) Toggle

108. A basic S-R flip-flop can be constructed by cross-coupling of which basic logic
gates?
a) AND or OR gates
b) XOR or XNOR gates
c) NOR or NAND gates
d) AND or NOR gates

109. The logic circuits whose outputs at any instant of time depends only on the present
input but also on the past outputs are called ________________
a) Combinational circuits
b) Sequential circuits
c) Latches
d) Flip-flops

110. Whose operations are more faster among the following?

a) Combinational circuits
b) Sequential circuits
c) Latches
d) Flip-flops

Cipher: 7558956002
111. What is a trigger pulse?
a) A pulse that starts a cycle of operation
b) A pulse that reverses the cycle of operation
c) A pulse that prevents a cycle of operation
d) A pulse that enhances a cycle of operation

112. How many types of flip-flops are?

a) 2
b) 3
c) 4
d) 5

113. The S-R flip flop consist of ____________

a) 4 AND gates
b) Two additional AND gates
c) An additional clock input
d) 3 AND gates

114. What is one disadvantage of an S-R flip-flop?

a) It has no Enable input
b) It has a RACE condition
c) It has no clock input
d) Invalid State

115. What is the hold condition of a flip-flop?

a) Both S and R inputs activated
b) No active S or R input
c) Only S is active
d) Only R is active

116. How is a J-K flip-flop made to toggle?

a) J = 0, K = 0
b) J = 1, K = 0
c) J = 0, K = 1
d) J = 1, K = 1

117. In J-K flip-flop, “no change” condition appears when ___________

a) J = 1, K = 1
b) J = 1, K = 0
c) J = 0, K = 1
d) J = 0, K = 0

Cipher: 7558956002
118. The D flip-flop has number of input and output.
a) 1,2
b) 2,2
c) 1,1
d) 2,1

119. A D flip-flop can be constructed from an ______ flip-flop.

a) S-R
b) J-K
c) T
d) S-K

120. The characteristic equation of D-flip-flop implies that ___________

a) The next state is dependent on previous state
b) The next state is dependent on present state
c) The next state is independent of previous state
d) The next state is independent of present state

121. In a J-K flip-flop, if J=K the resulting flip-flop is referred to as _____________

a) D flip-flop
b) S-R flip-flop
c) T flip-flop
d) S-K flip-flop

122. The flip-flop is only activated by _____________

a) Positive edge trigger
b) Negative edge trigger
c) Either positive or Negative edge trigger
d) Sinusoidal trigger

.123. The flip-flops which has not any invalid states are _____________
a) S-R, J-K, D
b) S-R, J-K, T
c) J-K, D, S-R
d) J-K, D, T

Cipher: 7558956002
SOLUTIONS
50. To subtract using 1’s complement: Take the 1’s complement of the 2nd number
(here, 011) and add it to the first number. (110+011=1,001).
If the carry is generated, it is added to the result (001+1=010).
If a carry is not generated then it is converted to its 1’s complement form.

51. A

52. 16-bit (+28)10 = 0000 0000 0001 1100

1's complement = 1111 1111 1110 0011

2’s complement of a binary number is 1, added to the 1’s complement of the binary
number.
2's complement = 1's complement+1
2's complement (-28)10 = 1111 1111 1110 0100
Hence the correct is 1111 1111 1110 0100

54 a
55

56. D -14
62. c
A transistor can be used as a switch. That is when base is low collector is high (input
zero, output one) and base is high collector is low (input 1, output 0).

71 : d
The expression for Associative property is given by A+(B+C) = (A+B)+C & A*(B*C) =
(A*B)*C.
The expression for Commutative property is given by A+B = B+A & A*B = B*A.
The expression for Distributive property is given by A+BC=(A+B)(A+C) & A(B+C) =
AB+AC.

Cipher: 7558956002
72: a
The expression for Absorption Law is given by: A+AB = A.
Proof: A + AB = A(1+B) = A (Since 1 + B = 1 as per 1’s Property).
73: a
A + 1 = 1, as per 1’s Property.
74 a
The involution of A means double inversion of A (i.e. A”) and is equal to A.
Proof: ((A)’)’ = A
75: d
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.
76: a
The DeMorgan’s law states that (AB)’ = A’ + B’ & (A + B)’ = A’ * B’, as per the Dual
Property
77 b
The DeMorgan’s law states that (AB)’ = A’ + B’ & (A + B)’ = A’ * B’, as per the Dual
Property
78: b
(A’B + CD’)’ = (A’B)'(CD’)’ (By DeMorgan’s Theorem) = (A” + B’)(C’ + D”) (By
DeMorgan’s Theorem) = (A + B’)(C’ + D).
79: a
Y = AB’ + (A’ + B)C = AB’ + (AB’)’C = (AB’ + C)( AB’ + AB’) = (AB’ + C).1 = (AB’ + C).
80: b: (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).
81 d
There are two kinds of canonical forms for a Boolean expression-> 1)sum of
minterms(SOM) form and
2)product of maxterms(SOM) form

82: a
The logical sum of two or more logical product terms, is called SOP (i.e. sum of
product). The logical product of two or more logical sum terms is called POS (i.e.
product of sums).
83: b
The given expression has the operation product as well as the sum of that. So, it shows
SOP operation. POS will be the product of sum terms.

Cipher: 7558956002
84 b
The given expression has the operation sum as well as the product of that. So, it shows
POS(product of sum) operation. SOP will be the sum of product terms.
85: a A product term containing all K variables of the function in either
complemented or uncomplemented form is called a minterm. A sum term containing all
K variables of the function in either complemented or uncomplemented form is called a
maxterm.
86: b The main property of a minterm is that it possesses the value 1 for only
one combination of K input variables and the remaining will have the value 0.
87: b
A + B = A.1 + B.1 = A(B + B’) + B(A + A’) = AB + AB’ + BA +BA’ = AB + AB’ + A’B = AB
+ AB’ + A’B.
88: b A literal is a single logic variable or its complement. For
example — X, Y, A’, Z, X’ etc.
89: a Maxterm is the sum of terms of the corresponding Minterm with its literal
complemented.
90: c Boolean Expressions are represented through a canonical form. An
example of canonical form is A’B’C’ + AB’C + ABC’.
91: c Minterm is given by 2n. So, 23 = 8 minterms are required
122. Flip flops can be activated with either a positive or negative edge trigger.

Cipher: 7558956002