Subtract the following Binary numbers using 1’s complement method, 111000101-101101
[3 marks]Explain Universal Gates with truth table.
[4 marks]Explain Full Adder with truth table and Logic Diagram.
[7 marks]Encode data bits 1010 into the 7-bit even parity Hamming code.
[3 marks]Prove De Morgan theorem with truth table.
[4 marks]Explain Full Subtractor with truth table and Logic Diagram.
[7 marks]Design 3-bit Magnitude Comparator.
[7 marks]Draw logic diagram of Boolean expression f = A+ABD+ABC + ABCD.
[3 marks]Expand f = C (A+B) to maxterms and minterms.
[4 marks]Design 16:1 MUX using 4:1 MUX (Multiplexer) Modules.
[7 marks]Explain Octal to Binary Encoder.
[3 marks]Explain 3-Line to 8-Line Decoder with logic Diagram.
[4 marks]Find the minimal expression for f = ∑m{2,3,4,7,11,12,13} using Kmap.
[7 marks]Explain D Flip –flop.
[3 marks]Reduce the Boolean Expression f = ∑m{0,2,3,4,7} using tabular Method.
[4 marks]Design 4-bit Gray to Binary Code Converter.
[7 marks]Implement Half adder with Programmable Logic Array.
[3 marks]Explain Serial IN, Serial Out shift register.
[4 marks]Explain Positive Edge triggered S-Rand J-K Flip Flops.
[7 marks]Write Excitation Tables of J-K Flip Flop and T-Flip Flop.
[3 marks]Explain Master- Slave J-Kflip flop.
[4 marks]Design Asynchronous Two-bit Ripple UP-Counter using Negative Edge-triggered J-K Flip-Flops.
[7 marks]Explain Applications of Flip Flops.
[3 marks]Describe Conversion of J-Kflip flop to Tflip flop.
[4 marks]Design Synchronous 3-bit UP Counter using JK flip flop.
[7 marks]