Scribd
Upload
22 views2 pages

Digital Suggestion

The document outlines various modules covering topics in digital logic design, including binary conversions, Boolean algebra simplifications, logic gate implementations, and circuit designs. It also includes exercises on flip-flops, shift registers, counters, and analog-to-digital converters. Each module contains specific tasks and theoretical explanations related to digital systems and their components.

Uploaded by

darkside9547
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
22 views2 pages

Digital Suggestion

The document outlines various modules covering topics in digital logic design, including binary conversions, Boolean algebra simplifications, logic gate implementations, and circuit designs. It also includes exercises on flip-flops, shift registers, counters, and analog-to-digital converters. Each module contains specific tasks and theoretical explanations related to digital systems and their components.

Uploaded by

darkside9547
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/ 2

MODULE 1:

1. Convert binary to decimal – (1011.101)2=(?)10


2. Convert decimal to octal- (19.11)10 = (?)8
3. Convert hexadecimal to decimal (81.21)16 = (?)10
4. Express the function Y = A+B′C in (a) Canonical SOP (b) Canonical POS
5. Subtract : (10100111)2 – (01110101)2
6. Simplify the expression:
A B  ABC  A( B  A B )
7. Simplify the Boolean function using K Map
F(A,B,C,D)= m (1,3,7,11,15)+ d (0,2,5)
8. Implement all logic gates using (i) NAND & (ii) NOR only.
9. Subtract : (1010)2 from (1111)2 using 2’s complement method.
10. Subtract (3250)10 from (72532)10 using 10’s complement method.
11. Simplify the expression using Boolean algebra ĀB+AB+ĀB̅
12. Explain De-Morgan's laws for simplification of Boolean expression
13. If AB̅ + ĀB=C, show that AC̅ +ĀC=B
14. Draw the circuit for AND logic operation using NAND gates.
15. Implement a NOT gate using NAND Gates.
16. Simplify the following expression using K Map for the 4 variables A, B, C, and D.
Y=m1+m3+m5+m7+m8+m9+m12+m13

MODULE 2:

1. Simplify the following expression using K Map for the 4 variables A, B, C, and D.
Y=m1+m3+m5+m7+m8+m9+m12+m13
2. Simplify the Boolean function using K Map F(A,B,C,D)= m (1,3,7,11,15)+ d
(0,2,5)
3. Realize a full adder using two half adder and an OR Gate.
4. Realize a full subtractor using two Half adder & OR gate.
5. Realize a full subtractor using all NAND gate.
6. What is parity bit? Explain operation of even and odd parity generator & checker
Circuit.
7. Implement a Full Subtractor using two 4:1 MUX.
8. Design a 8 to 3 Encoder.
9. What is a decoder circuit?
10. Design a Full Adder circuit using a 3 to 8 Decoder
11. Implement the following logic function using an 8x1 MUX: F (ABCD) = Σm
(1,3,4,11,12,13,14,15)
12. Design a 16:1 MUX using 4:1 MUX.
13. Design a 8:1 MUX using 4:1 MUX.
14. Implement the following function using 8:1 MUX: F(A,B,C,D) =
∑m(0,2,4,8,9)
15. Implement of F(A,B,C,D)=Σ(0,1,3,4,8,9,15) using 8 to 1 MUX.
16. Realize 8:1 MUX with the help of 4:1 MUX and an OR gate
17. Realize the function Using K-Map
18. (i) F(A,B,C,D) = Σm (1,2,4,5,6,9,12,14) + d(3,7)
(ii) F(A,B,C,D) = ΠM(1,3,5,7,9,11,13,15) + d(0,2,6,12)
(iii) F(A,B,C,D) = Σm (0,1,2,3,4,5) + d(10,11,12,13,14,15)
(iv) F(A,B,C,D) = Σm (0,2,3,6,7) + d(8,10,11,15)

MODULE 3:

1. Draw state diagram of S-R FF and write down it’s characteristics equation also write
excitation table of S R FF.
2. Draw J-K FF and write down its truth table.
3. Draw state diagram of J-K FF and write down it’s characteristics equation also write
excitation table of J-K FF.
4. What is race around condition? Explain how race around condition can be overcome
by master slave J-K FF.
5. Explain operation of SISO/SIPO/PISO/PIPO register.
6. A data stream 1011 has entered in SISO register. Draw the output waveform of the
register with input sequences.
7. Convert:
a) SR FF to JK FF
b) D FF to T FF
c) JK FF to D FF
d) JK FF to T FF
8. Draw J K, D & T FF with their state diagram, truth tables, characteristic equation &
excitation table.
9. What is shift register? Mention the types of different shift registers.
10. Draw and explain a Serial In- Parallel Out (SIPO) left shift register.
11. Explain operation Bidirectional shift register.
12. Design a Mod-6 Synchronous up counter.
13. Why asynchronous Counters are also known as Ripple Counters?
14. Design a 4-bit asynchronous binary up counter.
15. Explain operation of Ring counter and Johnson counter with its timing diagram.
16. Explain operation of Ring counter and Johnson counter with its timing diagram.

MODULE 4:

1. Explain AND, OR, NOR logic by TTL


2. R-2R ladder type DAC
3. Flash type ADC
4. Successive Approximation Type ADC
5. Operation of CMOS device
6. R-2R Digital-to-Analogue Converter

You might also like