Questions of DF

Download as pdf or txt
Download as pdf or txt
You are on page 1of 5

DF

2019-2021
QUESTIONS:
3 MARKS:
1. Do as Directed
1. Given that (16)10 = (100)x. Find the value of x.
2. Add (6E)16 and (C5)16.
3. (1011011101101110)2 = (_____)8 = (_____)16.
2. Express the Boolean function F = A + B’C in a sum of minterms.
3. Simplify the Boolean function F (w, x, y, z) = Σ m (0, 1, 2, 4, 5, 6,
8, 9, 12, 13, 14)
OR
Simplify the Boolean function F = A’B’C’ + B’CD’ + A’BCD’ + AB’C’
4. Explain SR flip-flop using characteristic table & characteristic equation
Or
What is the race around condition in JK flip-flop?
5. Explain the specification of D/A converter
Or
Explain classification of Memories.
6. Prove following using the Boolean algebraic theorems: 1. A + A’B + AB’
= A + B 2. AB + A’B + A’B’ = A’ + B
7. Minimize following Boolean function using K-map: X(A,B,C,D) = Σ m(0,
1, 2, 3, 5, 7, 8, 9, 11, 15)
8. Construct D FF using SR FF. Write truth table of D FF.
Or
List out various application of the shift register and explain any one.
9. List out various methods of simplifying a given Boolean function. Solve
F = AB + AB’ using any two methods.
Or
Minimize the following logic function using K-map: F(A,B,C,D) = Σ m(1,
3, 5, 8, 9, 11, 15) + d(2,13)
10. Differentiate between RAM & ROM.
Or
Compare SRAM with DRAM
11. Realize AND, OR and NOT gate using NAND gates only.
12. Define following: Figure of merit, Noise margin, and Power dissipation.
DF
2019-2021
13. Draw the logic diagram of 1-digit BCD adder
14. Draw truth table of 2-bit digital comparator.
15. Design D FF using SR FF. Write truth table of D FF.
16. List out and explain any one application of the register.
17. Draw internal organization of a 16 x 4 memory chip.
18. List out various characteristics of a D/A converter. Discuss any one.

4 MARKS:
1. State and explain De Morgan’s theorems with truth tables.
2. Reduce the expression F = A [ B + C’ (AB + AC’)’]
3. Design 1 - bit Magnitude Comparator.
Or
Explain 4 – bit parallel adder.
4. Explain the working of SISO shift register.
Or
Design 4-bit Ring counter using D flip-flip.
5. Explain R-2R ladder type D/A converter,
Or
Explain the types of ROM.
6. List out three basic logic operations. Realize these operations
using NOR gates only.
7. A. Convert Y = AB + AC’ + BC into canonical SOP form.
B. Convert Z = (A+B) (A+C) (B+C’) into canonical POS form.
8. Draw & explain in brief the logic diagram of 4-bit bidirectional
shift register.
Or
Construct a 3-bit ripple up counter with preset and clear facility using T
FFs.
9. Discuss any two characteristics of a D/A converter.
Or
Write a brief note on quantization and encoding.
10. How SR FF can be converted into JK FF? Draw & explain in brief.
DF
2019-2021
Or
Draw & explain the block diagram of ALU.
11. State and prove De-Morgan’s theorems using truth-tables.
12. Construct Hamming code for BCD 0110. Use even parity.
13. Minimize following Boolean function using K-map: Y(A,B,C,D) = Σ
m(0, 1, 2, 3, 5, 7, 8, 9, 11, 14)
14. Minimize following Boolean function using K-map: F(A,B,C,D) = Σ
m(1, 3, 7, 11, 15) + d(0, 2, 5)
15. Draw & explain in brief the logic diagram of 4-bit bidirectional
shift register
16. Design a 4-bit ripple up counter using JK flip-flops.
17. Write a brief note on quantization and encoding.
18. Obtain 2048 x 8 memory using 256 x 8 memory chips.

7 MARKS:
1. Implement AND, OR, & EX-OR gates using NAND & NOR gates
2. Simplify the following Boolean function by using the tabulation
method.
F (A, B, C, D) = Σ m (0, 1, 2, 8, 10, 11, 14, 15)
OR
Using D & E as the MEV, Reduce F = A’B’C’ + A’B’CD + A’BCE’ +
A’BC’E + AB’C + ABC + ABC’D’.
3. Design a full adder and realize full adder using 3X8 Decoder and 2
OR gates.
Or
Implement the following function using 8X1 MUX F (A, B, C, D) = Σ m
(0, 1, 3, 4, 8, 9, 15)
4. Design a counter with the following binary sequence: 0, 1, 3, 7, 6, 4
and repeat. Use T – flip-flops.
Or
Design JK flip-flip using D flip-flip.
5. Explain Successive Approximation Type A/D converter.
Or
DF
2019-2021
A combinational circuit is defined by the function
F1 (A, B, C,) = Σ m (4, 5, 7)
F2 (A, B, C,) = Σ m (3, 5, 7)
Implement the circuit with a PLA having 3 inputs, 3 product term &
2 outputs.
6. Do as directed:
a. Express decimal number 60.875 into binary form.
b. One 8421 code word is transmitted in Hamming code with even
parity checking. The received word is 0101000. Find out the correct
code word and write decimal equivalent.
7. Write a brief note on BCD-to-7-segment decoder/driver. Set up a
single 7-segement LED display using 7447 BCD-to-7-segment
decoder/driver.
OR
Write a brief note on full subtractor with the help of its TT. Also
design full subtractor logic circuit using 3 x 8 decoder and OR gates.
Use X, Y, & Z as input variables and D & B as output variables.
8. Design a 3-bit synchronous up counter using JK flip-flops
Or
Write a short note on the applications of the flip-flops.
9. Draw & explain weighted-resistor D/A converter with necessary
equations.
Or
Draw & explain Flash A/D converter with necessary decoding table.
Also mention pros & cons of the same.
10.Write a short note on ROM & its types.
Or
Draw and explain in brief block diagram of CPLD. Also compare
CPLD with FPGA.
11.Draw and explain in detail the block diagram of CPLD.
12.Write a detailed note on various types of memories.
13.List out various commonly used A/D converters. Draw & explain any
one A/D converter.
DF
2019-2021
14.List out various commonly used D/A converters. Draw & explain any
one D/A converter.
15.Design a 4-bit synchronous down counter using T flip-flops.
16.Write a brief note on race around condition and its solution. Draw &
explain the logic diagram of master-slave JK flip-flop.
17.Given a logic function: Z = ABC + BC’D + A’BC.
(i) Make a truth table.
(ii) Simplify using K-map.
(iii) Realize simplified function using NAND gates only.
18.Do as directed:
(a) (1111.11)2 = ( ? )8 = ( ? )10
(b) 23 – 48 using 2’s complement method
(c) (396)10 = ( ? )BCD = ( ? ) EX-3
(d) (11111)2 = ( ? )Gray

You might also like