Member since: 4 years
Educational Institution: Mepco Schlenk Engineering College
Country: India
PISO
PISONOR BASED SR FLIPFLOP
NOR BASED SR FLIPFLOPFULL SUBTRACTOR
FULL SUBTRACTOR4 bit ripple counter with decoded outputs
4 bit ripple counter with decoded outputs4 BIT UP-DOWN COUNTER
4 BIT UP-DOWN COUNTERDFF USING TFF
DFF USING TFFDFF USING JKFF
DFF USING JKFFJKFF USING DFF
JKFF USING DFFTFF USING SRFF
TFF USING SRFFRipple carry Adder
Ripple carry AdderBCD ADDER
BCD ADDERBinary to gray code converter
Binary to gray code converterD FLIPFLOP
D FLIPFLOP3 BIT PARITY CHECKER
3 BIT PARITY CHECKERD FLIPFLOP
D FLIPFLOPT FLIPFLOP
T FLIPFLOPSRFF using DFF
SRFF using DFFMOD 7 COUNTER
MOD 7 COUNTER16 to 1 MUX
16 to 1 MUXABSORPTION LAW 3
ABSORPTION LAW 3ABSORPTION LAW 3
ABSORPTION LAW 33 BIT PARITY GENERATOR
3 BIT PARITY GENERATOR4 BIT PARITY GENERATOR
4 BIT PARITY GENERATOR4 bit synchronous counter
4 bit synchronous counter24 TO 1 MUX USING 1 MUX
24 TO 1 MUX USING 1 MUX16 to 1 MUX
16 to 1 MUX16 to 1 MUX
16 to 1 MUXNOR USING 2 TO 1 MUX
NOR USING 2 TO 1 MUX32 TO 1 MUX USING 4 TO 1 MUX
32 TO 1 MUX USING 4 TO 1 MUXNOR USING 2 TO 1 MUX
NOR USING 2 TO 1 MUXEXOR USING 2 TO 1 MUX
EXOR USING 2 TO 1 MUXNOT USING 2 TO 1 MUX
NOT USING 2 TO 1 MUXCONSENSUS LAW 2
CONSENSUS LAW 2DISTRIBUTIVE PROPERTY
DISTRIBUTIVE PROPERTYDE MORGANS THEORM 2
DE MORGANS THEORM 2Verification of Boolean postulates and laws
Verification of Boolean postulates and lawsASSOCIATIVE LAW OF ADDITION
ASSOCIATIVE LAW OF ADDITIONDemorgans theorem-I
Demorgans theorem-ICOMMUTATIVE LAW OF MULTIPLICATION
COMMUTATIVE LAW OF MULTIPLICATIONDE MORGANS THEORM 1
DE MORGANS THEORM 1counter having the states 0-2--4-7-0
counter having the states 0-2--4-7-04 bit bidirectional shift register
4 bit bidirectional shift registerSIPO
SIPO16 to 1 MUX
16 to 1 MUXIMPLEMENTATION USING MUX(1)
IMPLEMENTATION USING MUX(1)ASSOCIATIVE LAW OF MULTIPLICATION
ASSOCIATIVE LAW OF MULTIPLICATIONABSORPTION LAW 4
ABSORPTION LAW 4NAND BASED SR FLIPFLOP
NAND BASED SR FLIPFLOPTFF USING JKFF
TFF USING JKFFBoolean postulates and law
Boolean postulates and lawDemorgans theprem-II
Demorgans theprem-II1-bit magnitude comparitor
1-bit magnitude comparitor4 to 2 priority encoder
4 to 2 priority encoderVERFICATION OF BOOLEAN LAWS AND POSTULATES
VERFICATION OF BOOLEAN LAWS AND POSTULATES2 x 4 DECODER
2 x 4 DECODERGray to binary code converter
Gray to binary code converter4 BIT UNIVERSAL SHIFT REGISTER
4 BIT UNIVERSAL SHIFT REGISTER3 bit binary counter
3 bit binary countersequence generator using counter
sequence generator using countermod-6 unit distance counter
mod-6 unit distance countercounter that counts 0,2,4,7,0
counter that counts 0,2,4,7,0SISO
SISOJKFlip
JKFlipde morgans theorem
de morgans theoremAS adder/subtractor
AS adder/subtractorFull Subtractor
Full SubtractorDecimal to BCD Encoder
Decimal to BCD Encoder4 x 2 ENCODER
4 x 2 ENCODER1 to 16 DEMUX
1 to 16 DEMUX4 to 2 priority encoder
4 to 2 priority encoder1 x 2 DECODER
1 x 2 DECODER3 x 8 DECODER
3 x 8 DECODER16 to 1 MUX
16 to 1 MUX8 TO 3 PRIORITY ENCODER
8 TO 3 PRIORITY ENCODER2 to 4 Decoder
2 to 4 Decoder8 to 1 mux
8 to 1 mux2 x 1 ENCODER
2 x 1 ENCODERIMPLEMENTION USING MUX(2)
IMPLEMENTION USING MUX(2)Half adder
Half adder16 bit parity generator
16 bit parity generator16-Bit Parity checker
16-Bit Parity checkerAS adder/subtractor
AS adder/subtractor2 bit MC
2 bit MC1 bit MC
1 bit MCHalf subtractor
Half subtractorJKFF USING DFF
JKFF USING DFFJKFF Using TFF
JKFF Using TFFDFF USING JKFF
DFF USING JKFFimplementation of full adder with mux and counter
implementation of full adder with mux and counterSRFF USING JKFF
SRFF USING JKFFSR FLIPFLOP
SR FLIPFLOPTFF
TFFJKFF Using TFF
JKFF Using TFFhomework 1
homework 1TFF USING DFF
TFF USING DFF4 bit synchronous UP/DOWN counter
4 bit synchronous UP/DOWN counterINVERSION LAW
INVERSION LAWBoolean postulates and law
Boolean postulates and law4 bit ripple counter
4 bit ripple counterHalf adder
Half adderFull adder
Full adderBCD to 7 segment decoder
BCD to 7 segment decoderOctal to Binary Encoder
Octal to Binary EncoderBCD to Decimal Decoder
BCD to Decimal Decoder4 to 1 multiplexer
4 to 1 multiplexer2 to 1 multiplexer
2 to 1 multiplexer2 BIT MAGNITUDE COMPARITOR
2 BIT MAGNITUDE COMPARITOR16 to 1 MUX
16 to 1 MUX4 bit ripple down counter
4 bit ripple down counterPIPO
PIPOSRFF USING TFF
SRFF USING TFFABSORPTION LAW 1
ABSORPTION LAW 14 bit synchronous up counter
4 bit synchronous up counterCONSENSUS theorem
CONSENSUS theoremHalf adder
Half adderAS adder/subtractor
AS adder/subtractorMOD 12 COUNTER
MOD 12 COUNTERDFF USING SRFF
DFF USING SRFFMUX with counter
MUX with counter4 bit synchronous down counter
4 bit synchronous down counterMUX with counter
MUX with counterimplementation of full adder with mux and counter
implementation of full adder with mux and counterJK FLIPFLOP
JK FLIPFLOPD FLIPFLOP
D FLIPFLOPOR USING 2 TO 1 MUX
OR USING 2 TO 1 MUXCONSENSUS THEROEM
CONSENSUS THEROEMCOMMUTATIVE LAW OF ADDITION
COMMUTATIVE LAW OF ADDITIONVerification of Boolean postulates and laws
Verification of Boolean postulates and lawsDISTRIBUTIVE PROPERTY 2
DISTRIBUTIVE PROPERTY 24 BIT RIPPLE UP-DOWN COUNTER
4 BIT RIPPLE UP-DOWN COUNTER4 bit synchronous down counter
4 bit synchronous down counterExcess -3 to BCD Converter
Excess -3 to BCD Convertercircuit that counts (0,2,4...14)when input is 1 and counts (1,3...15)when input is 0
circuit that counts (0,2,4...14)when input is 1 and counts (1,3...15)when input is 016 to 1 MUX
16 to 1 MUX3 BIT PARALLEL MULTIPLIER
3 BIT PARALLEL MULTIPLIERBCD to excess-3 converter
BCD to excess-3 converterABSORPTION LAW 2
ABSORPTION LAW 2implementation of full adder using counter
implementation of full adder using counter4 bit synchronous counter with ripple carry
4 bit synchronous counter with ripple carryJKFF using SRFF
JKFF using SRFFIMPLEMENTATION USING MUX(1)
IMPLEMENTATION USING MUX(1)4 bit synchronous counter with ripple carry
4 bit synchronous counter with ripple carry