Scribd
Upload
40 views3 pages

QB fINAL

Uploaded by

hamidlone08
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
40 views3 pages

QB fINAL

Uploaded by

hamidlone08
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/ 3

Module wise Question Bank

SUB (CODE): DDCO(BCS302)

MODULE 1
1. Express the function F=x+yz as the sum of its minterms and product of maxterms
2. Find the minimal SOP and minimal POS of the following Boolean function using K-Map.
f (a,b, c, d )  m(6, 7,9,10,13)  d (1, 4, 5,11)
3. List all Postulates and Theorems available in Boolean algebra?
4. Find the complement and simplify the Boolean function and also write logic circuit
F = A ′ B ′C ′ + A ′ B C .
5. Draw a two-level logic diagram to implement the Boolean function
F = BC ′ + A B + A C D .
6. Implement the Boolean function F = yz + z ′ y ′ + x ′ z With NAND gates.
7. Simplify the following using K-Map technique and find the Essential Prime Implicants.
(i) P  f (w, x, y, z)  m(7,9,12,13,14,15)  d (4,11)
(ii) Y  f (a,b, c, d )  (0,1, 2, 6, 7, 9,10,12)  d (3, 5). Verify the result using K-map.
(iii) f ( A, B,C, D)  m(0,1, 2, 3,10,11,12,13,14,15)
(iv) f (W, X ,Y , Z )  m(1, 3, 6, 7,8, 9,10,12,13,14)
8. Simplify the following expressions using Karnaugh map. Implement the simplified
circuit using the gates as indicated: .


(i) f (w, x, y, z)  m(1, 5,7, 9,10,13,15)  d (8,11,14) using NAND gates.
(ii) f (A, B,C, D)  M (0,1, 2, 4, 5, 6,8, 9,12,13,14) using NOR gates.

Proof of all theorems


Simplification of expressions using Karnaugh map. Implement the simplified circuit
using gates
Don’t care conditions
MODULE 2

1. What is a multiplexer? Design a 4 to 1 multiplexer using logic gates. Write the truth tableand
explain its working principle.
2. Construct 4:1 multiplexer using only 2:1 multiplexer
3. Construct 8:1 multiplexer using only 2:1 multiplexer.
4. Design 32 to 1 multiplexer using 16 to 1 multiplexer and one 2 to 1 multiplexer.
5. (a) Realize Y A B B C ABC using an 8 to 1 Multiplexer.(b) Can it be
realized with a 4 to 1multiplexer?
6. Design Half adder and Full adder. Explain and implement it using logic gates.
Differentiate between Combinational Circuit and Sequential Circuit.
7 Explain the working of Binary adder subtractor with suitable schematics .
8 Explain an Octal to binary encoder with truth table and mention its output
9 Implement the following Boolean function using 3:8 decoder
i) S(x,y,z)= Σm(1,2,4,7)
ii) C(x, y, z)Σm(3,5,6,7)
10 Explain 3:8 line Decoder with truth table and circuit diagram.
11 Write Verilog code for i)Full adder i) Half subtractor iii) Full subtractor
iv)Half adder
12 Implement the Boolean function using 8x1 MUX
F(A,B,C,D)=Σm(1,3,4,11,12,13,14,15)
13)Construct 8:1 multiplexer using two 4:1 multiplexers and one 2:1 multiplexer

You might also like