By14can
Hey,
We had a networking test yesterday, and this example came up. No one in the class knows how to solve it. The task is to convert this example to NAND (not AND). I need an explanation, please. The teacher is too lazy to explain it to us and just gave us a hint that we should use Morgan's Law.
thank you in advance
(No Ratings Yet)
Loading...Hello, I just got a shock from the electrical outlet. It didn't hurt, just a brief tingling sensation. As for me, I weigh almost 100 kg. Should I see a doctor about this, and was it even a real electric shock?
Hey, Example: I have a wooden box and would like to build a drawer into it that can be pulled out vertically. I would prefer it to work mechanically, but electronically is also an option. Does anyone have any ideas how to implement something like this or are there already systems that can be purchased?…
I'd like an LED projector that projects colors onto the wall and/or ceiling. Which one do you recommend? Dan should look like this Or so:
Hello everyone, I installed a Synology NAS in my parents' apartment (as family storage). My parents have a Fritz!Box. When I access the NAS via my Telekom router (via VPN and port forwarding so that I can use Windows Explorer), I have no problems. When my sister accesses the NAS via VPN, the speed is…
For example, does the force arm on the scissors always have to be larger than the load arm? I made a drawing of scissors but accidentally made the force arm smaller. Is that a problem? Thanks!
You can find this here:
https://de.m.wikipedia.org/wiki/De-morgansche_Laws
Under laws, other notation, is virtually your example, just a little shorter.
This is already a NAND equation.
You have an AND gate with 7 inputs, with input B and C negated. The solid cross-section above the equation tends the whole again, i.e. the output of your AND gate is now also negated while the inputs remain as above.
Probably you should make a NOR or OR out of it. To do this, you always “cut” the long bar where the AND link sign stands (^ ), thus each variable gets its own cross-slot. If one was present before (as with B and C), they are additionally retained.
By the “snowing” you also converge the links, because from And (^ ) becomes an Or (v ).