Ade Question Bank
Ade Question Bank
Ade Question Bank
1 State & prove De Morgan’s theorems with the help of truth tables.
2 Obtain the truth table of the function: F= xy + xyʹ + yʹz.
Show that AʘB = AB + A’B’ = (A⊕B)’ = (AB’+A’B)’. Also construct the corresponding logic
3
diagrams
Using laws of Boolean algebra prove that AB + BC + A'C = AB + A'C.
Show that AB’C + B + BD’ + ABD’ + A’C = B + C
4
Show that (A + C) (A + D) (B + C) (B + D) = AB + CD
Reduce the expression F = ((AB)’+A’+AB)’
Minimize the following Boolean expressions.
1. X = ( (A'B'C')' + (A'B)' )'
5 2. Y = AB + ABC' + A'BC + A'BC'
Prove the following Boolean identities.
(i) XY+YZ+Y’Z=XY+Z (ii) AB+A’B+A’B’=A’+B
Minimize the logic function X = A(B' + C')(A + D).
6
Also realize the reduced function using NOR gates only
Minimize the logic function X = A(B' + C')(A + D).
7
Also realize the reduced function using NOR gates only
Reduce following Boolean function and then realize the reduced one using NOR gate only. X = A
8
(B'+C') (A+D) OR
Simplify using Boolean laws and draw the logic diagram for the given expression. 𝐹 = 𝐴𝐵𝐶 +
9
𝐴𝐵 𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵𝐶 + 𝐴𝐵 𝐶
Express the Boolean function F = AB + A’C in a product of maxterm. OR
10 Convert the expression Y= A + BC into the standard SOP form.OR
Convert F (A, B, C) = BC +A into standard minterm form.
Reduce to simplest form using K-map:
11 𝐹 𝐴, 𝐵, 𝐶, 𝐷 = 𝛴(0,1,2,5,8,9,10)
OR Reduce the expression F = Σm(0,2,3,4,5,6) using K-map and implement using NAND gates only.
Reduce the expression in SOP and POS form using K-map.
F(A,B,C,D) = Σm (1,5,6,12,13,14) + d(2,4)
OR Simplify Boolean function using K-Map
F(w,x,y,z)=Σ(1,3,5,8,9,11,15) d(w,x,y,z)=Σ(2,13)
OR Minimize following Boolean function using K-map & design the simplified function using logic
12 gates.
F = Σ m(1, 2, 4, 6, 7, 11, 15) + Σ d(0, 3)
OR Reduce the given function using K-map and implement the same using gates. F(A,B,C,D ) = Σm
(0,1,3,7,11,15) + Σd ( 2,4)
OR Minimize the following logic function using K-maps and realize using NAND and NOR gates.
F(A,B,C,D) =Σ_m(1,3,5,8,9,11,15) + d(2,13).
Minimise the logic function F (A,B,C,D)=Π_M (1, 2, 3, 8, 9, 10, 11,14)·d (7, 15). Use Karnaugh map.
13
Draw the logic circuit for the simplified function using NOR gates only.
Simplify the following Boolean function by means of the Tabulation Method. F(A,B,C,D) =
14 Σ(1,2,3,5,6,7,8,9,12,13,15)
Distinguish between combinational and sequential logic circuits. (2) Give the applications of flip-
1
flops.
2 Explain edge triggering and level triggering.
Draw high assertion & low assertion input SR latches.
3 OR Draw gated SR latch using NAND gates only.
OR Draw & explain in brief a high assertion input SR latch.
With the help of function table and circuit diagram explain the working of clocked SR flip flop. OR
4
Explain RS flip flop in detail.
5 Draw logic diagram, graphical symbol and Characteristic table for clocked D flip-flop.
6 Draw the circuit diagrams and Truth table of all the Flip flops (SR, D, T and JK).
Draw the truth tables for JK & T FF. Using these truth tables, derive & explain the excitation tables of
7
JK & T FF. OR Explain JK flip flop with its characteristic table and excitation table.
8 What is race around condition in JK flip flop.
9 Draw a frequency divider using JK FFs to divide input clock frequency by a factor of 8.
Explain working of master-slave JK flip-flop with necessary logic diagram, state equation and state
10
diagram. OR Explain Master Slave JK flip-flop with truth table and circuit diagram.
11 Convert D flip flop into SR flip flop
12 Implement D flip flop using JK flip flop.
13 Implement T flip flop using D flip flop.
Chapter-6 A/D and D/A Converters CO-4