Font size
WorksheetsCOMBINATIONAL DIGITAL CIRCUITS
Total questions: 55
Worksheet time: 34mins
Which of the circuits in figure (a to d) is the sum-of-products implementation of figure (e)?
a
b
c
d
Which of the following logic expressions represents the logic diagram shown?
X=AB’+A’B
X=(AB)’+AB
X=(AB)’+A’B’
X=A’B’+AB
The device shown here is most likely a ________
Comparator
Demultiplexer
Inverter
Multiplexer
What type of logic circuit is represented by the figure shown below?
EX-NOR
EX-OR
NAND
AND
For the device shown here, assume the D input is LOW, both S inputs are LOW and the input is LOW. What is the status of the Y’ outputs?
All are HIGH
All are LOW
All but Y0 are LOW
All but Y0 are HIGH
3 bits full adder contains ________
3 combinational inputs
4 combinational inputs
6 combinational inputs
8 combinational inputs
Represent a decimal number 39 in BCD
(a)
The BCD number 101011 has _______ priority.
Even
Odd
Both even and odd
Undefined
Which gates are ideal for checking the parity bits?
AND
EX-NOR
EX-OR
NAND
What is the radix of hexadecimal number?
15
10
16
2
Convert the binary number 01011 into decimal
10
11
13
12
The number 5A6D belongs to which category of number system
Octal
Hexadecimal
Binary
DEcimal
The number 15 is represented as ............in Hexadecimal.
C
E
F
D
Design a combinational circuit with three inputs and one output. The output is 1 when the binary value of the inputs is less than 3. The output is 0 otherwise.
F = x'y' + x'z
F = x'y + x'z
F = x'y' + xz
F = x'y' + x'z'
What value is input B, if output Y is high when both input A and input C are high.
Low (0)
High (1)
High impedance
Short-circuit
How many Full adders are needed to design a 6 bit parallel adder?
7
3
6
4
Which of the following is not a basic gate?
AND
OR
EXOR
NOT
Full adder circuit can perform the addition of ____ bit numbers
3
1
2
4
Multiplexer is a ____ logic circuit
Combinational
Sequential
Random
Memory
( A + B ) ( C + D )
is the same as
AC + BD
(A . B ) + ( C . D )
A + B + C + D
AC + AD + BC + BD
is the same as
A + B + C
7. The number of min terms for an expression comprising of 3 variables?
a) 8
b) 3
c) 0
d) 1
8. The logical sum of two or more logical product terms is called __________
a) SOP
b) POS
c) OR operation
d) NAND operation
9. The expression Y=(A+B)(B+C)(C+A) shows the _________ operation.
a) AND
b) POS
c) SOP
d) NAND
which of the following circuits can be used as parallel to serial converter?
Multiplexer
Demultiplexer
Digital counter
Decoder
The number of inputs and outputs in a full adder are
2 and 1
2 and 2
3 and 2
3 and 3
which device has one input and many outputs
flip flop
multiplexer
demultiplexer
counter
Break the line, change the sign.
Associative Property
Distributive Property
Commutative Property
DeMorgan's Theorem
The rightmost bit of a binary number. This bit has the number's smallest positional multiplier.
Most Significant Bit
Minterm
Maxterm
Least Significant Bit
The leftmost bit in a binary number. This bit has the number's largest positional multiplier.
Most Significant Bit
Minterm
Maxterm
Least Significant Bit
Algebraic process used as a tool in the design and analysis of digital systems. Only two values are possible, 0 and 1.
Boolean Algebra
Boolean Expression
Boolean Theorems
Boolean Variable
Rules that can be applied to Boolean algebra to simplify logic expressions.
Boolean Algebra
Boolean Expression
Boolean Theorems
Boolean Variable
Find the decimal addition 6+8 in bcd
0001 0100
0110 1000
1010
1000 0110
Find the excess-3 code for the decimal numbers 592
0101 1001 0010
1000 1100 0101
0101 1001 0011
1100 1111 1110
A function F(A, B, C) defined by three Boolean variables A, B and C when expressed as sum of products is given by
F=A'B'C'+A'BC'+AB'C'
The product of sums (POS) form of the function F is (GATE 2018)
(A+B+C)(A+B'+C)(A'+B+C)(A+B'+C')
(A+B+C')(A+B'+C')(A'+B'+C)+(A'+B'+C')
The output of the combinational circuit given is (GATE 2016)
A+B+C
A(B+C)
B(C+A)
C(A+B)
In the figure shown, the output ܻ is required to be ܻ Y=AB+ C'D'.The gates G1 and G2 must be, respectively, (GATE 2015)
NOR,OR
OR,NAND
NAND,OR
AND,NAND
Simplify the Boolean function F = Σ (1,2,4,7)
F = x'y'+yz+xz
F = x'y'z+ x'yz'+xy'z'+xyz
F = z+xy+yz
F = xyz+x'y'z'
Reduce the following function using K-Map.
F = Σ (0,1,3,7) +Σd (2,5)
F = A' + C
F = A + C
F = A'+C'
F= A'B'+A'C+BC
Simplify the function F = Σ (0,1,3,4)
F = AC+BC
F = AB+AC
F= B'C'+A'C
F=A'C'+B'C'
What is the simplified expression?
B' + D
B'D
B + D'
AB + CD
What is the Logic Expression (equation) for this truth table?
(A'+B)(A+B')(A+B)
A'B + AB' + AB
(A'B)(AB')(AB)
A + B
1. Simplify f(A,B,C,D)=∑m(2,3,6,7,10,11,14,15)
A
B
C
D
1. Simplify f(A,B,C,D)=∑m(3,7,11,15)
CD
C'D
CD'
C'D'
