My files has been uploaded.
Q1 a) Prove the Demorgan’s laws using Boolean algebra.
b) Find the minimal sum of product expression for the following Switching
function. F (x1, x2, x3, x4, x5) = Sm (1, 2, 3, 6, 8, 9, 14, 17, 24, 25, 26, 27,
30, 31)
+ Sd(4,5) Q2 a) Explain the working of master-slave JK
flip flop. State its merit. What is Race problem in flip- flops? b) Design a
negative edge triggered T flip flop. The circuit has two inputs, T(toggle) and
C(clock) and output Q and Q’. The output state is
complemented if T=1 and the clock C changes from 1 to 0. Otherwise under any
other input condition, the output Q remains unchanged. Q3 a) Differentiate
between:
i) Combinational and Sequential Logic Circuits. ii)
Synchronous and Asynchronous Counters Q4 Do
as directed
a) Conversion of 100.55 base 10 into binary, octal codes.
b) Conversion of 1111010011011110 base 2 to decimal, hexadecimal.
Q5 a) Draw the circuit of a 3 to 8 decoder and explain its operation. How this can
be used as a DEMUX. b) Design and explain Priority encoder.
