0% found this document useful (0 votes)
97 views6 pages

DL Q1

This document contains 20 multiple choice questions about digital logic concepts such as truth tables, Boolean algebra, logic gates, flip-flops, decoders, and minimization techniques. The questions cover topics like logic functions, Boolean expressions, combinational and sequential circuits, Karnaugh maps, and canonical and minterm forms.

Uploaded by

abhishek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
97 views6 pages

DL Q1

This document contains 20 multiple choice questions about digital logic concepts such as truth tables, Boolean algebra, logic gates, flip-flops, decoders, and minimization techniques. The questions cover topics like logic functions, Boolean expressions, combinational and sequential circuits, Karnaugh maps, and canonical and minterm forms.

Uploaded by

abhishek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

DIGITAL LOGIC

1. In the following truth table, V = 1 if and only if the input is valid.

What function does the truth table represent?

(a) Priority encoder (b) Decoder


(c) Multiplexer (d) Demultiplexer

2. Which one of the following expressions does NOT represent exclusive NOR of x and y?

(a) xy + x’ y’ (b) x ^ y’ where ^ is XOR


(c) x’ ^ y where ^ is XOR (d) x’ ^ y’ where ^ is XOR

3. The truth table

represents the Boolean function:

(a) X (b) X + Y
(c) X xor Y (d) Y

4. What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don’t
care term.

1
(a) b’d’ (b) b’d’ + b’c’
(c) b’d’ + a’b’c’d’ (d) b’d’ + b’c’ + c’d’

5. Which one of the following circuits is NOT equivalent to a 2-input XNOR (exclusive NOR)
gate?

6. The simplified SOP (Sum Of Product) form of the boolean expression


(P + Q’ + R’) . (P + Q’ + R) . (P + Q + R’) is

(a) (P’.Q + R’) (b) (P + Q’.R’)


(c) (P’.Q + R) (d) (P.Q + R)

7. Consider the following circuit involving three D-type flip-flops used in a certain type of
counter configuration.

2
If at some instance prior to the occurrence of the clock edge, P, Q and R have a value 0, 1 and
0 respectively, what shall be the value of PQR after the clock edge?

(a) 000 (b) 001


(c) 010 (d) 011

8. Consider the data given in previous question. If all the flip-flops were reset to 0 at power on,
what is the total number of distinct outputs (states) represented by PQR generated by the
counter?

(a) 3 (b) 4
(c) 5 (d) 6

9. The minterm expansion of f(P, Q, R) = PQ + QR’ + PR’ is

(a) m2 + m4 + m6 + m7 (b) m0 + m1 + m3 + m5
(c) m0 + m1 + m6 + m7 (d) m2 + m3 + m4 + m5

10. The Boolean expression for the output ‘f’ of the multiplexer shown below is

3
(a) (P(XOR) Q(XOR) R)’ (b) P (XOR) Q(XOR) R
(c) (P+Q+R)’ (d) P+Q+R

11. What is the Boolean expression for the output f of the combinational logic circuit of NOR
gates given below?

(a) (Q+R)’ (b) (P+Q)’


(c) (P+R) (d) (P+Q+R)’

12. In the sequential circuit shown below, if the initial value of the output Q1Q0 is 00, what are
the next four values of Q1Q0?

(a) 11, 10, 01, 00 (b) 10, 11, 01, 00


(c) 10, 00, 01, 11 (d) 11, 10, 00, 01

4
13. In the Karnaugh map shown below, X denotes a don’t care term. What is the minimal form
of the function represented by the Karnaugh map?

(a) b̅. d̅ + a̅. d̅ (b) a’b’+ b’d’+ a’bd’


(c) b’d’+ a’bd’ (d) a’b’+ b’d’+ a’d’

14. What is the minimum number of gates required to implement the Boolean function (AB+C)
if we have to use only 2-input NOR gates?

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

15. Let r denote number system radix. The only value(s) of r that satisfy the equation
√121r = 11r is/are

(a) decimal 10 (b) decimal 11


(c) decimal 10 and 11 (d) any value > 2

16. Given f1, f3 and f in canonical sum of products form (in decimal) for the circuit

𝑓1 = Ʃm(4, 5,6,7,8)
f3 = Ʃm(1,6,15)

5
f = Ʃm(1,6,8,15)

then f2 is

(a) Ʃm(4,6) (b) Ʃm(4,8)


(c) Ʃm(6,8) (d) Ʃm(4,6,8)

17. If P, Q, R are Boolean variables, then (P + Q’)(PQ’ + PR)(P’R’ + Q’) simplifies:

(a) PQ’ (b) PR’


(c) PQ’ + R (d) PR” + Q

18. How many 3-to-8 line decoders with an enable input are needed to construct a 6-to-64 line
decoder without using any other logic gates?

(a) 7 (b) 8
(c) 9 (d) 10

19. Consider the following Boolean function of four variables:


f(w,x,y,z) = ∑(1,3,4,6,9,11,12,14)

The function is:

(a) independent of one variables. (b) independent of two variables.


(c) independent of three variables. (d) dependent on all the variables.

20. Let f(w, x, y, z) = ∑(0, 4, 5, 7, 8, 9, 13, 15). Which of the following expressions are NOT
equivalent to f?

(a) x’y’z’ + w’xy’ + wy’z + xz (b) w’y’z’ + wx’y’ + xz


(c) w’y’z’ + wx’y’ + xyz + xy’z (d) x’y’z’ + wx’y’ + w’y

You might also like