1) State De Morgan's theorem and prove it by implementing the circuit .
2) Design and setup a circuit to add three numbers x,y,z .
3) Implement a 3 input subtractor using nand gates only .
4) Setup 4-bit Up-Counter using D-FF.
5) Obtain the function AB + BC + CA using Nand gates only .
6) Derive a D-FF using a JK-FF .
7) Make a circuit to detect the sequence 1011000101 .
8) Full adder and Full subtractor using mode control .
9) Make a stopwatch circuit .
10) Set up a circuit to obtain the sequence 1,2,4,8,1,2,4,8... ... ...
11) Implement a circuit to perform shifting of given sequence towards left and towards right .
12) Generate both the sequences of Ring and Johnson with a single circuit .
13) Make a 3 bit Up / Down counter .
14) Implement circuit to select a single output from the given 4 inputs .
15) Setup a self starting mod-5 Up-counter .
16) Setup a self starting mod-5 Down-counter .
17) Obtain a circuit to convert the given 4-bit number to its corresponding Grey code .
18) Obtain a circuit to convert the given 3-bit number to its corresponding Excess three code .
19) Obtain a circuit to convert the given 4-bit number to its corresponding 2's complement .
20) Implement a fulladder / fullsubtractor with a single circuit .
21) Implement a full subtractor using 2 x 1 mux .
22) Design a circuit to obtain the sequence 1,2,4,8,1,3,7,15,14,12,8 ... ...
23) Derrive a JK-FF using D-FF .
24) Derrive a JK-FF using T-FF .
25) Derrive a T-FF using D-FF .
26) Derrive a T-FF using JK-FF .
No comments:
Post a Comment