Font size
WorksheetsDigital Logic Circuits
Total questions: 90
Worksheet time: 47mins
Convert binary 111111110010 to hexadecimal.
EE216
FF216
2FE16
FE216
number 2610?
a. 8H
b. 1AH
c. A1H
d. 20H
a. 1110
b. 1310
c. 1410
d. 1210
a. 5410
b. 5010
c. 5510
d. 5110
a. 11012
b. 11112
c. 100012
d. 100112
Convert 110101111 to an octal number
6578
6678
3678
6448
The conversion of decimal number (37.8125) to Binary is
100101.1101
11010.0101
101010.1010
010101.0101
Find Octal number equivalent of the Decimal number (214.640625)
326.51
320.15
326.10
326.25
Convert the decimal number 3509 to Hexadecimal
DB5
BD5
5BD
ABC
110001.101 is equal to .......... in Decimal
49.625
50.625
94.625
49.865
101.110.110.11 is equivalent to ------------ in Octal system
56.66
66.66
65.66
66.56
The Hexadecimal equivalent of 1101100010011011 is
D89B
BD98
89BD
DB89
Binary equivalent of the Octal number 725.63 is
111010101.110011
10101010.101010
01010101.0101
None
Find Hexadecimal equivalent of the Octal number 7689.35
ABCD.23
DCBA.EF
ABCD.EF
None
9B2.1A is equivent to ........... in Decimal
2482.1015
2345.1015
2542.1015
None
ABCD.EF is equivalent to ............. in Binary
1010101111001101.11101111
ABCD.EF
10101010101010.1010101010
0101010101.01010101
1's Complement of 1000 is
0111
1000
1010
0101
2's complement of 1000 is
1000
0111
1010
None
How many AND gates are required to realize Y = CD + EF + G?
4
5
3
2
A
B
C
D
How many AND gates are required to realize Y = CD + EF + G?
4
5
3
2
A
B
C
D
A
B
C
D
symbol for a NOT gate?
State the name of this logic gate....
AND
NOT
NOR
OR
Complete the truth table for the logic gate!
One input of a NAND gate is low (logic level 0) and the other input is high (logic level 1).
The output state is?
1
0
The two inputs of a NAND gate are both low (logic level 0). The output state is...
1
0
symbol for a NAND gate is....
What gate is this truth table for?
AND
NOT
OR
THE
Which truth table is this?
XOR
NOR
NAND
NOT
Which are the UNIVERSAL GATES?
XOR Gate & NOT Gate
AND Gate & OR Gate
NAND Gate & NOR Gate
All of the above
In the case of OR gate,no matter what the no. of inputs a
1 at any input causes the output to be at logic 1
1 at any input causes the output to be at logic 0
0 any input causes the output to be at logic 0
0 at any input causes the output to be at logic 1.
The NOR Gate is OR Gate followed by ...............
OR Gate
NOT Gate
AND Gate
None of the above
NAND Gate is called a universal logic element, because
It is used by everybody
Any logic function can be realised by NAND Gate alone
Many digital computers use NAND Gate
All the minimisation techniques are applicable to optimum NAND Gate realisation
Which Logic gate does this Truth Table represent?
AND Gate
OR Gate
NOT Gate
NAND Gate
Which logic gate is shown?
NOR Gate
XOR Gate
XNor Gate
AND Gate
NAND gate
Which Logic gate does this Truth Table represent?
AND Gate
OR Gate
NOT Gate
NAND Gate
Which logic gate is shown?
NOR Gate
XOR Gate
XNor Gate
AND Gate
NAND gate
Which logic gate is shown?
NOR gate
NAND gate
OR gate
NOT gate
Which logic gate is shown?
AND gate
OR gate
NOT gate
NOR gate
What gate is represented by the truth table shown?
NOR gate
NOT gate
AND gate
XOR gate
Which logic gate is shown?
AND gate
XOR gate
OR gate
NOT gate
Which logic gate is represented by the truth table shown?
AND gate
Xor gate
XNOR gate
NAND gate
Which logic gate does the truth table shown represent?
OR gate
NAND gate
XNOR gate
XOR gate
1101 + 1001 = ?
11001
11001
101010
10110
Full Adder can be formed by cascading two half adders
True
False
Which among the following is a combinational circuit
Flip Flop
Latch
Counter
Encoder
The combinational circuit used for routing the input value to the output line based on the select signal combination
Multiplexer
Demultiplexer
Encoder
Decoder
Which among the following is the BCD representation of the decimal number 12
1100
0001 0010
1101
0001 0011
Which flip flop is used for designing counters
T flip flop
SR flip flop
D flip flop
T latch
The excess-3 code of 0010
0101
0011
0100
0110
Which among the following gates is an inequality detector
XOR Gate
XNOR Gate
NAND Gate
NOR Gate
Minterms are:
Sum of Products
Product of Sums
Cannot be determined
Combinational digital circuits are capable of storing atleast one bit of data
True
False
Depends on the design
Cannot be determined
Which among these are non-weighted codes
Excess-3 Code
BCD Code
Gray Codes
Binary Codes
Which among these is called a 'unit distance code'?
Gray Code
Excess-3 Code
BCD Code
Alphanumeric Code
Binary code is also called 8421 code
True
False
How many LEDs does a 7 segment display have
7
8
14
1
From a given tautology, another tautology can be derived by interchanging
0 and 1
AND and OR
0 and 1; AND and OR
impossible to always drive
If # is a Boolean operation defined as x # y = x'y + xy'.
Consider z = x # y, then z # x is?
x
y
0
1
a
b
c
d
How many minimum number of gates required to implement the Boolean function (A + BC) if you have to use only 2-input NOR gate?
2
3
4
5
Consider the following Boolean function of four variables
f(A, B, C, D)=Σ(1, 3, 4, 5, 6, 7, 12, 14)
The function is
independent of 1 variable
independent of 2 variables
independent of 3 variables
independent of all variables
Operator $ is defined as x $ y = x' + y. Let z = x $ y. The value of z $ x
x' + y
x
0
1
The Boolean variables x, y, z that satisfy Boolean expression xy+x'y=1 and xz+y=0 is
1, 0, 0
0, 1, 1
1, 0, 1
0, 0, 1
The output of the given MUX can be represented by
AB + BC' + C'A + BC
A + B + C
A + B
A'B'C + A'BC' ABC
The Boolean expression for the output f is?
Find out the Boolean expression of f
(P+Q)'
(Q+R)'
(P+R)'
(P+Q+R)'
A subtractor is not usually present in a computer system because
it is expensive
it is not possible to design it
the adder will take care of subtraction
comparator can take care of subtraction
The output F is given by
1
0
X
X'
Which of the following expressions does NOT represent exclusive NOR of x and y?
xy+x'y'
x <XOR> y′
x' <XOR> y
x' <XOR> y'
The give Karnaugh Map of 4 Boolean function F is given. A, B, C are don't care conditions. What value of A, B, C will result in the minimal expression?
A = B = C = 1
B = C = 1; A = 0
A = C = 1; B = 0
A = B = 1; C = 0
The working of a staircase switch is a typical example of the logical operation
OR
AND
Exclusive - OR
Exclusive - NOR
What is the minimal form of the given k-map?
b'd'
b'd'+b'c'
b'd'+ab'c'd
b'd'+b'c'+c'd'
The total number of Boolean functions of three variables X, Y, and Z such that f (X, Y, Z) = f (X', Y', Z') is
8
16
32
64
In order to make the given circuit a tautology, the '?' box should be replaced with.
Note: This is a multi select type question.
an OR gate
an AND gate
a NAND gate
a NOR gate
The Boolean expression for the given diagram
a tautology
an inconsistency
independent of A
independent of B
The truth table represents the function
X
X + Y
X <XOR> Y
Y
To realize the given truth table from the circuit shown in the figure, the input to J in terms of A and B would have to be
A'
B
(AB)'
A'B
The logic function f(A, B, C, D) implemented by the circuit shown below is
D' (A⊕C)
D'(A⊕B)
D(A⊙C)
D(A⊙B)
For the given multiplexer, Y is equal to
AC'D'+A'BC+A'D
AB'C'+AC'D'+A'D
A'B'C'+ACD'+A'D'
AC'D'+A'B'D+AD'
Consider the circuit given. The minimized expression for F is
C'
I0
C
I0'
What is the output of given circuit?
A + B
A . B
A' . B '
( A . B )'
A + A' B + A B ' = ???
A + B
A ' + B
A + B '
A . B
What is the output of given circuit?
A + B
A . B
A ' + B '
A ' . B '
