There is no such thing as an R-S NAND gate.
The datasheet for a 7474 IC will give you a schematic for a D flipflop using NAND gates only.
You can construct a NAND gate using relays. If the contacts are in series, it is an AND gate. If the contacts are in parallel, it is an OR gate. Depending on which contact you use, it is a NOT gate. Simply pick the right combination of contacts and the meaning of the signal, and you can consider it to be a NAND gate.
Connect the two inputs of the NAND gate together.
the not gate applied to and gate is nand gate
XORing X with 1 gives X', i.e., NOT(X). If we are able to construct a NAND (AND) using XOR, we can also obtain AND (NAND) from it, which makes XOR a universal gate since inverted inputs to a NAND (AND) will give OR (NOR). However XOR is not a universal gate! Therefore we cannot obtain NAND (AND) using XOR. :-) By, Tirtha Sarathi Ghosh Class 10 IIT Kanpur Aspirant
NAND gates are universal gates and can be used to construct any of the logic gates (AND, OR, NOT, NOR, XOR, XNOR). The easiest way to figure this out is to use basic Boolean Laws. For instance, to create a NOT gate (A'), tie one of the NAND gate's input to logic high: (A+1)' = A'. To create an AND gate (AxB), use two NANDs in series, with the second one configured as an inverter: (AxB) = ((AxB)')'
when the two inputs are shorted, a NAND gate acts like a NOT gate. hence AND = NAND + NOT For OR gate, inverse both the inputs before connecting them to a NAND gate. So three NAND gates would be needed.
A nand gate can be made from an and gate by introducing an inverter at the output of the gate.
74ls00 is the ic no. Of nand gate
nand gate
That title of "Universal Gate" is reserved for NAND gates because you can build all possible logic using only NAND logic . You can build even other basic logic like AND, OR and NOT using NAND.
Next: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates ContentsUsing NAND gatesNOTFigure 12.10: Realizing a NOT gate using a NAND gateOR The following statements are called DeMorgan's Theorems and can be easily verified and extended for more than two variables.(12.1)(12.2)(12.3)(12.4)In general: (12.5)Thus :(12.6)Now it is easy to see that , which can be checked from the truth table easily. The resulting realization of OR gate is shown in 12.11Figure 12.11: Realization of OR gate by NAND gatesAND gateFigure 12.12: Realization of AND gate by NAND gatesX-OR gate(12.7)Clearly, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates.Figure 12.13: X-OR gateX-NOR gate(12.8)Again, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates, i.e., NAND or NOR gates.Figure 12.14: X-NOR gateNext: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates Contentsynsingh 2007-07-25
That title of "Universal Gate" is reserved for NAND gates because you can build all possible logic using only NAND logic . You can build even other basic logic like AND, OR and NOT using NAND.